ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and rr be positive integers with gcd⁡(n,r)=1\gcd(n,r)=1, and consider the congruence

(X−1)n≡Xn−1(modn,  Xr−1),(X-1)^{n}\equiv X^{n}-1 \pmod{n,\;X^{r}-1},

meaning that the two polynomials (X−1)n(X-1)^{n} and Xn−1X^{n}-1 have the same image in the ring (Z/nZ)[X]/(Xr−1)(\mathbb{Z}/n\mathbb{Z})[X]/(X^{r}-1), i.e. every coefficient of (X−1)n−(Xn−1)(X-1)^{n}-(X^{n}-1), after reduction of exponents modulo rr via Xr=1X^{r}=1, is divisible by nn.

For every such pair (n,r)(n,r) satisfying this congruence, either nn is prime or

n2≡1(modr).n^{2}\equiv 1 \pmod{r}.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.