MathDB
Problem from Indonesian TST

Source:

December 8, 2010
number theoryleast common multiplefunctionrelatively primenumber theory unsolved

Problem Statement

For every natural number n n , define s(n) s(n) as the smallest natural number so that for every natural number a a relatively prime to nn, this equation holds: as(n)1(modn) a^{s(n)} \equiv 1 (mod n) Find all natural numbers n n such that s(n)=2010 s(n) = 2010