On some sums involving the largest prime divisor of n, II
E. J. Scourfield (2001)
Acta Arithmetica
Similarity:
Displaying similar documents to “Discretization of prime counting functions, convexity and the Riemann hypothesis”
On some sums involving the largest prime divisor of n, II
On a Problem of Erdös and Ivić
Xuan Tizuo (1988)
Publications de l'Institut Mathématique
Similarity:
On the mean value of the remainder term of the prime number formula
J. Pintz (1985)
Banach Center Publications
Similarity:
On an asymptotic formula of Srinivasa Ramanujan
K. Ramachandra, A. Sankaranarayanan (2003)
Acta Arithmetica
Similarity:
The least prime which does not split completely.
V. Kumar Murty (1994)
Forum mathematicum
Similarity:
Biases in the Shanks-Rényi prime number race.
Feuerverger, Andrey, Martin, Greg (2000)
Experimental Mathematics
Similarity:
On the number of subsets relatively prime to an integer.
Ayad, Mohamed, Kihel, Omar (2008)
Journal of Integer Sequences [electronic only]
Similarity:
On the error term of an asymptotic formula of Ramanujan
H. Maier, A. Sankaranarayanan (2005)
Acta Arithmetica
Similarity:
Asymptotic estimates for phi functions for subsets of .
Nathanson, Melvyn B., Orosz, Brooke (2007)
Integers
Similarity:
Pocklington's Theorem and Bertrand's Postulate
Marco Riccardi (2006)
Formalized Mathematics
Similarity:
The first four sections of this article include some auxiliary theorems related to number and finite sequence of numbers, in particular a primality test, the Pocklington's theorem (see [19]). The last section presents the formalization of Bertrand's postulate closely following the book [1], pp. 7-9.
Sieving by prime powers
P. Gallagher (1974)
Acta Arithmetica
Similarity:
On the Properties of the Möbius Function
Magdalena Jastrzebska, Adam Grabowski (2006)
Formalized Mathematics
Similarity:
We formalized some basic properties of the Möbius function which is defined classically as [...] as e.g., its multiplicativity. To enable smooth reasoning about the sum of this number-theoretic function, we introduced an underlying many-sorted set indexed by the set of natural numbers. Its elements are just values of the Möbius function.The second part of the paper is devoted to the notion of the radical of number, i.e. the product of its all prime factors.The formalization (which is...
A note on numbers with a large prime factor III
K. Ramachandra (1971)
Acta Arithmetica
Similarity: