|
Liouville Function
The Liouville Lambda function, denoted by λ(''n'') and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if ''n'' is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes. Explicitly, the fundamental theorem of arithmetic states that any positive integer ''n'' can be represented uniquely as a product of powers of primes: n = p_1^\cdots p_k^ where ''p''1 0 is some absolute limiting constant. Define the related sum : T(n) = \sum_^n \frac. It was open for some time whether ''T''(''n'') ≥ 0 for sufficiently big ''n'' ≥ ''n''0 (this conjecture is occasionally–though incorrectly–attributed to Pál Turán). This was then disproved by , who showed that ''T''(''n'') takes negative values infinitely often. A confirmation of this positivity conjecture would have led to a proof of the Riemann hypothesis, as was shown by Pál Turán. Generalizations More generally, we ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joseph Liouville
Joseph Liouville (; ; 24 March 1809 – 8 September 1882) was a French mathematician and engineer. Life and work He was born in Saint-Omer in France on 24 March 1809. His parents were Claude-Joseph Liouville (an army officer) and Thérèse Liouville (née Balland). Liouville gained admission into the École Polytechnique in 1825 and graduated in 1827. Just like Augustin-Louis Cauchy before him, Liouville studied engineering at École des Ponts et Chaussées after graduating from the Polytechnique, but opted instead for a career in mathematics. After some years as an assistant at various institutions including the École Centrale Paris, he was appointed as professor at the École Polytechnique in 1838. He obtained a chair in mathematics at the Collège de France in 1850 and a chair in mechanics at the Faculté des Sciences in 1857. Besides his academic achievements, he was very talented in organisational matters. Liouville founded the ''Journal de Mathématiques Pures et Ap ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lambert Series
In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form :S(q)=\sum_^\infty a_n \frac . It can be resumed formally by expanding the denominator: :S(q)=\sum_^\infty a_n \sum_^\infty q^ = \sum_^\infty b_m q^m where the coefficients of the new series are given by the Dirichlet convolution of ''a''''n'' with the constant function 1(''n'') = 1: :b_m = (a*1)(m) = \sum_ a_n. \, This series may be inverted by means of the Möbius inversion formula, and is an example of a Möbius transform. Examples Since this last sum is a typical number-theoretic sum, almost any natural multiplicative function will be exactly summable when used in a Lambert series. Thus, for example, one has :\sum_^\infty q^n \sigma_0(n) = \sum_^\infty \frac where \sigma_0(n)=d(n) is the number of positive divisors of the number ''n''. For the higher order sum-of-divisor functions, one has :\sum_^\infty q^n \sigma_\alpha(n) = \sum_^\infty \frac where \ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mellin Transform
In mathematics, the Mellin transform is an integral transform that may be regarded as the multiplicative version of the two-sided Laplace transform. This integral transform is closely connected to the theory of Dirichlet series, and is often used in number theory, mathematical statistics, and the theory of asymptotic expansions; it is closely related to the Laplace transform and the Fourier transform, and the theory of the gamma function and allied special functions. The Mellin transform of a function is :\left\(s) = \varphi(s)=\int_0^\infty x^ f(x) \, dx. The inverse transform is :\left\(x) = f(x)=\frac \int_^ x^ \varphi(s)\, ds. The notation implies this is a line integral taken over a vertical line in the complex plane, whose real part ''c'' need only satisfy a mild lower bound. Conditions under which this inversion is valid are given in the Mellin inversion theorem. The transform is named after the Finnish mathematician Hjalmar Mellin, who introduced it in a paper publishe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perron's Formula
In mathematics, and more particularly in analytic number theory, Perron's formula is a formula due to Oskar Perron to calculate the sum of an arithmetic function, by means of an inverse Mellin transform. Statement Let \ be an arithmetic function, and let : g(s)=\sum_^ \frac be the corresponding Dirichlet series. Presume the Dirichlet series to be uniform convergence, uniformly convergent for \Re(s)>\sigma. Then Perron's formula is : A(x) = ' a(n) =\frac\int_^ g(z)\frac \,dz. Here, the prime on the summation indicates that the last term of the sum must be multiplied by 1/2 when ''x'' is an integer. The integral is not a convergent Lebesgue integral; it is understood as the Cauchy principal value. The formula requires that ''c'' > 0, ''c'' > σ, and ''x'' > 0. Proof An easy sketch of the proof comes from taking Abel's summation formula, Abel's sum formula : g(s)=\sum_^ \frac=s\int_^ A(x)x^ dx. This is nothing but a Laplace transform under the variable change x = e^t. Invertin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moebius Function
Moebius, Möbius or Mobius may refer to: People * August Ferdinand Möbius (1790–1868), German mathematician and astronomer * Theodor Möbius (1821–1890), German philologist * Karl Möbius (1825–1908), German zoologist and ecologist * Paul Julius Möbius (1853–1907), German neurologist * Dieter Moebius (1944–2015), German/Swiss musician * Mark Mobius (born 1936), emerging markets investments pioneer * Jean Giraud (1938–2012), French comics artist who used the pseudonym Mœbius Fictional characters * Mobius M. Mobius, a character in Marvel Comics * Mobius, also known as the Anti-Monitor, a supervillain in DC Comics Mathematics * Möbius energy, a particular knot energy * Möbius strip, an object with one surface and one edge * Möbius function, an important multiplicative function in number theory and combinatorics ** Möbius transform, transform involving the Möbius function ** Möbius inversion formula, in number theory * Möbius transformation, a particular ration ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mertens Function
In number theory, the Mertens function is defined for all positive integers ''n'' as : M(n) = \sum_^n \mu(k), where \mu(k) is the Möbius function. The function is named in honour of Franz Mertens. This definition can be extended to positive real numbers as follows: : M(x) = M(\lfloor x \rfloor). Less formally, M(x) is the count of square-free integers up to ''x'' that have an even number of prime factors, minus the count of those that have an odd number. The first 143 ''M''(''n'') values are The Mertens function slowly grows in positive and negative directions both on average and in peak value, oscillating in an apparently chaotic manner passing through zero when ''n'' has the values :2, 39, 40, 58, 65, 93, 101, 145, 149, 150, 159, 160, 163, 164, 166, 214, 231, 232, 235, 236, 238, 254, 329, 331, 332, 333, 353, 355, 356, 358, 362, 363, 364, 366, 393, 401, 403, 404, 405, 407, 408, 413, 414, 419, 420, 422, 423, 424, 425, 427, 428, ... . Because the Möbius function only ta ... [...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] |
Pál Turán
Pál Turán (; 18 August 1910 – 26 September 1976) also known as Paul Turán, was a Hungarian mathematician who worked primarily in extremal combinatorics. He had a long collaboration with fellow Hungarian mathematician Paul Erdős, lasting 46 years and resulting in 28 joint papers. Life and education Turán was born into a Jewish family in Budapest on 18 August 1910.At the same period of time, Turán and Erdős were famous answerers in the journal '' KöMaL''. He received a teaching degree at the University of Budapest in 1933 and the PhD degree under Lipót Fejér in 1935 at Eötvös Loránd University. As a Jew, he fell victim to numerus clausus, and could not get a university job for several years. He was sent to labour service at various times from 1940-44. He is said to have been recognized and perhaps protected by a fascist guard, who, as a mathematics student, had admired Turán's work. Turán became associate professor at the University of Budapest in 1945 and ful ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
George Pólya
George Pólya (; hu, Pólya György, ; December 13, 1887 – September 7, 1985) was a Hungarian mathematician. He was a professor of mathematics from 1914 to 1940 at ETH Zürich and from 1940 to 1953 at Stanford University. He made fundamental contributions to combinatorics, number theory, numerical analysis and probability theory. He is also noted for his work in heuristics and mathematics education. He has been described as one of The Martians, an informal category which included one of his most famous students at ETH Zurich, John Von Neumann. Life and works Pólya was born in Budapest, Austria-Hungary, to Anna Deutsch and Jakab Pólya, Hungarian Jews who had converted to Christianity in 1886. Although his parents were religious and he was baptized into the Catholic Church upon birth, George eventually grew up to be an agnostic. He was a professor of mathematics from 1914 to 1940 at ETH Zürich in Switzerland and from 1940 to 1953 at Stanford University. He remained a Pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pólya Conjecture
In number theory, the Pólya conjecture (or Pólya's conjecture) stated that "most" (i.e., 50% or more) of the natural numbers less than any given number have an ''odd'' number of prime factors. The conjecture was set forth by the Hungarian mathematician George Pólya in 1919, and proved false in 1958 by C. Brian Haselgrove. Though mathematicians typically refer to this statement as the Pólya conjecture, Pólya never actually conjectured that the statement was true; rather, he showed that the truth of the statement would imply the Riemann hypothesis. For this reason, it is more accurately called "Pólya's problem". The size of the smallest counterexample is often used to demonstrate the fact that a conjecture can be true for many cases and still fail to hold in general, providing an illustration of the strong law of small numbers. Statement The Pólya conjecture states that for any ''n'' > 1, if the natural numbers less than or equal to ''n'' (excluding 0) are parti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
