I try to use $~n=2x+1~$ to prove it and $~n^2-1=4x(x+1)~$. I do not know how to prove it.
Really need help here.
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.Sign up to join this community
When $n$ is $1$ $ mod$ $ 2$ then $n^2$ is $1$ $ mod$ $ 4$. If $n$ is not divisible by $3$ then $n^2$ is $1$ $ mod$ $ 3$
Thus when $n$ is not divisible by $3$ one has that
$n^2 \equiv 1$ $ mod$ $ 4$
$n^2 \equiv 1$ $ mod$ $ 3$
Now since $(4,3) = 1$ one can apply chinese remainder theorem to deduce $n^2 \equiv 1$ $ mod$ $ 12$
There can be 6 possibility of the numbers , $$ 6n , 6n ± 1, 6n±2,6n+3 $$ => Now if the number is of the form : $$ 6n \ or \ 6n+3 $$ it is divisible by 3 so we are done.
=> If the numbers is $$\ 6n±2 $$ then it is an even numbers and so out of the boundary of the Quest.
=> Now if the number is $$6n±1$$ then its square would be $$ 36n ± 12n +1$$ which leaves remainder 1 when divides by 12 .