A note on numbers with a large prime factor III
K. Ramachandra (1971)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
K. Ramachandra (1971)
Acta Arithmetica
Similarity:
Jiahai Kan (2004)
Acta Arithmetica
Similarity:
Paul Erdös, Aleksandar Ivić (1982)
Publications de l'Institut Mathématique
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.
P. Gallagher (1974)
Acta Arithmetica
Similarity:
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...
Müller, Tom (2005)
Journal of Integer Sequences [electronic only]
Similarity:
K. Szymiczek (1964)
Colloquium Mathematicae
Similarity:
Martin, Harold W. (2007)
Integers
Similarity:
Zhou, Weiyi, Zhu, Long (2009)
Integers
Similarity:
Artūras Dubickas, Andrius Stankevičius (2007)
Acta Arithmetica
Similarity:
Nathanson, Melvyn B., Orosz, Brooke (2007)
Integers
Similarity: