# Need descrete math help

by mamma_mia66
Tags: descrete, math
 P: 52 1. The problem statement, all variables and given/known data Show that n2 $$\neq$$2 (mod6) for all n in Z 2. Relevant equations 3. The attempt at a solution 0 1 2 3 4 5 0 0 0 0 0 0 0 1 0 1 2 3 4 5 2 0 2 4 0 2 4 3 0 3 0 3 0 3 4 0 4 2 0 4 2 5 0 5 4 3 2 1 I did only the table for mod 6 and then I don't have an idea what to do. I am not even sure if I understand what exactly I have to do with this problem. Please help me if you can.
 HW Helper P: 5,003 Hmmm....have you tried proof by contradiction? That is, assume that $n^2 \equiv 2 \pmod{6}$....what does that imply?
 P: 52 Need descrete math help I think the only hint I get for this was the reminder needs to be $$\neq$$2. I am gessing that has something to do with division Algorithm. I will try the above ideas.
 Mentor P: 21,397 VeeEight said that "n$$^2$$ congruent to 2 mod 6 is the same as n$$^2$$ - 2 is a a multiple of 6." That's also the same as saying that n$$^2 - 2 \equiv$$ 0 mod 6. This one is ripe for a proof by induction.