Ask your own question, for FREE!
Mathematics 18 Online
Parth (parthkohli):

Prove that every perfect square is \(0\) or \(1\) modulo 4.

Parth (parthkohli):

Is this another even/odd proof?

OpenStudy (anonymous):

by ft of a all exponents of prime factorization are even, so if it contains a 2 it contains a 4 now the question is, suppose it is odd, then what?

OpenStudy (anonymous):

yes

Parth (parthkohli):

Hmm...\[p^2 = (2n + 1)^2 = 4n^2 + 4n + 1\]

OpenStudy (anonymous):

when even remainder is 0 and when odd remainder is 1

OpenStudy (shubhamsrg):

every no.is always of the form 4n ,4n+1,4n+2 or 4n+3 sq each, you shhould get what you seek..

Parth (parthkohli):

What now?

OpenStudy (anonymous):

@shubhamsrg as the method if \(n^2\) is odd

OpenStudy (anonymous):

**"has the method"

Parth (parthkohli):

Ohh!

Parth (parthkohli):

It's already in front of me.

OpenStudy (phi):

mod 4 4(n)+1 is 1

Parth (parthkohli):

Yes :)

Parth (parthkohli):

Thanks all

Parth (parthkohli):

@satellite73: My MSE username is Dumb Cow in case you wonder... :P

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!