MathDB

Find all pair fulfilling divisibility condition

Source: Romania 2001

November 10, 2004

modular arithmeticnumber theory proposednumber theorypolynomial congruence

Problem Statement

Find all pairs

\left(m,n\right)

of positive integers, with

m,n\geq2

, such that

a^n-1

is divisible by

m

for each

a\in \left\{1,2,3,\ldots,n\right\}