On prime divisors of Mersenne numbers

Paul Erdős; Péter Kiss; Carl Pomerance

Displaying similar documents to “On prime divisors of Mersenne numbers”

Number of prime divisors in a product of consecutive integers

Shanta Laishram, T. N. Shorey (2004)

Acta Arithmetica

Similarity:

On the average of the sum-of-p-prime-divisors function

S. D. Adhikari, G. Coppola, Anirban Mukhopadhyay (2002)

Acta Arithmetica

Similarity:

On the average of the sum-of-a-divisors function

Shi-Chao Chen, Yong-Gao Chen (2004)

Colloquium Mathematicae

Similarity:

We prove an Ω result on the average of the sum of the divisors of n which are relatively coprime to any given integer a. This generalizes the earlier result for a prime proved by Adhikari, Coppola and Mukhopadhyay.

On prime divisors of remarkable sequences.

Filip, Ferdinánd, Liptai, Kálmán, Tóth, János (2006)

Annales Mathematicae et Informaticae

Similarity:

On $n ∣ ϕ (n) d (n) + 2$ and $n ∣ ϕ (n) σ (n) + 1$ .

Chen, Yong-Gao, Fang, Jin-Hui (2008)

Integers

Similarity:

On prime numbers p,q and r such that pq, pr, and qr are pseudoprimes

K. Szymiczek (1964)

Colloquium Mathematicae

Similarity:

A rationality condition for the existence of odd perfect numbers.

Davis, Simon (2003)

International Journal of Mathematics and Mathematical Sciences

Similarity:

On $k$ -imperfect numbers.

Zhou, Weiyi, Zhu, Long (2009)

Integers

Similarity:

Uniqueness of Factoring an Integer and Multiplicative Group Z/pZ*

Hiroyuki Okazaki, Yasunari Shidama (2008)

Formalized Mathematics

Similarity:

In the [20], it had been proven that the Integers modulo p, in this article we shall refer as Z/pZ, constitutes a field if and only if Z/pZ is a prime. Then the prime modulo Z/pZ is an additive cyclic group and Z/pZ* = Z/pZ{0is a multiplicative cyclic group, too. The former has been proven in the [23]. However, the latter had not been proven yet. In this article, first, we prove a theorem concerning the LCM to prove the existence of primitive elements of Z/pZ*. Moreover we prove the...