Proof WritingHardExistence, Uniqueness and Counterexamples ShareExistence, Uniqueness and Counterexamples · Hard problemFor how many ordered pairs (a,b)(a, b)(a,b) with 0≤a,b≤70 \le a, b \le 70≤a,b≤7 is a2≡b2(mod8)a^2 \equiv b^2 \pmod 8a2≡b2(mod8) true but "a≡ba \equiv ba≡b or a≡−b(mod8)a \equiv -b \pmod 8a≡−b(mod8)" false?Check Show answer Walk through it step by step Practice more like this Review this concept