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.
A2Hosting主机,A2Hosting怎么样?A2Hosting是UK2集团下属公司,成立于2003年的老牌国外主机商,产品包括虚拟主机、VPS和独立服务器等,数据中心提供包括美国、新加坡softlayer和荷兰三个地区机房。A2Hosting在国外是一家非常大非常有名气的终合型主机商,拥有几百万的客户,非常值得信赖,国外主机论坛对它家的虚拟主机评价非常不错,当前,A2Hosting主机庆祝1...
digital-vm,这家注册在罗马尼亚的公司在国内应该有不少人比较熟悉了,主要提供VPS业务,最高10Gbps带宽,还不限制流量,而且还有日本、新加坡、美国洛杉矶、英国、西班牙、荷兰、挪威、丹麦这些可选数据中心。2020年,digital-vm新增了“独立服务器”业务,暂时只限“日本”、“新加坡”机房,最高也是支持10Gbps带宽... 官方网站:https://digital-vm.co...
说明一下:gcorelabs的俄罗斯远东机房“伯力”既有“Virtual servers”也有“CLOUD SERVICES”,前者是VPS,后者是云服务器,不是一回事;由于平日大家习惯把VPS和云服务器当做一回事儿,所以这里要特别说明一下。本次测评的是gcorelabs的cloud,也就是云服务器。 官方网站:https://gcorelabs.com 支持:数字加密货币、信用卡、PayPal...
let美人双胞胎姐妹为你推荐
广东虚拟主机大家推荐一下广东地区稳定的IDCvps试用求个免费现成的vps(可永久可试用)免费vps服务器有没有便宜的vps,最好是免费的香港虚拟空间香港虚拟空间哪家好?虚拟空间哪个好哪个网络服务商的虚拟空间服务比较好呢?免费网站空间免费个人网站 空间免费网站空间申请哪个网站可以申请免费的网页空间郑州虚拟主机59互联 亿恩科技 和郑州景安那一个公司的虚拟主机最好!我指的是速度和服务!谢谢!请大家凭良心说话!华众虚拟主机管理系统星外,华众,依然这三个虚拟主机管理系统中哪个好备案域名购买哪有备案好的域名购买?
虚拟主机管理软件 vps虚拟服务器 双线vps 什么是域名解析 如何注册中文域名 互联网域名管理办法 美国独立服务器 edgecast paypal认证 dropbox网盘 论坛空间 福建天翼加速 老左来了 银盘服务是什么 外贸空间 百度云空间 防cc攻击 成都主机托管 乐视会员免费领取 免费获得q币 更多