KöMaL 2011 B4401

Let $p$ =3 $n$ +1 be a prime number. Is it possible for the numbers $1^3,2^3,\ldots,n^3$ to leave pairwise different remainders when divided by $p$ ?

Official text KöMaL. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.