Skip to main content
MathOverflow

Return to Question

Rollback to Revision 2
Source Link
Douglas Zare
Douglas Zare
  • 28k
  • 6
  • 90
  • 130

What is the reason that p must be prime in orderare all positive integers n for Fermat's Little Theorem to holdwhich the congruence $a^{n+1} \equiv a (mod n)$ holds?

Fermat's little theorem says that the congruence $a^p \equiv a (mod p)$ if $p$ is a prime number. $a^{n+1} \equiv a (mod n)$ works for all integers $a$ and some positive integers $n$, how can we characterize the positive integers $n$ for which $a^{n+1} \equiv a (mod n)$ holds?

What is the reason that p must be prime in order for Fermat's Little Theorem to hold?

Fermat's little theorem says that the congruence $a^p \equiv a (mod p)$ if $p$ is a prime number

What are all positive integers n for which the congruence $a^{n+1} \equiv a (mod n)$ holds?

Fermat's little theorem says that the congruence $a^p \equiv a (mod p)$ if $p$ is a prime number. $a^{n+1} \equiv a (mod n)$ works for all integers $a$ and some positive integers $n$, how can we characterize the positive integers $n$ for which $a^{n+1} \equiv a (mod n)$ holds?

deleted 182 characters in body; edited title
Source Link
Josh Learner
Josh Learner
  • 17
  • 2

What are all positive integers n for whichis the congruence $a^{n+1} \equiv a (mod n)$ holdsreason that p must be prime in order for Fermat's Little Theorem to hold?

Fermat's little theorem says that the congruence $a^p \equiv a (mod p)$ if $p$ is a prime number. $a^{n+1} \equiv a (mod n)$ works for all integers $a$ and some positive integers $n$, how can we characterize the positive integers $n$ for which $a^{n+1} \equiv a (mod n)$ holds?

What are all positive integers n for which the congruence $a^{n+1} \equiv a (mod n)$ holds?

Fermat's little theorem says that the congruence $a^p \equiv a (mod p)$ if $p$ is a prime number. $a^{n+1} \equiv a (mod n)$ works for all integers $a$ and some positive integers $n$, how can we characterize the positive integers $n$ for which $a^{n+1} \equiv a (mod n)$ holds?

What is the reason that p must be prime in order for Fermat's Little Theorem to hold?

Fermat's little theorem says that the congruence $a^p \equiv a (mod p)$ if $p$ is a prime number

Post Closed as "Not suitable for this site" by Lucia, Boris Bukh, abx, user9072, Stefan Kohl♦
Latex edits
Source Link
edit approved Sep 18, 2014 at 13:48
Konstantinos Gaitanas
edit approved Sep 18, 2014 at 13:48
Konstantinos Gaitanas
  • 3.9k
  • 1
  • 24
  • 39

What are all positive integers n for which the congruence a^($a^{n+1) =} \equiv a (mod n)$ holds?

Fermat's little theorem says that the congruence a^p = a (mod p)$a^p \equiv a (mod p)$ if p$p$ is a prime number. a^(n+1) = a (mod n)$a^{n+1} \equiv a (mod n)$ works for all integers a$a$ and some positive integers n$n$, how can we characterize the positive integers n$n$ for which a^(n+1) = a (mod n)$a^{n+1} \equiv a (mod n)$ holds?

What are all positive integers n for which the congruence a^(n+1) = a (mod n) holds?

Fermat's little theorem says that the congruence a^p = a (mod p) if p is a prime number. a^(n+1) = a (mod n) works for all integers a and some positive integers n, how can we characterize the positive integers n for which a^(n+1) = a (mod n) holds?

What are all positive integers n for which the congruence $a^{n+1} \equiv a (mod n)$ holds?

Fermat's little theorem says that the congruence $a^p \equiv a (mod p)$ if $p$ is a prime number. $a^{n+1} \equiv a (mod n)$ works for all integers $a$ and some positive integers $n$, how can we characterize the positive integers $n$ for which $a^{n+1} \equiv a (mod n)$ holds?

Source Link
Josh Learner
Josh Learner
  • 17
  • 2