Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: liczby Mersenne'a

Sortuj według:

Ogranicz wyniki do:

On the distribution of numbers n satisfying the congruence 2 n-k ≡ 1 (mod n) for k =2 and k=4

Paszkiewicz A., Rotkiewicz A.

Electronics and Telecommunications Quarterly

2009

Vol. 55, No 1

47-56

In this paper we address an old problem concerning the existence of infinitely many solutions n of the congruence 2 n-k ≡ 1 (mod n) for an arbitrary positive integer k. The existence of infinitely many solutions of that congruence follows from more general but not constructive theorems, which do not give an answer about the number of solutions below a given limit x. It is well known that if k = 1, then our congruence hold for every prime number n > 2 as well as for infinitely many odd composite integers n, called pseudoprimes. If k = 3 then every number n of the form 3p (p an odd prime) is a solution of the congruence 2 n-3 ≡ 1 (mod n). We study the distribution of consecutive solutions of our congruence in the two simplest but resistant cases k = 2 and k = 4.

Fermat and mersenne numbers in Pepin's test

Solcova A., Krizek M.

Demonstratio Mathematica

2006

Vol. 39, nr 4

737-742

We examine Pepin’s test for the primality of the Fermat numbers Fm = 22m + 1 for m = 0, 1, 2, . . . . We show that Dm = (Fm - 1)/2 - 1 can be used as a base in Pepin’s test for m > 1. Some other bases are proposed as well.