|
Franz Mertens
Franz Mertens (20 March 1840 – 5 March 1927) (also known as Franciszek Mertens) was a Polish mathematician. He was born in Schroda in the Grand Duchy of Posen, Kingdom of Prussia (now Środa Wielkopolska, Poland) and died in Vienna, Austria. The Mertens function ''M''(''x'') is the sum function for the Möbius function, in the theory of arithmetic functions. The Mertens conjecture concerning its growth, conjecturing it bounded by ''x''1/2, which would have implied the Riemann hypothesis, is now known to be false ( Odlyzko and te Riele, 1985). The Meissel–Mertens constant is analogous to the Euler–Mascheroni constant, but the harmonic series sum in its definition is only over the primes rather than over all integers and the logarithm is taken twice, not just once. Mertens's theorems are three 1874 results related to the density of prime numbers. Erwin Schrödinger was taught calculus and algebra by Mertens. His memory is honoured by the Franciszek Mertens Scho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Åšroda Wielkopolska
Środa Wielkopolska (until 1968 ''Środa''; german: Schroda) is a town in western-central Poland, situated in the Greater Poland Voivodeship, about southeast of Poznań, with 22,001 inhabitants (2009). It is the seat of Środa Wielkopolska County, and of Gmina Środa Wielkopolska (a district within the county). History A stronghold existed at the site in the Middle Ages. The oldest known mention of Środa dates back to 1228. Środa was probably granted town rights in 1261. It was a royal town of the Polish Crown, administratively located in the Kalisz Voivodeship in the Greater Poland Province of the Polish Crown. In 1402–1413 Polish King Władysław II Jagiełło built a Gothic castle in Środa. In the 15th century Środa was one of the largest towns in Greater Poland, trade and crafts developed, and from 1454 the sejmiks (regional parliaments) of both the Kalisz and Poznań voivodeships were held in the town. In the Second Partition of Poland in 1793 the town was annexed b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mertens's Theorems
In number theory, Mertens' theorems are three 1874 results related to the density of prime numbers proved by Franz Mertens.F. Mertens. J. reine angew. Math. 78 (1874), 46–6Ein Beitrag zur analytischen Zahlentheorie/ref> "Mertens' theorem" may also refer to his theorem in analysis. Theorems In the following, let p\le n mean all primes not exceeding ''n''. Mertens' first theorem: : \sum_ \frac - \log n does not exceed 2 in absolute value for any n\ge 2. () Mertens' second theorem: :\lim_\left(\sum_\frac1p -\log\log n-M\right) =0, where ''M'' is the Meissel–Mertens constant (). More precisely, Mertens proves that the expression under the limit does not in absolute value exceed : \frac 4 +\frac 2 for any n\ge 2. Mertens' third theorem: :\lim_\log n\prod_\left(1-\frac1p\right)=e^ \approx 0.561459483566885, where γ is the Euler–Mascheroni constant (). Changes in sign In a paper on the growth rate of the sum-of-divisors function published in 1983, Guy Robin pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kraków
Kraków (), or Cracow, is the second-largest and one of the oldest cities in Poland. Situated on the Vistula River in Lesser Poland Voivodeship, the city dates back to the seventh century. Kraków was the official capital of Poland until 1596 and has traditionally been one of the leading centres of Polish academic, economic, cultural and artistic life. Cited as one of Europe's most beautiful cities, its Old Town with Wawel Royal Castle was declared a UNESCO World Heritage Site in 1978, one of the first 12 sites granted the status. The city has grown from a Stone Age settlement to Poland's second-most-important city. It began as a hamlet on Wawel Hill and was reported by Ibrahim Ibn Yakoub, a merchant from Cordoba, as a busy trading centre of Central Europe in 985. With the establishment of new universities and cultural venues at the emergence of the Second Polish Republic in 1918 and throughout the 20th century, Kraków reaffirmed its role as a major national academic an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erwin Schrödinger
Erwin Rudolf Josef Alexander Schrödinger (, ; ; 12 August 1887 – 4 January 1961), sometimes written as or , was a Nobel Prize-winning Austrian physicist with Irish citizenship who developed a number of fundamental results in quantum theory: the Schrödinger equation provides a way to calculate the wave function of a system and how it changes dynamically in time. In addition, he wrote many works on various aspects of physics: statistical mechanics and thermodynamics, physics of dielectrics, colour theory, electrodynamics, general relativity, and cosmology, and he made several attempts to construct a unified field theory. In his book '' What Is Life?'' Schrödinger addressed the problems of genetics, looking at the phenomenon of life from the point of view of physics. He also paid great attention to the philosophical aspects of science, ancient, and oriental philosophical concepts, ethics, and religion. He also wrote on philosophy and theoretical biology. In popular cult ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which alw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harmonic Series (mathematics)
In mathematics, the harmonic series is the infinite series formed by summing all positive unit fractions: \sum_^\infty\frac = 1 + \frac + \frac + \frac + \frac + \cdots. The first n terms of the series sum to approximately \ln n + \gamma, where \ln is the natural logarithm and \gamma\approx0.577 is the Euler–Mascheroni constant. Because the logarithm has arbitrarily large values, the harmonic series does not have a finite limit: it is a divergent series. Its divergence was proven in the 14th century by Nicole Oresme using a precursor to the Cauchy condensation test for the convergence of infinite series. It can also be proven to diverge by comparing the sum to an integral, according to the integral test for convergence. Applications of the harmonic series and its partial sums include Divergence of the sum of the reciprocals of the primes, Euler's proof that there are infinitely many prime numbers, the analysis of the coupon collector's problem on how many random trials are nee ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euler–Mascheroni Constant
Euler's constant (sometimes also called the Euler–Mascheroni constant) is a mathematical constant usually denoted by the lowercase Greek letter gamma (). It is defined as the limiting difference between the harmonic series and the natural logarithm, denoted here by \log: :\begin \gamma &= \lim_\left(-\log n + \sum_^n \frac1\right)\\ px&=\int_1^\infty\left(-\frac1x+\frac1\right)\,dx. \end Here, \lfloor x\rfloor represents the floor function. The numerical value of Euler's constant, to 50 decimal places, is: :   History The constant first appeared in a 1734 paper by the Swiss mathematician Leonhard Euler, titled ''De Progressionibus harmonicis observationes'' (Eneström Index 43). Euler used the notations and for the constant. In 1790, Italian mathematician Lorenzo Mascheroni used the notations and for the constant. The notation appears nowhere in the writings of either Euler or Mascheroni, and was chosen at a later time perhaps because of the constant's connect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Herman Te Riele
Hermanus Johannes Joseph te Riele (born 5 January 1947) is a Dutch mathematician at CWI in Amsterdam with a specialization in computational number theory. He is known for proving the correctness of the Riemann hypothesis for the first 1.5 billion non-trivial zeros of the Riemann zeta function with Jan van de Lune and Dik Winter, for disproving the Mertens conjecture with Andrew Odlyzko, and for factoring large numbers of world record size. In 1987, he found a new upper bound for Ï€(''x'') − Li(''x''). In 1970, Te Riele received an engineer's degree in mathematical engineering from Delft University of Technology and, in 1976, a PhD degree in mathematics and physics from University of Amsterdam The University of Amsterdam (abbreviated as UvA, nl, Universiteit van Amsterdam) is a public research university located in Amsterdam, Netherlands. The UvA is one of two large, publicly funded research universities in the city, the other bein ... (1976). References * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrew Odlyzko
Andrew Michael Odlyzko (Andrzej Odłyżko) (born 23 July 1949) is a Polish- American mathematician and a former head of the University of Minnesota's Digital Technology Center and of the Minnesota Supercomputing Institute. He began his career in 1975 at Bell Telephone Laboratories, where he stayed for 26 years before joining the University of Minnesota in 2001. Work in mathematics Odlyzko received his B.S. and M.S. in mathematics from the California Institute of Technology and his Ph.D. from the Massachusetts Institute of Technology in 1975. In the field of mathematics he has published extensively on analytic number theory, computational number theory, cryptography, algorithms and computational complexity, combinatorics, probability, and error-correcting codes. In the early 1970s, he was a co-author (with D. Kahaner and Gian-Carlo Rota) of one of the founding papers of the modern umbral calculus. In 1985 he and Herman te Riele disproved the Mertens conjecture. In mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riemann Hypothesis
In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part . Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by , after whom it is named. The Riemann hypothesis and some of its generalizations, along with Goldbach's conjecture and the twin prime conjecture, make up Hilbert's eighth problem in David Hilbert's list of twenty-three unsolved problems; it is also one of the Clay Mathematics Institute's Millennium Prize Problems, which offers a million dollars to anyone who solves any of them. The name is also used for some closely related analogues, such as the Riemann hypothesis for curves over finite fields. The Riemann zeta function ζ(''s'') is a function whose argument ''s'' may be any complex number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetic Function
In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function ''f''(''n'') whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of ''n''". An example of an arithmetic function is the divisor function whose value at a positive integer ''n'' is equal to the number of divisors of ''n''. There is a larger class of number-theoretic functions that do not fit the above definition, for example, the prime-counting functions. This article provides links to functions of both classes. Arithmetic functions are often extremely irregular (see table), but some of them have series expansions in terms of Ramanujan's sum. Multiplicative and additive functions An arithmetic function ''a'' is * completely additive if ''a''(''mn'') = ''a''(''m'') + ''a''(''n'') for all natural numbers ''m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Möbius Function
The Möbius function is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted . Definition For any positive integer , define as the sum of the primitive th roots of unity. It has values in depending on the factorization of into prime factors: * if is a square-free positive integer with an even number of prime factors. * if is a square-free positive integer with an odd number of prime factors. * if has a squared prime factor. The Möbius function can alternatively be represented as : \mu(n) = \delta_ \lambda(n), where is the Kronecker delta, is the Liouville function, is the numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
