Number TheorySuperchallengeOrders and Primitive Roots ShareOrders and Primitive Roots · Superchallenge problemHow many integers xxx with 1≤x≤10001 \le x \le 10001≤x≤1000 satisfy x10≡1(mod1001)x^{10} \equiv 1 \pmod{1001}x10≡1(mod1001)?Check Show answer Walk through it step by step Practice more like this Review this concept