We have:
P = 4 divides n
Q = 4 divides n^2
and we want to find a way to express:
- if 4 divides n then 4 divides n^2
we know that p => Q as whenever 4 divides n, 4 will also divide n^2.
proving this goes as follows:
if 4 divides n then n = 4k
therefore n^2 =16k^2
therefore n^2 = 4(4k^2)
so, n^2 has a factor of 4
as P implies Q the statement is sufficient.
-----------------------------------------------------------
to check necessity lets assume that Q implies P
so, if 4 is a factor of n^2 then 4 is a factor of n
lets take 2 for example as this provides a counter example
2^2 is a factor of 4 however, 4 is not a factor of 2,
-----------------------------------------------------------
therefore the statement is sufficient but not necessary