Spread of a matrix: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>R'n'B
 
en>David Eppstein
Unstub — this looks like start class to me
 
Line 1: Line 1:
{{multiple image
Oscar is how he's known as and he completely enjoys this name. What I adore doing is to gather badges but I've been using on new issues recently. South Dakota is exactly where I've always been residing. My working day occupation is a meter reader.<br><br>Have a look at my webpage: home std test kit ([http://www.hotporn123.com/user/KGottscha pop over to this website])
|footer=Graphical proof for Andrica's conjecture for the first (a)100, (b)200 and (c)500 prime numbers. The function <math>A_n</math> is always less than 1.
 
|align=right
|direction=vertical
|width=300
|image1=Andrica's Conjecture.svg
|caption1=(a) The function <math>A_n</math> for the first 100 primes.
|image2=Andrica's Conjecture2.svg
|caption2=(b) The function <math>A_n</math> for the first 200 primes.
|image3=Andrica's Conjecture3.svg
|caption3=(c) The function <math>A_n</math> for the first 500 primes.
}}
'''Andrica's conjecture''' (named after [[Dorin Andrica]]) is a [[conjecture]] regarding the [[prime gap|gaps]] between [[prime number]]s.<ref>{{cite journal | first=D. | last=Andrica | authorlink= | title=Note on a conjecture in prime number theory | journal=Studia Univ. Babes-Bolyai Math. | volume=31 | year=1986 | number=4 | pages=44–48 | zbl=0623.10030 | issn=0252-1938 }}</ref>
 
The conjecture states that the inequality
:<math>\sqrt{p_{n+1}} - \sqrt{p_n} < 1 </math>
holds for all <math>n</math>, where <math>p_n</math> is the ''n''<sup>th</sup> prime number. If <math>g_n = p_{n+1} - p_n</math> denotes the n<sup>th</sup> [[prime gap]], then Andrica's conjecture can also be rewritten as
:<math>g_n < 2\sqrt{p_n} + 1.</math>
 
== Empirical evidence ==
Imran Ghory has used data on the largest prime gaps to confirm the conjecture for <math>n</math> up to 1.3002 x 10<sup>16</sup>.<ref>''Prime Numbers: The Most Mysterious Figures in Math'', John Wiley & Sons, Inc., 2005, p.13.</ref> Using a table of [[Prime_gaps#Numerical_results|maximal gaps]] and the above gap inequality, the confirmation value can be extended to past 1.4 x 10<sup>18</sup>.
 
The discrete function <math>A_n = \sqrt{p_{n+1}}-\sqrt{p_n}</math> is plotted in the figures opposite. The high-water marks for <math>A_n</math> occur for n = 1, 2, and 4, with ''A''<sub>4</sub> ≈ 0.670873..., with no larger value among the first 10<sup>5</sup> primes. Since the Andrica function decreases asymptotically as ''n'' increases, a prime gap of ever increasing size is needed to make the difference large as ''n'' becomes large. It therefore seems highly likely the conjecture is true, although this has not yet been proven.
 
== Generalizations ==
As a generalization of Andrica's conjecture, the following equation has been considered:
:<math> p _ {n+1} ^ x - p_ n ^ x = 1, </math>
where <math> p_n </math> is the ''n''<sup>th</sup> prime and ''x'' can be any positive number.
 
The largest possible solution ''x'' is easily seen to occur for <math>n=1</math>, when ''x''<sub>max</sub>=1. The smallest solution ''x'' is conjectured to be ''x''<sub>min</sub> ≈ 0.567148... {{OEIS|id=A038458}} which occurs  for ''n'' = 30.
 
This conjecture has also been stated as an [[inequality (mathematics)|inequality]], the generalized Andrica conjecture:
:<math> p _ {n+1} ^ x - p_ n ^ x < 1 </math> for <math>x < x_{\min}.</math>
 
== See also ==
* [[Cramér's conjecture]]
* [[Legendre's conjecture]]
* [[Firoozbakht’s conjecture]]
 
== References and notes ==
{{reflist}}
* {{cite book |last=Guy | first=Richard K. | authorlink=Richard K. Guy | title=Unsolved problems in number theory | publisher=[[Springer-Verlag]] |edition=3rd | year=2004 |isbn=978-0-387-20860-2 | zbl=1058.11001 }}
 
== External links ==
* [http://planetmath.org/encyclopedia/AndricasConjecture.html ''Andrica's Conjecture''] at [[PlanetMath]]
* [http://planetmath.org/?op=getobj&from=objects&id=9636 ''Generalized Andrica conjecture''] at [[PlanetMath]]
* {{MathWorld|urlname=AndricasConjecture|title=Andrica's Conjecture}}
 
[[Category:Conjectures about prime numbers]]

Latest revision as of 09:59, 26 February 2014

Oscar is how he's known as and he completely enjoys this name. What I adore doing is to gather badges but I've been using on new issues recently. South Dakota is exactly where I've always been residing. My working day occupation is a meter reader.

Have a look at my webpage: home std test kit (pop over to this website)