MathDB
Not Wiles' Theorem, the other one (BMT 2019 Discrete #5)

Source:

May 24, 2019

Problem Statement

Let 21110≡n mod 1111 2^{1110} \equiv n \bmod{1111} with 0≤n<1111 0 \leq n < 1111 . Compute n n .
Back to ProblemsView on AoPS