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.
3C云互联怎么样?3C云互联专注免备案香港美国日本韩国台湾云主机vps服务器,美国高防CN2GIA,香港CN2GIA,顶级线路优化,高端品质售后无忧!致力于对互联网云计算科技深入研发与运营的极客共同搭建而成,将云计算与网络核心技术转化为最稳定,安全,高速以及极具性价比的云服务器等产品提供给用户!专注为个人开发者用户,中小型,大型企业用户提供一站式核心网络云端服务部署,促使用户云端部署化简为零,轻松...
提速啦简单介绍下提速啦 是成立于2012年的IDC老兵 长期以来是很多入门级IDC用户的必选商家 便宜 稳定 廉价 是你创业分销的不二之选,目前市场上很多的商家都是从提速啦拿货然后去分销的。提速啦最新物理机活动 爆炸便宜的香港CN2物理服务器 和 日本CN2物理服务器香港CTG E5 2650 16G内存 20M CN2带宽 1T硬盘 150元/月日本CN2 E5 2650 16G内存 20M C...
可以看到这次国庆萤光云搞了一个不错的折扣,香港CN2产品6.5折促销,还送50的国庆红包。萤光云是2002年创立的商家,本次国庆活动主推的是香港CN2优化的机器,其另外还有国内BGP和高防服务器。本次活动力度较大,CN2优化套餐低至20/月(需买三个月,用上折扣+代金券组合),有需求的可以看看。官方网站:https://www.lightnode.cn/地区CPU内存SSDIP带宽/流量价格备注购...
let美人双胞胎姐妹为你推荐
虚拟主机租用虚拟主机服务器租用要怎么选择?免费国内空间中国有什么免费的空间域名服务商比较专业的域名服务商有哪些?好的域名和域名服务商没关系吧?查询ip怎么查看IP地址重庆虚拟空间重庆那里可以租用VSP主机网站空间商域名空间商怎么做手机网站空间手机登陆qq空间网址是什么?虚拟主机管理系统虚拟主机管理系统那一家好?上海虚拟主机谁能告诉我杭州哪个公司的虚拟主机最好,机房最好是上海或浙江的.域名解析域名解析是什么意思啊?
已备案域名 重庆域名注册 中文域名交易中心 qq云存储 enom realvnc ubuntu更新源 lamp配置 java虚拟主机 最好的空间 cn3 空间登陆首页 视频服务器是什么 架设邮件服务器 重庆电信服务器托管 江苏双线 windowssever2008 ncp是什么 web是什么意思 windowsserver2012 更多