AnIntroductiontoTheTwinPrimeConjectureAllisonBerkeDecember12,2006AbstractTwinprimesareprimesoftheform(p,p+2).
Therearemanyproofsfortheinnitudeofprimenumbers,butitisverydiculttoprovewhetherthereareaninnitenumberofpairsoftwinprimes.
Mostmathematiciansagreethattheevidencepointstowardthisconclusion,butnumerousattemptsataproofhavebeenfalsiedbysubsequentreview.
Theproblemitself,oneofthemostfamousopenproblemsinmathematics,hasyieldedanumberofrelatedresults,includingBrun'sconjecture,Mertens'theorems,andtheHardy-LittlewoodConjecture.
Alongwiththeseconjectures,thereareanumberofresultswhichareeasiertoarriveat,butneverthelesshelpmathematiciansthinkabouttheinnitudeofprimes,andthespecialpropertiesoftwinprimes.
Thispaperwillintroducetheaforementionedconjecturesassociatedwiththetwinprimeconjecture,andworkthroughsomeexercisesthatilluminatethedicultiesandintricaciesofthetwinprimeconjecture.
1Introduction:TheOriginalConjectureandFailedProofsThetermtwinprimewascoinedbyPaulStackelinthelatenineteenthcentury.
Sincethattime,mathematicianshavebeeninterestedinthepropertiesofrelatedprimes,bothinrelationtonumbertheoryasawhole,andasspecic,well-denedproblems.
Oneoftherstresultsoflookingattwinprimeswasthediscoverythat,asidefrom(3,5),alltwinprimesareoftheform6n±1.
Thiscomesfromnoticingthatanyprimegreaterthan3mustbeoftheform6n±1.
Toshowthis,notethatanyintegercanbewrittenas6x+y,wherexisanyinteger,andyis0,1,2,3,4or5.
Nowconsidereachyvalueindividually.
Wheny=0,6x+y=6xandisdivisibleby6.
Wheny=1therearenoimmediatelyrecognizablefactors,sothisisacandidateforprimacy.
Wheny=2,6x+2=2(3x+1),andsoisnotprime.
Forthecasewhen·y=3:6x+3=3(2x+1)andisnotprime.
Wheny=4:6x+4=2(3x+2)··andisnotprime.
Wheny=5,6x+5hasnoimmediatelyrecognizablefactors,andisthesecondcandidateforprimacy.
Thenallprimescanberepresentedaseither6n+1or6n1,andtwinprimes,sincetheyareseparatedbytwo,willhavetobe6n1and6n+1.
1TwinPrimeConjecture2Furtherresearchintotheconjecturehasbeenconcernedwithndingexpressionsforaformoftheprimecountingfunctionπ(x)thatdependonthetwinprimeconstant.
Theprimecountingfunctionisdenedasπ(x)={N(p)|px}whereN(p)denotesthenumberofprimes,p.
Onemotivationfordeningtheprimecountingfunctionisthatitcanbeusedtodetermineaformulaforthesizeoftheintervalsbetweenprimes,aswellasgivingusanindicationoftherateofdecaybywhichprimesthinoutinhighernumbers.
Ithasbeenshownalgebraicallythattheprimecountingfunctionincreasesasymptoticallywiththelogarithmicintegral[12].
Inthefollowingexpression,π2(x)referstothenumberofprimesoftheformpandp+2greaterthanx,andisthetwin2primeconstant,whichisdenedbytheexpression(19p11)2)overprimesp2.
ThetermO(x),meaning"ontheorderofx,"isdenedasfollows:iff(x)andg(x)aretwofunctionsdenedonthesameset,thenf(x)isO(g(x))asxgoestoinnityifandonlyifthereexistssomex0andsomeMsuchthat|f(x)|M|g(x)|forxgreaterthanx0.
Thisexpressionforthetwinprimecountingfunctionisπ2(x)cΠ2x[1+O(ln(ln(x)))](1)(ln(x))2ln(x)whichisthebestthathasbeenproventhusfar.
Theconstantcin(1)hasbeenreducedto6.
8325,downfrompreviousvaluesashighas9[12].
TheformationofthisinequalityinvolvestwoofMerten'stheoremswhichwillbediscussedinthefollowingsection.
HardyandLittlewood[3]haveconjecturedthatc=2,andusingthisassumptionhaveformulatedwhatisnowcalledtheStrongTwinPrimeConjecture.
Inthefollowingexpression,abmeansthataapproaches1batthelimitsoftheexpressionsaandb.
Inthiscase,thelimitisasxapproachesinnity.
xdxπ2(x)2Π2(ln(x))2.
(2)2Anecessaryconditionforthestrongconjecture(2)isthattheprimegapsconstant,Δ≡limsupn→∞pn+1pnbeequaltozero.
ThemostrecentattemptedpnproofofthetwinprimeconjecturewasthatofArenstorf,in2004[1],butanerrorwasfoundshortlyafteritspublication,anditwaswithdrawn,leavingtheconjectureopentothisday.
2Mertens'TheoremsAnumberofimportantresultsaboutthespacingofprimenumberswerederivedbyFranzMertens,aGermanmathematicianofthelatenineteenthandearlytwentiethcentury.
ThefollowingproofsofMertens'conjecturesleaduptotheresultthatthesumofthereciprocalsofprimesdiverges,whichwillcontrast3TwinPrimeConjecturewithBrun'sconjecture,thatthesumofthereciprocalsoftwinprimesconverges.
First,weshouldbrieyshowthattheprimesareinnite,forotherwisetheimplicationsofMertens'theoremsarenotobvious.
Euclid'sproofofthispostulate,hissecondtheorem,isasfollows.
Let2,3,5,.
.
.
,pbeanenumerationofallprimenumbersuptop,andletq=(235·.
.
.
p)+1.
Thenqisnotdivisiblebyanyoftheprimesup···toandincludingp.
Therefore,itiseitherprimeordivisiblebyaprimebetweenpandq.
Intherstcase,qisaprimegreaterthanp.
Inthesecondcase,thedivisorofqbetweenpandqisaprimegreaterthanp.
Thenforanyprimep,thisconstructiongivesusaprimegreaterthanp.
Thus,thenumberofprimesmustbeinnite[4].
NowwecanresumewithMertens'theorems.
MertensTheorem1:Foranyrealnumberx≥1,x0≤ln(n)0suchthat11p=ln(ln(x))+b1+O(ln(x)),x≥2.
(6)p≤x6TwinPrimeConjectureProof:Wecanwrite1=ln(p)1=u(n)f(n)ppln(p)p≤xp≤xn≤xwhereu(n)=ln(pp)ifn=p,and0otherwise,andf(t)=ln(1t).
WedenenewfunctionsU(t)andg(t)asfollowsln(p)U(t)=u(n)==ln(t)+g(t)pn≤tp≤tThenU(t)=0fort3TheformulationoftheHardy-LittlewoodconjecturebuildsuponsomeofthetechniquesusedtoproveBrun'sconjecture,namelytheBrunsievetechniques.
TheBrunsievecanbeconstructedasfollows:LetXbeanonempty,nitesetofNobjects,andletP1,PrberdierentpropertiesthattheelementsofthesetXmighthave.
LetN0denotethenumberofelementsofXthathavenoneoftheseproperties.
ForanysubsetI={i1,ik}of{1,2,r},letN(1)=N(i1,ik)denotethenumberofelementsofXthathaveeachofthepropertiesPi1,Pi2Pik.
LetN()=|X|=N.
Ifmisanonnegativeeveninteger,thenmN0≤(1)kN(I).
(9)k=0|I|=kIfmisanonnegativeoddinteger,thenmN0≥(1)kN(I).
[8](10)k=0|I|=kTheproofgiveninNathanson[8]isasfollows.
LetxbeanelementofthesetX,andsupposethatxhasexactlylpropertiesPi.
Ifl=0,thenxiscountedonceinN0andonceinN(),butisnotcountedinN(I)ifIisnonempty.
Ifl≥1,thenxisnotcountedinN0.
Byrenumberingtheproperties,wecanassumethatxhasthepropertiesP1,P2,Pl.
LetI{1,2,l,r}.
Ifi∈Iforsomei>l,thenxisnotcountedinN(I).
IfI{1,2,l}thenxcontributes1toN(I).
Foreachk=0,1,l,thereareexactlyklsuchsubsetswith|I|=k.
Ifm≥l,thentheelementxcontributesll(1)k=0kk=0TwinPrimeConjecture9totherightsidesoftheinequalities.
Ifm2cln(ln(x)),then·rrcln(ln(x)))k1xy(·m≤x2k2cln(ln(x)).
Ifweletc=max{2c,(ln(2)1)},andlet·ln(y)1x=e(3c·ln(ln(y)))=y3c·ln(ln(y))m=2[cln(ln(y))]·Thensinceln(y)ln(x)=3c·ln(ln(y))yy(ln(ln(y)))22c·ln(ln(y))2,y4y4y4y2m<22c·ln(ln(y))=(ln(y))2c·ln(2)≤(ln(y))2Thenm2cln(ln(y))2c·ln(ln(y)ln(y))32x≤x·=exp(ln(ln(y)))=y3c·Finally,x(ln(ln(x)))2π2(x)<<.
(ln(x))2TwinPrimeConjecture126ConclusionThetwinprimeconjecturemayneverbeproven,butstudyingthepropertiesoftwinprimesiscertainlyarewardingexercise.
RecentworkonthetwinprimeconjecturebyDanGoldstonandCemYilidrimhasfocusedoncreatingexpressionsforthegapsizebetweenprimes,andinparticularfocusingontheexpressionΔ=liminfpn+1pn=1n→∞ln(pn)ResearchintobetterexpressionsfortheintervalbetweenconsecutiveprimesiscurrentlybeingconductedatStanford,sponsoredbytheAmericanInstituteofMathematics[12].
Thoughnumbertheoryhasbeenthefoundationofmanydierentbranchesofhighermathematics,itsfundamentalproblemsremaininterestingandfruitfulforresearchersinterestedinthepropertiesofprimenumbers.
References[1]Arenstorf,R.
F.
"ThereAreInnitelyManyPrimeTwins.
"26May2004.
http://arxiv.
org/abs/math.
NT/0405509.
[2]Guy,R.
K.
"GapsbetweenPrimes.
TwinPrimes.
"A8inUnsolvedProblemsinNumberTheory,2nded.
NewYork:Springer-Verlag,pp.
19-23,1994.
[3]Hardy,G.
H.
andLittlewood,J.
E.
"SomeProblemsof'PartitioNumerorum.
'III.
OntheExpressionofaNumberasaSumofPrimes.
"ActaMath.
44,1-70,1923.
[4]Hardy,G.
H.
andWright,E.
M.
AnIntroductiontotheTheoryofNumbers,5thed.
Oxford,England:ClarendonPress,1979.
[5]Havil,J.
Gamma:ExploringEuler'sConstant.
Princeton,NJ:PrincetonUniversityPress,pp.
30-31,2003.
[6]Miller,S.
J.
andTakloo-Bighash,R.
AnInvitationtoNumberTheory.
Princeton,NJ:PrincetonUniversityPress,pp.
326-328,2006.
[7]Narkiewicz,W.
TheDevelopmentofPrimeNumberTheory.
Berlin,Germany:SpringerPress,2000.
[8]Nathanson,M.
B.
AdditiveNumberTheory.
NewYork,NewYork:SpringerPress,1996.
[9]Ribenboim,P.
TheNewBookofPrimeNumberRecords.
NewYork:Springer-Verlag,pp.
261-265,1996.
[10]Shanks,D.
SolvedandUnsolvedProblemsinNumberTheory,4thed.
NewYork:Chelsea,p.
30,1993.
13TwinPrimeConjecture[11]Tenenbaum,G.
"ReArenstorf'spaperontheTwinPrimeConjecture.
"8Jun2004.
[12]Weisstein,EricW.
"TwinPrimeConjecture"http://mathworld.
wolfram.
com/TwinPrimeConjecture.
html,2006.
[13]Young,R.
M.
ExcursionsinCalculus.
TheMathematicalAssociationofAmerica,1992.
Ceraus数据成立于2020年底,基于KVM虚拟架构技术;主营提供香港CN2、美国洛杉矶CN2、日本CN2的相关VPS云主机业务。喜迎国庆香港上新首月五折不限新老用户,cera机房,线路好,机器稳,适合做站五折优惠码:gqceraus 续费七五折官方网站:https://www.ceraus.com香港云内存CPU硬盘流量宽带优惠价格购买地址香港云2G2核40G不限5Mbps24元/月点击购买...
HostKvm商家我们也不用多介绍,这个服务商来自国内某商家,旗下也有多个品牌的,每次看到推送信息都是几个服务商品牌一起推送的。当然商家还是比较稳定的,商家品牌比较多,这也是国内商家一贯的做法,这样广撒网。这次看到黑五优惠活动发布了,针对其主打的香港云服务器提供终身6折的优惠,其余机房服务器依然是8折,另还有充值50美元赠送5美元的优惠活动,有需要的可以看看。HostKvm是一个创建于2013年的...
速云怎么样?速云,国人商家,提供广州移动、深圳移动、广州茂名联通、香港hkt等VDS和独立服务器。现在暑期限时特惠,力度大。广州移动/深圳移动/广东联通/香港HKT等9折优惠,最低月付9元;暑期特惠,带宽、流量翻倍,深港mplc免费试用!点击进入:速云官方网站地址速云优惠码:全场9折优惠码:summer速云优惠活动:活动期间,所有地区所有配置可享受9折优惠,深圳/广州地区流量计费VDS可选择流量翻...
let美人双胞胎姐妹为你推荐
服务器租用武汉服务器租用,托管哪个公司好?网络域名注册怎么注册网络域名并建立自己的网站呢域名注册网网站域名申请,在那备案?vps主机云主机和VPS主机之间有什么区别免费国外空间免费国外空间云服务器租用谁知道租用服务器、云主机去哪里租?服务器租用费用价格是多少呀网站空间购买企业网站空间购买的网站空间具体需要多大的合适?山东虚拟主机济宁梦网科技大连虚拟主机找个大连企业建站公司,大家给推荐一下吧。沈阳虚拟主机为什么修改了虚拟机Vmware的TCP/IP配置以后就上不了网
linuxapache虚拟主机 香港加速器 表单样式 腾讯实名认证中心 免费全能主机 南通服务器 天翼云盘 免费网页申请 厦门电信 论坛主机 php服务器 免备案jsp空间 重庆联通服务器托管 ping值 symantec 堡垒主机 魔兽世界服务器维护 万网空间价格 gg广告联盟 元旦促销活动方案 更多