Possible Duplicate:
Would like a proofreading of my proof
Prove that if $n$ is positive integer, then $n^2$ is divisible by $3$ with remainder either $0$ or $1$.
Asked
Active
Viewed 135 times
0
-
1a duplicate – Jyrki Lahtonen Oct 23 '11 at 14:53
-
@evodevo: Don't take it personally that this is being closed. A house rule. I'm sure you will learn enough by studying the answers of the duplicate question. – Jyrki Lahtonen Oct 23 '11 at 18:02
1 Answers
3
Hint: $$ 0^2=0\mod 3, $$
$$ 1^2=1\mod 3, $$
$$ 2^2=4=1\mod 3. $$
Rasmus
- 18,946
-
6So basically, your proof would be the above, except you would omit the word "hint" and replace "Use that" with "Since" :) – The Chaz 2.0 Oct 23 '11 at 14:46
-
-
I turned my answer into something that is more like a hint and less like a full answer. – Rasmus Oct 23 '11 at 19:56