1. The problem statement, all variables and given/known data . Disprove the following statement: There exists integers a, b, c, none divisible by 7, such that 7|a^3 + b^3 + c^3 2. Relevant equations 3. The attempt at a solution if 7|a^3 + b^3 + c^3, then a^3 + b^3 + c^3 is congruent to 0(mod 7) if a,b,c are none divisible by 7 then I just work out the cases for 1,2,3,4,5,6 and show that there is no way to get to a^3 + b^3 + c^3 is congruent to 0(mod 7). Is that right? Is there an easier way to do it cause mine is very inefficient.