Michael's Car

\[\large a^m \equiv 1 \pmod n\]

For every integer \(a\) coprime to \(n\), we define \(\lambda(n)\) as the smallest integer \(m\) such that the congruence above is fulfilled.

Evaluate \(\displaystyle{\sum_{i=1}^{10^6} \lambda(i)} \).

×

Problem Loading...

Note Loading...

Set Loading...