|
Prime Gaps
A prime gap is the difference between two successive prime numbers. The ''n''-th prime gap, denoted ''g''''n'' or ''g''(''p''''n'') is the difference between the (''n'' + 1)-st and the ''n''-th prime numbers, i.e., :g_n = p_ - p_n. We have ''g''1 = 1, ''g''2 = ''g''3 = 2, and ''g''4 = 4. The sequence (''g''''n'') of prime gaps has been extensively studied; however, many questions and conjectures remain unanswered. The first 60 prime gaps are: :1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, 14, 4, 6, 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2, 4, 2, 12, 12, 4, 2, 4, 6, 2, 10, 6, 6, 6, 2, 6, 4, 2, ... . By the definition of ''g''''n'' every prime can be written as :p_ = 2 + \sum_^n g_i. Simple observations The first, smallest, and only odd prime gap is the gap of size 1 between 2, the only even prime number, and 3, the first odd prime. All other prime gaps are even. There is only one pair of consecutive gaps having length 2: the gap ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Integer Sequences
The ''Journal of Integer Sequences'' is a peer-reviewed open-access academic journal in mathematics, specializing in research papers about integer sequences. It was founded in 1998 by Neil Sloane. Sloane had previously published two books on integer sequences, and in 1996 he founded the On-Line Encyclopedia of Integer Sequences (OEIS). Needing an outlet for research papers concerning the sequences he was collecting in the OEIS, he founded the journal. Since 2002 the journal has been hosted by the David R. Cheriton School of Computer Science at the University of Waterloo, with Waterloo professor Jeffrey Shallit as its editor-in-chief. There are no page charges for authors, and all papers are free to all readers. The journal publishes approximately 50–75 papers annually.. In most years from 1999 to 2014, SCImago Journal Rank has ranked the ''Journal of Integer Sequences'' as a third-quartile journal in discrete mathematics and combinatorics. It is indexed by ''Mathematical Review ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Legendre's Conjecture
Legendre's conjecture, proposed by Adrien-Marie Legendre, states that there is a prime number between n^2 and (n+1)^2 for every positive integer n. The conjecture is one of Landau's problems (1912) on prime numbers, and is one of many open problems on the spacing of prime numbers. Prime gaps If Legendre's conjecture is true, the gap between any prime ''p'' and the next largest prime would be O(\sqrt\,), as expressed in big O notation. It is one of a family of results and conjectures related to prime gaps, that is, to the spacing between prime numbers. Others include Bertrand's postulate, on the existence of a prime between n and 2n, Oppermann's conjecture on the existence of primes between n^2, n(n+1), and (n+1)^2, Andrica's conjecture and Brocard's conjecture on the existence of primes between squares of consecutive primes, and Cramér's conjecture that the gaps are always much smaller, of the order (\log p)^2. If Cramér's conjecture is true, Legendre's conjecture would ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lindelöf Hypothesis
In mathematics, the Lindelöf hypothesis is a conjecture by Finnish mathematician Ernst Leonard Lindelöf about the rate of growth of the Riemann zeta function on the critical line. This hypothesis is implied by the Riemann hypothesis. It says that for any ''ε'' > 0, \zeta\!\left(\frac + it\right)\! = O(t^\varepsilon) as ''t'' tends to infinity (see big O notation). Since ''ε'' can be replaced by a smaller value, the conjecture can be restated as follows: for any positive ''ε'', \zeta\!\left(\frac + it\right)\! = o(t^\varepsilon). The μ function If σ is real, then ''μ''(σ) is defined to be the infimum of all real numbers ''a'' such that ζ(σ + ''iT'' ) = O(''T'' ''a''). It is trivial to check that ''μ''(σ) = 0 for σ > 1, and the functional equation of the zeta function implies that ''μ''(σ) = ''μ''(1 − σ) − σ + 1/2. The Phragmén–Lindelöf theorem implies that ''μ'' is a convex funct ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime-counting Function
In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number . It is denoted by (unrelated to the number ). A symmetric variant seen sometimes is , which is equal to if is exactly a prime number, and equal to otherwise. That is, the number of prime numbers less than , plus half if equals a prime. Growth rate Of great interest in number theory is the growth rate of the prime-counting function. It was conjectured in the end of the 18th century by Gauss and by Legendre to be approximately \frac where is the natural logarithm, in the sense that \lim_ \frac=1. This statement is the prime number theorem. An equivalent statement is \lim_\frac=1 where is the logarithmic integral function. The prime number theorem was first proved in 1896 by Jacques Hadamard and by Charles de la Vallée Poussin independently, using properties of the Riemann zeta function introduced by Riemann in 1859. Proof ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riemann Zeta Function
The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter (zeta), is a mathematical function of a complex variable defined as \zeta(s) = \sum_^\infty \frac = \frac + \frac + \frac + \cdots for and its analytic continuation elsewhere. The Riemann zeta function plays a pivotal role in analytic number theory and has applications in physics, probability theory, and applied statistics. Leonhard Euler first introduced and studied the function over the reals in the first half of the eighteenth century. Bernhard Riemann's 1859 article "On the Number of Primes Less Than a Given Magnitude" extended the Euler definition to a complex variable, proved its meromorphic continuation and functional equation, and established a relation between its zeros and the distribution of prime numbers. This paper also contained the Riemann hypothesis, a conjecture about the distribution of complex zeros of the Riemann zeta function that many mathematicians consider th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Big O Notation
Big ''O'' notation is a mathematical notation that describes the asymptotic analysis, limiting behavior of a function (mathematics), function when the Argument of a function, argument tends towards a particular value or infinity. Big O is a member of a #Related asymptotic notations, family of notations invented by German mathematicians Paul Gustav Heinrich Bachmann, Paul Bachmann, Edmund Landau, and others, collectively called Bachmann–Landau notation or asymptotic notation. The letter O was chosen by Bachmann to stand for '':wikt:Ordnung#German, Ordnung'', meaning the order of approximation. In computer science, big O notation is used to Computational complexity theory, classify algorithms according to how their run time or space requirements grow as the input size grows. In analytic number theory, big O notation is often used to express a bound on the difference between an arithmetic function, arithmetical function and a better understood approximation; one well-known exam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Albert Ingham
Albert Edward Ingham (3 April 1900 – 6 September 1967) was an English mathematician. Early life and education Ingham was born in Northampton. He went to Stafford Grammar School and began his studies at Trinity College, Cambridge in January 1919 after service in the British Army in World War I. Ingham received a distinction as a Wrangler in the Mathematical Tripos at Cambridge. He was elected a fellow of Trinity in 1922. He also received an 1851 Research Fellowship. Academic career Ingham was appointed a Reader at the University of Leeds in 1926 and returned to Cambridge as a fellow of King's College and lecturer in 1930. Ingham was appointed after the death of Frank Ramsey. Ingham supervised the PhDs of C. Brian Haselgrove, Wolfgang Fuchs and Christopher Hooley. Ingham proved in 1937 that if :\zeta\left(1/2+it\right)=O\left(t^c\right) for some positive constant ''c'', then :\pi\left(x+x^\theta\right)-\pi(x)\sim\frac, for any θ > (1+4c)/(2+4c). Here ζ denotes the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nikolai Chudakov
Nikolai Grigor'evich Chudakov (; 1904–1986) was a Russian and Soviet mathematician. He was born in Lysovsk, Novo-Burassk, Saratov, Russian Empire. His father worked as a medical assistant. Biography He first studied at the Faculty of Physics and Mathematics at Saratov State University, but then he transferred to Moscow University. He then graduated in 1927. In 1930, he was named head of higher mathematics at Saratov University. In 1936, he successfully defended his thesis and became a Doctor of Science. Among others, he considerably improved a result from Guido Hoheisel and Hans Heilbronn on an upper bound for prime gaps. He worked in Moscow Moscow is the Capital city, capital and List of cities and towns in Russia by population, largest city of Russia, standing on the Moskva (river), Moskva River in Central Russia. It has a population estimated at over 13 million residents with ... until 1940, but then he reconnected with Saratov. References {{DEFAULTSORT:Chuda ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hans Heilbronn
Hans Arnold Heilbronn (8 October 1908 – 28 April 1975) was a mathematician. Education He was born into a German-Jewish family. He was a student at the universities of Berlin, Freiburg and Göttingen, where he met Edmund Landau, who supervised his doctorate. In his thesis, he improved a result of Hoheisel on the size of prime gaps. Life Heilbronn fled Germany for Britain in 1933 due to the rise of Nazism. He arrived in Cambridge, then found accommodation in Manchester and eventually was offered a position at Bristol University, where he stayed for about one and a half years. There he proved that the class number of the number field \mathbb(\sqrt) tends to plus infinity as d does, as well as, in collaboration with Edward Linfoot, that there are at most ten quadratic number fields of the form \mathbb(\sqrt), d a natural number, with class number 1. On invitation of Louis Mordell he moved back to Manchester in 1934, but left again only one year later, accepting the Bevan Fe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sufficiently Large
In the mathematical areas of number theory and analysis, an infinite sequence or a function is said to eventually have a certain property, if it does not have the said property across all its ordered instances, but will after some instances have passed. The use of the term "eventually" can be often rephrased as "for sufficiently large numbers", and can be also extended to the class of properties that apply to elements of any ordered set (such as sequences and subsets of \mathbb). Notation The general form where the phrase eventually (or sufficiently large) is found appears as follows: :P is ''eventually'' true for x (P is true for ''sufficiently large'' x), where \forall and \exists are the universal and existential quantifiers, which is actually a shorthand for: :\exists a \in \mathbb such that P is true \forall x \ge a or somewhat more formally: :\exists a \in \mathbb: \forall x \in \mathbb:x \ge a \Rightarrow P(x) This does not necessarily mean that any particular ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Guido Hoheisel
Guido Karl Heinrich Hoheisel (14 July 1894 – 11 October 1968) was a Germans, German mathematician and professor of mathematics at the University of Cologne. Academic life He did his PhD in 1920 from the University of Berlin under the supervision of Erhard Schmidt. During World War II Hoheisel was required to teach classes simultaneously at three universities, in Cologne, Bonn, and Münster. His doctoral students include Arnold Schönhage. Hoheisel contributed to the journal Deutsche Mathematik. Selected results Hoheisel is known for a result on gaps between prime numbers: He proved that if π(x) denotes the prime-counting function, then there exists a constant θ < 1 such that :π(''x'' + ''x''θ) − π(''x'') ~ ''x''θ/log(''x''), as ''x'' tends to infinity, implying that if ''p''''n'' denotes the ''n''-th prime number then :''p''''n''+1 − ''p''''n'' < ''p''''n''''θ'', for all sufficient ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
