Consider the following proof fragment.
There exists an integer $k$ such that $n = 3k+1$.
Then $n^2 = (3k+1)^2 =9k^2 + 6k + 1 = 3 (3k^2 +2k)+1$.
For each of the statements, $(a), (b), (c)$, below, answer the following.
Does the fragment provide a proof of the statement? If yes, explain why. If no, explain why not. The letter n denotes an integer.
(a) If $n$ is odd, then $n^2$ is odd.
(b) If $n^2$ is divisible by $3$, then $n$ is divisible by $3$.
(c) If $n$ leaves remainder $1$ on division by $3$, then so does $n^2$.
I am having some trouble understanding the question. I have started a) by assuming $n$ is odd and I took $n=3k+1$ and then I showed that $n^2=(3k+1)^2=3(3k^2+2k)+1$ and I said that if $n=3k+1$ is odd $3k$ is even so $k$ is even and can be writen as $k=2m$ where $m$ is an integer. After that I sub. $k=2m$ into the $n^2=3(3k^2+2k)+1$ and I find that $n^2=2$(somthing)$+1$ so it is odd.
I have been told by my Professor that is I should not use the statment given to me to answer $a,b$, and $c$. I was wondering if for $a)$ I am just supposed to take $n=2k+1$ and then show that $n^2$ is odd. Can someone help me out?
