AbstractAnalogues of Fermat quotients for a composite modulusm⩾2 are investigated, with special emphasis on various congruences. In particular, the numbersmfor whichaφ(m)≡1 (modm2), where gcd(a,m)=1, (“Wieferich numbers with basea”) are completely characterized in terms of the Wieferich primes with basea
The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ +...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
AbstractAnalogues of Fermat quotients for a composite modulusm⩾2 are investigated, with special emph...
Fermat’s little theorem says for prime p that ap−1 ≡ 1 mod p for all a 6 ≡ 0 mod p. A naive extensio...
Fermat’s little theorem is an important property of integers to a prime modulus. Theorem 1.1 (Fermat...
Fermat’s little theorem is an important property of integers to a prime modulus. Theorem 1.1 (Fermat...
We study the solutions of certain congruences in different rings. The congruences include a^p-1 ≡ 1...
summary:Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base $...
summary:Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base $...
A Fermat number is a number of the form Fn = 2^2^ n+ 1, where n is an integer ≥ 0. A Fermat composit...
summary:We show that any factorization of any composite Fermat number $F_m={2^{2}}^m+1$ into two non...
summary:We show that any factorization of any composite Fermat number $F_m={2^{2}}^m+1$ into two non...
The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ +...
The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ +...
The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ +...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
AbstractAnalogues of Fermat quotients for a composite modulusm⩾2 are investigated, with special emph...
Fermat’s little theorem says for prime p that ap−1 ≡ 1 mod p for all a 6 ≡ 0 mod p. A naive extensio...
Fermat’s little theorem is an important property of integers to a prime modulus. Theorem 1.1 (Fermat...
Fermat’s little theorem is an important property of integers to a prime modulus. Theorem 1.1 (Fermat...
We study the solutions of certain congruences in different rings. The congruences include a^p-1 ≡ 1...
summary:Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base $...
summary:Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base $...
A Fermat number is a number of the form Fn = 2^2^ n+ 1, where n is an integer ≥ 0. A Fermat composit...
summary:We show that any factorization of any composite Fermat number $F_m={2^{2}}^m+1$ into two non...
summary:We show that any factorization of any composite Fermat number $F_m={2^{2}}^m+1$ into two non...
The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ +...
The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ +...
The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ +...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
DOI
Add to ORKG