Problem

Source: China Zhejiang Fuyang , 27 Jul 2014

Tags: modular arithmetic, number theory unsolved, number theory



Let p be a primes ,x,y,z be positive integers such that x<y<z<p and {x3p}={y3p}={z3p}. Prove that (x+y+z)|(x5+y5+z5).