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

Question 286032: prove that no number of the type 4k+2 be a perfect square.
Answer by nabla(475) (Show Source): You can put this solution on YOUR website!
Denote a^2=4k+2=2(2k+1). So 2|a^2 thus 2|a. Let a=2n. Then a^2=4n^2 which means 4|a^2.
However, we have a^2=4k+2. 4 does not divide 4k+2, hence 4k+2 can never be a perfect square.

In other words: if a is even, its square will always be divisible by 4.
RELATED QUESTIONS
Prove that no number of the type 4k+2 be a perfect... (answered by Edwin McCravy)

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)