The distribution of inverses modulo a prime in short intervals
S. M. Gonek, G. S. Krishnaswami, V. L. Sondhi (2002)
Acta Arithmetica
Similarity:
S. M. Gonek, G. S. Krishnaswami, V. L. Sondhi (2002)
Acta Arithmetica
Similarity:
Dieter Wolke, Tao Zhan (1993)
Mathematische Zeitschrift
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...
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:
K. Ramachandra (1971)
Acta Arithmetica
Similarity:
Müller, Tom (2005)
Journal of Integer Sequences [electronic only]
Similarity:
K. Szymiczek (1964)
Colloquium Mathematicae
Similarity:
Florian Luca, Francesco Pappalardi (2007)
Acta Arithmetica
Similarity:
Nyman, Bertil, Nicely, Thomas R. (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Jiahai Kan (2004)
Acta Arithmetica
Similarity:
Artūras Dubickas, Andrius Stankevičius (2007)
Acta Arithmetica
Similarity:
Paul Erdös, Aleksandar Ivić (1982)
Publications de l'Institut Mathématique
Similarity:
Kenichi Arai, Hiroyuki Okazaki (2009)
Formalized Mathematics
Similarity:
In the [16] has been proven that the multiplicative group Z/pZ* is a cyclic group. Likewise, finite subgroup of the multiplicative group of a field is a cyclic group. However, finite subgroup of the multiplicative group of a field being a cyclic group has not yet been proven. Therefore, it is of importance to prove that finite subgroup of the multiplicative group of a field is a cyclic group.Meanwhile, in cryptographic system like RSA, in which security basis depends upon the difficulty...