|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| [[Image:Congettura Mertens.png|thumb|right|The graph shows the [[Mertens function]] ''M''(''n'') and the square roots ±√''n'' for ''n''≤10000. After computing these values Mertens conjectured that the modulus of ''M''(''n'') is always bounded by √''n''. This hypothesis, known as Mertens conjecture, was disproved in 1985 by [[Andrew Odlyzko]] and [[Herman te Riele]]]]
| |
|
| |
|
| In [[mathematics]], the '''Mertens conjecture''' is the incorrect statement that the [[Mertens function]] ''M''(''n'') is bounded by √''n'', which implies the [[Riemann hypothesis]]. It was conjectured by Stieltjes in an 1885 letter to [[Charles Hermite|Hermite]] (reprinted in {{harvnb|Stieltjes|1905}}) and {{harvs|txt|authorlink=Franz Mertens|last=Mertens|year=1897}}, and disproved by {{harvtxt|Odlyzko|te Riele|1985}}.
| |
| It is a striking example of a mathematical proof contradicting a large amount of computational evidence in favor of a conjecture.
| |
|
| |
|
| == Definition ==
| | It begins by consuming in a pair of a lovely island where your own personal peaceful village is part way through beaches and woods up until the enemies known just like the BlackGuard led by Lieutenant Hammerman invades your [http://Remoteisland.net remote island]. After managing to guard against a tiny invasion force, he purports to avenge his loss throughout battle.<br><br>Given that explained in the last Clash of Clans' Tribe Wars overview, anniversary hoa war is breach up into a couple phases: Alertness Day and Sports Day. Anniversary appearance lasts 24 hours and means that you are going to accomplish altered things.<br><br>Shun purchasing big title online flash games near their launch dates. Waiting means that you're prone to acquire clash of clans cheats after having a patch or two is carrying emerge to mend evident holes and bugs may be impact your pleasure and so game play. Near keep an eye off for titles from studios which are understood excellent patching and support.<br><br>In the first instance clash of clans identify tool no survey builds believe in among some people. Society may be definitely powered by look pressure, one of the most powerful forces on a the planet. Like long as peer power utilizes its power for good, clash of clans hack ([http://prometeu.net just click the following web page]) tool no analysis will have its put in community.<br><br>Hold out for game of a person's season editions of very important titles. These regularly come out per year or higher after the exact initial headline, but also include a lot of specific down-loadable and extra posts which was released living in steps once the first basic headline. These ball game titles supply a huge amount more bang for currently the buck.<br><br>Should really you perform online multi-player game titles, don't neglect the strength of tone of voice chat! A mic or headphones is a very simple expenditure, and having this particular capability to speak returning to your fellow athletes has a lot of features. You are allowed to create more influential connections with the spot the community and stay a far more successful party person when you were able connect out made some noise.<br><br>Computer games or computer games elevated in popularity nowadays, not necessarily with the younger generation, but also with older adults as well. There are plenty games available, ranging from the intellectual to the regular - your options would be limitless. Online act playing games are one of the most popular games anywhere which is. With this popularity, plenty consumers are exploring and trying to identify ways to go with the whole game as quickly as they can; reasons for using computer How to break into in clash of clans range from simply endeavoring to own your own mates stare at you in awe, or getting a great deal of game money anyone really can sell later, or simply just for you to rid the game within the fun factor for the other players. |
| | |
| In [[number theory]], if we define the [[Mertens function]] as
| |
| | |
| :<math>M(n) = \sum_{1\le k \le n} \mu(k)</math>
| |
| | |
| where μ(k) is the [[Möbius function]], then the '''Mertens conjecture''' is that for all ''n'' > 1, | |
| | |
| :<math>\left| M(n) \right| < \sqrt { n }.\,</math> | |
| | |
| == Disproof of the conjecture ==
| |
| | |
| [[Thomas Jan Stieltjes|Stieltjes]] claimed in 1885 to have proven a weaker result, namely that <math>m(n)=M(n)/\sqrt{n}</math> was [[Bounded function|bounded]], but did not publish a proof.<ref>{{cite book | editor1-last=Borwein | editor1-first=Peter | editor1-link=Peter Borwein | editor2-last=Choi | editor2-first=Stephen | editor3-last=Rooney | editor3-first=Brendan | editor4-last=Weirathmueller | editor4-first=Andrea | title=The Riemann hypothesis. A resource for the afficionado and virtuoso alike | series=CMS Books in Mathematics | location=New York, NY | publisher=[[Springer-Verlag]] | year=2007 | isbn=978-0-387-72125-5 | zbl=1132.11047 | page=69 }}</ref> (In terms of <math>m(n)</math>, the Mertens conjecture is that <math>-1 < m(n) < 1</math>.)
| |
| | |
| In 1985, [[Andrew Odlyzko]] and [[Herman te Riele]] conditionally proved the Mertens conjecture false: indeed, <math>\liminf m(n) < -1.009</math> and <math>\limsup m(n) > 1.06</math>.<ref>Odlyzko & te Riele (1985)</ref><ref name=HBI1889>Sandor et al (2006) pp.188–189</ref> It was later shown that the first [[counterexample]] appears below exp(3.21{{e|64}}) ([[János Pintz|Pintz]] 1987) but above 10<sup>14</sup> (Kotnik and Van de Lune 2004). The upper bound has since been lowered to exp(1.59{{e|40}}) (Kotnik and Te Riele 2006), but no counterexample is explicitly known. The boundedness claim made by Stieltjes, while remarked upon as "very unlikely" in the 1985 paper cited above, has not been disproven ({{as of|2009|lc=on}}). The [[law of the iterated logarithm]] states that if
| |
| μ is replaced by a random sequence of 1s and −1s then the order of growth of the partial sum of the first ''n'' terms is (with probability 1) about (''n'' log log ''n'')<sup>1/2</sup>, which suggests that the order of growth of ''m''(''n'') might be somewhere around (log log ''n'')<sup>1/2</sup>. The actual order of growth may be somewhat smaller; it was conjectured by Gonek in the early 1990s that the order of growth of ''m''(''n'') was <math>(\log{\log{\log{n}}})^{5/4}</math>, which was also conjectured by Ng (2004), based on a heuristic argument assuming the Riemann hypothesis and certain conjectures about the averaged behavior of zeros of the Riemann zeta function.<ref>{{cite web|url=http://www.cs.uleth.ca/~nathanng/RESEARCH/mobius2b.pdf|title=The distribution of the summatory function of the Möbius function}}</ref>
| |
| | |
| In 1979 Cohen and Dress found the largest known value of <math>m(n) \approx 0.570591</math> for M(7766842813) = 50286. In 2003 Kotnik and van de Lune extended the search to ''n'' = 10<sup>14</sup> but did not find larger values. In 2006, Kotnik and te Riele improved the upper bound and showed that there are infinitely many values of ''n'' for which ''m''(''n'')>1.2184, but without giving any specific such value for ''n''.<ref>Kotnik & te Riele (2006)</ref>
| |
| | |
| == Connection to the Riemann hypothesis ==
| |
| | |
| The connection to the Riemann hypothesis is based on the [[Dirichlet series]]
| |
| for the reciprocal of the [[Riemann zeta function]], | |
| | |
| :<math>\frac{1}{\zeta(s)} = \sum_{n=1}^\infty \frac{\mu(n)}{n^s},</math>
| |
| | |
| valid in the region <math>\Re(s) > 1</math>. We can rewrite this as a
| |
| [[Stieltjes integral]]
| |
| | |
| :<math>\frac{1}{\zeta(s)} = \int_0^{\infty} x^{-s}\,dM(x)</math>
| |
| | |
| and after integrating by parts, obtain the reciprocal of the zeta function
| |
| as a [[Mellin transform]]
| |
| | |
| :<math>\frac{1}{s \zeta(s)} = \left\{ \mathcal{M} M \right\}(-s)
| |
| = \int_0^\infty x^{-s} M(x)\, \frac{dx}{x}.</math>
| |
| | |
| Using the [[Mellin inversion theorem]] we now can express ''M'' in terms of
| |
| 1/ζ as
| |
| | |
| :<math>M(x) = \frac{1}{2 \pi i} \int_{\sigma-i\infty}^{\sigma+i\infty} \frac{x^s}{s \zeta(s)}\, ds</math>
| |
| | |
| which is valid for 1 < σ < 2, and valid for 1/2 < σ < 2 on the Riemann hypothesis.
| |
| From this, the Mellin transform integral must be convergent, and hence
| |
| ''M''(''x'') must be ''O''(''x''<sup>e</sup>) for every exponent ''e'' greater than
| |
| 1/2. From this it follows that
| |
| :<math>M(x) = O(x^{\frac12+\epsilon})</math>
| |
| | |
| for all positive ε is equivalent to the Riemann hypothesis, which therefore would have followed from the stronger Mertens hypothesis, and follows from the hypothesis of Stieltjes that
| |
| :<math>M(x) = O(x^\frac12)</math>.
| |
| | |
| ==References==
| |
| <references />
| |
| * {{cite conference |url= http://www.springerlink.com/content/q0717243567v503t/ |title=The Mertens Conjecture Revisited | first1=Tadej | last1=Kotnik | first2=Herman | last2=te Riele | author2-link=Herman te Riele | year= 2006 | series=Lecture Notes in Computer Science | volume=4076 | publisher=[[Springer-Verlag]] | booktitle=Algorithmic number theory. 7th international symposium, ANTS-VII, Berlin, Germany, July 23--28, 2006. Proceedings | editor1-last=Hess | editor1-first=Florian | pages=156–167 | location=Berlin | doi=10.1007/11792086_12 | zbl=1143.11345 | isbn=3-540-36075-1 }}
| |
| * T. Kotnik and J. van de Lune (2004), "[http://www.expmath.org/expmath/volumes/13/13.4/Kotnik.pdf On the order of the Mertens function]", ''Experimental Mathematics'' '''13''', pp. 473–481
| |
| * F. Mertens (1897), "Über eine zahlentheoretische Funktion", ''Sitzungsberichte der Kaiserlichen Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse, Abteilung 2a'', '''106''', pp. 761–830.
| |
| * {{Citation | last1=Odlyzko | first1=A. M. | author1-link=Andrew Odlyzko | last2=te Riele | first2=H. J. J. | author2-link=Herman te Riele | title=Disproof of the Mertens conjecture | url=http://www.dtc.umn.edu/~odlyzko/doc/arch/mertens.disproof.pdf | doi=10.1515/crll.1985.357.138 | id={{MathSciNet | id = 783538}} | year=1985 | journal=[[Journal für die reine und angewandte Mathematik]] | volume=357 | pages=138–160 | zbl=0544.10047 | issn=0075-4102 }}
| |
| * J. Pintz (1987), "An effective disproof of the Mertens conjecture", ''Astérisque'' '''147-148''', pp. 325–333.
| |
| * {{citation | editor1-last=Sándor | editor1-first=József | editor2-last=Mitrinović | editor2-first=Dragoslav S. | editor3-last=Crstici |editor3-first=Borislav | title=Handbook of number theory I | location=Dordrecht | publisher=[[Springer-Verlag]] | year=2006 | isbn=1-4020-4215-9 | zbl=1151.11300 | pages=187–189 }}
| |
| *{{citation|first= T. J.|last= Stieltjes|chapter= Lettre a Hermite de 11 juillet 1885, Lettre #79|pages= 160–164 |editor-first=B.|editor-last= Baillaud
| |
| |editor2-first= H.|editor2-last= Bourget|title=Correspondance d'Hermite et Stieltjes|place= Paris|publisher= Gauthier—Villars|year= 1905}}
| |
| | |
| * {{mathworld|urlname=MertensConjecture|title=Mertens conjecture}}
| |
| | |
| [[Category:Number theory]]
| |
| [[Category:Disproved conjectures]]
| |
It begins by consuming in a pair of a lovely island where your own personal peaceful village is part way through beaches and woods up until the enemies known just like the BlackGuard led by Lieutenant Hammerman invades your remote island. After managing to guard against a tiny invasion force, he purports to avenge his loss throughout battle.
Given that explained in the last Clash of Clans' Tribe Wars overview, anniversary hoa war is breach up into a couple phases: Alertness Day and Sports Day. Anniversary appearance lasts 24 hours and means that you are going to accomplish altered things.
Shun purchasing big title online flash games near their launch dates. Waiting means that you're prone to acquire clash of clans cheats after having a patch or two is carrying emerge to mend evident holes and bugs may be impact your pleasure and so game play. Near keep an eye off for titles from studios which are understood excellent patching and support.
In the first instance clash of clans identify tool no survey builds believe in among some people. Society may be definitely powered by look pressure, one of the most powerful forces on a the planet. Like long as peer power utilizes its power for good, clash of clans hack (just click the following web page) tool no analysis will have its put in community.
Hold out for game of a person's season editions of very important titles. These regularly come out per year or higher after the exact initial headline, but also include a lot of specific down-loadable and extra posts which was released living in steps once the first basic headline. These ball game titles supply a huge amount more bang for currently the buck.
Should really you perform online multi-player game titles, don't neglect the strength of tone of voice chat! A mic or headphones is a very simple expenditure, and having this particular capability to speak returning to your fellow athletes has a lot of features. You are allowed to create more influential connections with the spot the community and stay a far more successful party person when you were able connect out made some noise.
Computer games or computer games elevated in popularity nowadays, not necessarily with the younger generation, but also with older adults as well. There are plenty games available, ranging from the intellectual to the regular - your options would be limitless. Online act playing games are one of the most popular games anywhere which is. With this popularity, plenty consumers are exploring and trying to identify ways to go with the whole game as quickly as they can; reasons for using computer How to break into in clash of clans range from simply endeavoring to own your own mates stare at you in awe, or getting a great deal of game money anyone really can sell later, or simply just for you to rid the game within the fun factor for the other players.