Find the number of integer pairs $x,y$ between $0$ and $100$ such that $x^{20}$ has the same remainder as $y^{50}$ when divided by $101$.
Find the number of integer pairs 0 ≤ a, b ≤ 100 such that a^20 ≡ b^50 (mod 101). Need help with understanding solution