decaylet美人双胞胎姐妹

let美人双胞胎姐妹  时间:2021-01-15  阅读:()
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.

优林云(53元)哈尔滨电信2核2G

优林怎么样?优林好不好?优林 是一家国人VPS主机商,成立于2016年,主营国内外服务器产品。云服务器基于hyper-v和kvm虚拟架构,国内速度还不错。今天优林给我们带来促销的是国内东北地区哈尔滨云服务器!全部是独享带宽!首月5折 续费5折续费!地区CPU内存硬盘带宽价格购买哈尔滨电信2核2G50G1M53元直达链接哈尔滨电信4核4G50G1M83元直达链接哈尔滨电信8核8G50G1M131元直...

云步云72.5元/月起云服务器,香港安畅/葵湾/将军澳/沙田/大浦CN2机房,2核2G5M

云步云怎么样?云步云是创建于2021年的品牌,主要从事出售香港vps、美国VPS、日本VPS、香港独立服务器、香港站群服务器等,机房有香港、美国、日本东京等机房,目前在售VPS线路有CN2+BGP、CN2 GIA,香港的线路也是CN2直连大陆,该公司旗下产品均采用KVM虚拟化架构。目前,云步云提供香港安畅、沙田、大浦、葵湾、将军澳、新世界等CN2机房云服务器,2核2G5M仅72.5元/月起。点击进...

云基Yunbase无视CC攻击(最高500G DDoS防御),美国洛杉矶CN2-GIA高防独立服务器,

云基yunbase怎么样?云基成立于2020年,目前主要提供高防海内外独立服务器,欢迎各类追求稳定和高防优质线路的用户。业务可选:洛杉矶CN2-GIA+高防(默认500G高防)、洛杉矶CN2-GIA(默认带50Gbps防御)、香港CN2-GIA高防(双向CN2GIA专线,突发带宽支持,15G-20G DDoS防御,无视CC)。目前,美国洛杉矶CN2-GIA高防独立服务器,8核16G,最高500G ...

let美人双胞胎姐妹为你推荐
租用主机哪个平台可以租电脑中国互联网域名注册负责我国境内internet用户域名注册是什么机构域名代理怎样通过卖域名赚钱?域名注册查询怎么查看域名是否注册域名备案域名怎么备案网站空间购买怎么购买一个网站空间及购买注意事项虚拟主机mysql虚拟主机支持mysql数据库,还需要额外购买mysql吗?东莞虚拟主机在东莞服务器租用怎么选择windows虚拟主机windows10用什么虚拟机厦门虚拟主机新手用什么虚拟主机好?
万网域名注册 中文国际域名 n点虚拟主机管理系统 godaddy域名转出 好玩的桌面 太原联通测速平台 申请个人网站 赞助 新家坡 上海服务器 东莞主机托管 qq金券 lamp是什么意思 存储服务器 htaccess asp简介 qq部落24-5 瓦工招聘 kosskeb79 ibm服务器机柜 更多