|
Turán–Kubilius Inequality
The Turán–Kubilius inequality is a mathematical theorem in probabilistic number theory. It is useful for proving results about the normal order of an arithmetic function. The theorem was proved in a special case in 1934 by Pál Turán and generalized in 1956 and 1964 by Jonas Kubilius. Statement of the theorem This formulation is from Tenenbaum. Other formulations are in Narkiewicz and in Cojocaru & Murty. Suppose ''f'' is an additive complex-valued arithmetic function In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function whose domain is the set of positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition th ..., and write ''p'' for an arbitrary prime and for an arbitrary positive integer. Write :A(x)=\sum_ f(p^\nu) p^(1-p^) and :B(x)^2 = \sum_ \left, f(p^\nu) \ ^2 p^. Then there is a function ε(''x'') that goes to zero when ''x'' goes to infinity, and such that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Theorem
In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems. In mainstream mathematics, the axioms and the inference rules are commonly left implicit, and, in this case, they are almost always those of Zermelo–Fraenkel set theory with the axiom of choice (ZFC), or of a less powerful theory, such as Peano arithmetic. Generally, an assertion that is explicitly called a theorem is a proved result that is not an immediate consequence of other known theorems. Moreover, many authors qualify as ''theorems'' only the most important results, and use the terms ''lemma'', ''proposition'' and ''corollary'' for less important theorems. In mathematical logic, the concepts of theorems and proofs have been formalized in order to allow mathematical reason ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probabilistic Number Theory
In mathematics, Probabilistic number theory is a subfield of number theory, which explicitly uses probability to answer questions about the integers and integer-valued functions. One basic idea underlying it is that different prime numbers are, in some serious sense, like independent random variables. This however is not an idea that has a unique useful formal expression. The founders of the theory were Paul Erdős, Aurel Wintner and Mark Kac during the 1930s, one of the periods of investigation in analytic number theory. Foundational results include the Erdős–Wintner theorem, the Erdős–Kac theorem on additive functions and the DDT theorem. See also *Number theory *Analytic number theory *Areas of mathematics * List of number theory topics * List of probability topics * Probabilistic method *Probable prime In number theory, a probable prime (PRP) is an integer that satisfies a specific condition that is satisfied by all prime numbers, but which is not satisfied by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Normal Order Of An Arithmetic Function
In number theory, a normal order of an arithmetic function is some simpler or better-understood function which "usually" takes the same or closely approximate values. Let ''f'' be a function on the natural numbers. We say that ''g'' is a normal order of ''f'' if for every ''ε'' > 0, the inequalities : (1-\varepsilon) g(n) \le f(n) \le (1+\varepsilon) g(n) hold for ''almost all In mathematics, the term "almost all" means "all but a negligible quantity". More precisely, if X is a set (mathematics), set, "almost all elements of X" means "all elements of X but those in a negligible set, negligible subset of X". The meaning o ...'' ''n'': that is, if the proportion of ''n'' ≤ ''x'' for which this does not hold tends to 0 as ''x'' tends to infinity. It is conventional to assume that the approximating function ''g'' is continuous and monotone. Examples * The Hardy–Ramanujan theorem: the normal order of ω(''n''), the number of distinct prime factors o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Special Case
In logic, especially as applied in mathematics, concept is a special case or specialization of concept precisely if every instance of is also an instance of but not vice versa, or equivalently, if is a generalization of .Brown, James Robert. Philosophy of Mathematics: An Introduction to a World of Proofs and Pictures'. United Kingdom, Taylor & Francis, 2005. 27. A limiting case is a type of special case which is arrived at by taking some aspect of the concept to the extreme of what is permitted in the general case. If is true, one can immediately deduce that is true as well, and if is false, can also be immediately deduced to be false. A degenerate case is a special case which is in some way qualitatively different from almost all of the cases allowed. Examples Special case examples include the following: * All squares are rectangles (but not all rectangles are squares); therefore the square is a special case of the rectangle. It is also a special case of the rhombus ... [...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. In 1940, because of his Jewish origins, he was arrested by History of the Jews in Hungary#The Holocaust, the Nazis and sent to a Labour service (Hungary), labour camp in Transylvania, later being transferred several times to other camps. While imprisoned, Turán came up with some of his best theories, which he was able to publish after the war. Turán had a long collaboration with fellow Hungarian mathematician Paul Erdős, lasting 46 years and resulting in 28 joint papers. Biography Early years Turán was born into a Jews of Hungary, Hungarian Jewish family in Budapest on 18 August 1910. Pál's outstanding mathematical abilities showed early, already in secondary school he was the best student. At the same period of time, Turán and Pál Erdős were famous answerers in the journal ''KöMaL''. On 1 September 1930, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jonas Kubilius
Jonas Kubilius (27 July 1921 – 30 October 2011) was a Lithuanian mathematician who worked in probability theory and number theory. He was rector of Vilnius University for 32 years, and served one term in the Lithuanian parliament. Life and education Kubilius was born in Fermos village, Eržvilkas county, Jurbarkas District Municipality, Lithuania on 27 July 1921. He graduated from Raseiniai high school in 1940 and entered Vilnius University, from which he graduated '' summa cum laude'' in 1946 after taking off a year to teach mathematics in middle school. Kubilius received the Candidate of Sciences degree in 1951 from Leningrad University. His thesis, written under Yuri Linnik, was titled ''Geometry of Prime Numbers''. He received the Doctor of Sciences degree ( habilitation) in 1957 from the Steklov Institute of Mathematics in Moscow. Career Kubilius had simultaneous careers at Vilnius University and at the Lithuanian Academy of Sciences. He continued working at the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gérald Tenenbaum
Gérald Tenenbaum is a French mathematician and novelist, born in Nancy on 1 April 1952.Zéro faute à l’IUT Nancy-Brabois press release, University of Lorraine, January 30, 2012. Accessed on line June 26, 2012. He is one of the namesakes of the Erdős–Tenenbaum–Ford constant. Biography An alumnus of the , he has been professor of mathematics at the Institut Élie Cartan< ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Additive Function
In number theory, an additive function is an arithmetic function ''f''(''n'') of the positive integer variable ''n'' such that whenever ''a'' and ''b'' are coprime, the function applied to the product ''ab'' is the sum of the values of the function applied to ''a'' and ''b'':Erdös, P., and M. Kac. On the Gaussian Law of Errors in the Theory of Additive Functions. Proc Natl Acad Sci USA. 1939 April; 25(4): 206–207online/ref> f(a b) = f(a) + f(b). Completely additive An additive function ''f''(''n'') is said to be completely additive if f(a b) = f(a) + f(b) holds ''for all'' positive integers ''a'' and ''b'', even when they are not coprime. Totally additive is also used in this sense by analogy with totally multiplicative functions. If ''f'' is a completely additive function then ''f''(1) = 0. Every completely additive function is additive, but not vice versa. Examples Examples of arithmetic functions which are completely additive are: * The restriction of the Logarithm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetic Function
In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function whose domain is the set of 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''". There is a larger class of number-theoretic functions that do not fit this definition, for example, the prime-counting functions. This article provides links to functions of both classes. 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''. 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'' and ''n''; * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hardy–Ramanujan Theorem
In mathematics, the Hardy–Ramanujan theorem, proved by Ramanujan and checked by Hardy states that the normal order of the number \omega(n) of distinct prime factors of a number n is \log\log n. Roughly speaking, this means that most numbers have about this number of distinct prime factors. Precise statement A more precise version states that for every real-valued function \psi(n) that tends to infinity as n tends to infinity , \omega(n)-\log\log n, <\psi(n)\sqrt or more traditionally for '''' (all but an proportion of) integers. That is, let be the number of positive integers less than for which the abo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Roger Heath-Brown
David Rodney "Roger" Heath-Brown is a British mathematician working in the field of analytic number theory. Education He was an undergraduate and graduate student of Trinity College, Cambridge; his research supervisor was Alan Baker. Career and research In 1979 he moved to the University of Oxford, where from 1999 he held a professorship in pure mathematics. He retired in 2016. Heath-Brown is known for many striking results. He proved that there are infinitely many prime numbers of the form ''x''3 + 2''y''3. In collaboration with S. J. Patterson in 1978 he proved the Kummer conjecture on cubic Gauss sums in its equidistribution form. He has applied Burgess's method on character sums to the ranks of elliptic curves in families. He proved that every non-singular cubic form over the rational numbers in at least ten variables represents 0. Heath-Brown also showed that Linnik's constant is less than or equal to 5.5. More recently, Heath-Brown is known for his pi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joseph H
Joseph is a common male name, derived from the Hebrew (). "Joseph" is used, along with "Josef (given name), Josef", mostly in English, French and partially German languages. This spelling is also found as a variant in the languages of the modern-day Nordic countries. In Portuguese language, Portuguese and Spanish language, Spanish, the name is "José". In Arabic, including in the Quran, the name is spelled , . In Kurdish language, Kurdish (''Kurdî''), the name is , Persian language, Persian, the name is , and in Turkish language, Turkish it is . In Pashto the name is spelled ''Esaf'' (ايسپ) and in Malayalam it is spelled ''Ousep'' (ഔസേപ്പ്). In Tamil language, Tamil, it is spelled as ''Yosepu'' (யோசேப்பு). The name has enjoyed significant popularity in its many forms in numerous countries, and ''Joseph'' was one of the two names, along with ''Robert'', to have remained in the top 10 boys' names list in the US from 1925 to 1972. It is especiall ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
