Show that the equation y^{37}\equiv x^3+11 \pmod p is solvable for every prime p, where p\leq100.
Problem
Source: HK TST1 2009, Problem 6
Tags: modular arithmetic, number theory unsolved, number theory
Source: HK TST1 2009, Problem 6
Tags: modular arithmetic, number theory unsolved, number theory
Show that the equation y^{37}\equiv x^3+11 \pmod p is solvable for every prime p, where p\leq100.