Number TheoryChallengeOrders and Primitive Roots ShareOrders and Primitive Roots · Challenge problemHow many pairs (x,y)(x, y)(x,y) with 0≤x,y<70 \le x, y < 70≤x,y<7 satisfy x2+y2≡1(mod7)x^2 + y^2 \equiv 1 \pmod 7x2+y2≡1(mod7)?Check Show answer Walk through it step by step Practice more like this Review this concept