Number TheorySuperchallengeHard Number Theory ShareHard Number Theory · Superchallenge problemHow many ordered pairs (a,b)(a, b)(a,b) of integers with 1≤a≤10011 \le a \le 10011≤a≤1001 and 1≤b≤10011 \le b \le 10011≤b≤1001 satisfy a3≡b3(mod1001)a^3 \equiv b^3 \pmod{1001}a3≡b3(mod1001)?Check Show answer Walk through it step by step Practice more like this Review this concept