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.
TNAHosting是一家成立于2012年的国外主机商,提供VPS主机及独立服务器租用等业务,其中VPS主机基于OpenVZ和KVM架构,数据中心在美国芝加哥机房。目前,商家在LET推出芝加哥机房大硬盘高配VPS套餐,再次刷新了价格底线,基于OpenVZ架构,12GB内存,500GB大硬盘,支持月付仅5美元起。下面列出这款VPS主机配置信息。CPU:4 cores内存:12GB硬盘:500GB月流...
wordpress高级企业自适应主题,通用型企业展示平台 + 流行宽屏设计,自适应PC+移动端屏幕设备,完美企业站功能体验+高效的自定义设置平台。一套完美自适应多终端移动屏幕设备的WordPress高级企业自适应主题, 主题设置模块包括:基本设置、首页设置、社会化网络设置、底部设置、SEO设置; 可以自定义设置网站通用功能模块、相关栏目、在线客服及更多网站功能。点击进入:wordpress高级企业...
Vinahost,这个主机商还是第一次介绍到,翻看商家的介绍信息,是一家成立于2008年的老牌越南主机商,业务涵盖网站设计、域名、SSL证书、电子邮箱、虚拟主机、越南VPS、云计算、越南服务器出租以及设备托管等,机房主要在越南胡志明市的Viettle和VNPT数据中心,其中VNPT数据中心对于国内是三网直连,速度优。类似很多海外主机商一样,希望拓展自己的业务,必须要降价优惠或者增加机房迎合需求用户...
let美人双胞胎姐妹为你推荐
域名注册com如何注册.com.cn域名vpsvps什么意思空间域名空间和域名是什么?网站空间域名网站空间,域名,操作网站域名空间网站域名和空间网站空间申请网站空间申请什么是虚拟主机虚拟主机是什么?合肥虚拟主机虚拟主机怎么弄!虚拟主机mysql虚拟主机支持mysql数据库,还需要额外购买mysql吗?云南虚拟主机云南服务器托管
海外虚拟主机 cc域名 vps推荐 最便宜虚拟主机 什么是域名解析 lamp burstnet mediafire下载 512m unsplash 京东云擎 天猫双十一抢红包 ibox官网 789电视网 秒杀汇 河南移动网 申请网页 服务器硬件防火墙 shopex主机 华为云盘 更多