SOLUTION: Prove that no number of the type 4k+2 be a perfect square.

Question 242614: Prove that no number of the type 4k+2 be a perfect square.
Answer by Edwin McCravy(20054) (Show Source): You can put this solution on YOUR website!
Prove that no number of the type 4k+2 can be a perfect square.
'
Lemma:
If p is a prime factor of a perfect square, p^2 must also
be a factor of that perfect square.
'
4k+2 = 2(2k+1)
'
2 is a factor of 4k+2 but 2k+1 is odd and cannot have factor 2, so 4k+2 is not divisible by 4, and therefore cannot be a perfect square.
'
Edwin
RELATED QUESTIONS
prove that no number of the type 4k+2 be a perfect... (answered by nabla)

Prove that no number of type 4k+1 be a perfect... (answered by richwmiller)

Prove that none of terms in the sequence is a perfect square... (answered by ikleyn)

For which values of k does the equation x^-(4k+2)x+7k+2=0 form a perfect square... (answered by josgarithmetic)

Prove that the square root of any perfect square number is equal to positive (+) and... (answered by Alan3354)

Prove:the sum of the squares of two odd integers cannot be a perfect square, i.e, if x... (answered by amarjeeth123)

Given 2;5;8 as a sequence prove that none of the terms are not a perfect square (answered by ikleyn)

1. Find the least perfect square number divisible by 3,4,5,6 & 8? 2. Find the least no.... (answered by jsmallt9)

Perfect square trinomials find the term that should be added to the expression to create (answered by stanbon)