1. The problem statement, all variables and given/known data Let p be a prime number. Prove: (a+b)^p modp = [(a^p modp) + (b^p modp)]modp 2. Relevant equations modular arithmetic. 3. The attempt at a solution I honestly haven't the slightest clue. Would induction be my best bet here? If so, when I suppose the statement is true for (k+1), n isn't always prime anymore. I used to be a biochem major and just switched into algebra, so I'm sorry if I seem retarded, I'm just very behind! Help please!