Page 1 of 1
divisibility again....:)
Posted: Fri Jan 14, 2011 8:47 am
by the arrivals
what you think about the statemen?
1) 3 does divide (n^2+1)....?
give your proof please...
Re: divisibility again....:)
Posted: Fri Jan 14, 2011 7:28 pm
by Masum
This means $n^2\equiv -1(mod\ 3)$,contradiction
Re: divisibility again....:)
Posted: Fri Jan 14, 2011 8:11 pm
by the arrivals
you got the right answer sir
Re: divisibility again....:)
Posted: Sun Jan 16, 2011 10:35 pm
by Masum
Sir?Who is that?
Re: divisibility again....:)
Posted: Wed Feb 09, 2011 9:02 am
by photon
If n isn't divisible by 3,then the remainder of its squre by 3 will be 1.
So it isn't possible.