Sieving by prime powers
P. Gallagher (1974)
Acta Arithmetica
Similarity:
P. Gallagher (1974)
Acta Arithmetica
Similarity:
Richard H. Hudson (1983)
Manuscripta mathematica
Similarity:
K. Ramachandra (1971)
Acta Arithmetica
Similarity:
Artūras Dubickas, Andrius Stankevičius (2007)
Acta Arithmetica
Similarity:
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.
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...
Jiahai Kan (2004)
Acta Arithmetica
Similarity:
Paul Erdös, Aleksandar Ivić (1982)
Publications de l'Institut Mathématique
Similarity:
K. Szymiczek (1964)
Colloquium Mathematicae
Similarity:
P. A. B. Pleasants (1985)
Banach Center Publications
Similarity:
Florian Luca, Francesco Pappalardi (2007)
Acta Arithmetica
Similarity:
Jianya Liu, Kai-Man Tsang (2005)
Acta Arithmetica
Similarity:
Nyman, Bertil, Nicely, Thomas R. (2003)
Journal of Integer Sequences [electronic only]
Similarity: