• Aucun résultat trouvé

a) Assume that the number N = a n − 1 is prime. Show that N is a Mersenne prime, that is a = 2 and n is prime.

N/A
N/A
Protected

Partager "a) Assume that the number N = a n − 1 is prime. Show that N is a Mersenne prime, that is a = 2 and n is prime."

Copied!
9
0
0

Texte intégral

(1)

m

n

(2)

n

(3)

(4)

(5)

m

n

n−m

m

n

m

n

n

n

n

n

(6)

(7)

n

n

5

(8)

(9)

References

http://www.math.jussieu.fr/~miw/

Références

Documents relatifs

Since 19 th Century, a lot of burgeoning approaches have made number theory evolved greatly, and a series of problems have been tackled in unified methods, nevertheless, little

The second mentioned author would like to thank James Cogdell for helpful conversation on their previous results when he was visiting Ohio State University.. The authors also would

— In a series of papers, we constructed large families of normal numbers using the concatenation of the values of the largest prime factor P (n), as n runs through particular

The number of words to be eliminated being equal to 3 i−1 is, as in previous section, very lesser that the total number of words and we are so ensured to find between to

Aware of the grave consequences of Substance abuse, the United Nations system including the World Health Organization have been deeply involved in many aspects of prevention,

Formally prove that this equation is mass conser- vative and satisfies the (weak) maximum principle.. 4) Dynamic estimate on the entropy and the first

On combining the prime number theorem with Theorem 1 we obtain the following result.. ak and b be

TOLEV, Additive problems with prime numbers of special type. TOLEV, Lagrange’s four squares theorem with variables of special