Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  dzielniki pierwotne
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
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.
2
Content available remote On the diophantine equation x2 + 52k = yn
EN
In this paper we prove that the title equation where k >0 and n > 3, may have a solution in integers (x, y, k, n) only if 5\x and p \ k where p any odd prime dividing n, by using a recent result of Bilu, Hanrot and Voutier [3].
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.