MHB Proving the integer that p is even and its square is even as well

cbarker1
Gold Member
MHB
Messages
345
Reaction score
23
Dear Everyone,I would like some help to get start with a proof. A problem states, "if p is an integer, show that p is even iff p^2 is even."I know that p is the an integer.

Let p be an integer.

$p=2m$, where m is an integer.Thank you for your help

CBarker
 
Mathematics news on Phys.org
To show that the integer $p$ is even iff $p^2$ is even, we have to show the following two implications:
  1. Let $p \in \mathbb{Z}$. If $p$ is even, then $p^2$ is even.
  2. Let $p \in \mathbb{Z}$. If $p^2$ is even, then $p$ is even.

To show the first one we do the following:

$p$ is an even integer, so $p=2m$, for some $m \in \mathbb{Z}$.
Squaring both sides we get $p^2=(2m)^2=4m^2=2(2m^2)$.
Since $m$ is an integer, we have that $2m^2$ is also an integer.
So, $p^2=2n$, with $n=2m^2 \in \mathbb{Z}$.
So, $p^2$ is even. Can you continue and show the second implication?
 
P is not even. If p is not even, then it is odd; therefore there exists an integer n such that
$p=2n+1$
${p}^{2}={\left(2n+1\right)}^{2}\implies p^2=4n^2+4n+1$
$p^2=2\left(2n^2+2n\right)+1$
$p^2=2k+1$, where $k=2n^2+2n$ is some integer.
${p}^{2}$ is odd, contrary to the hypothesis. Since p is not even, it leads to a contradiction. p is even. QED

Is it correct?
 
Last edited:
It is correct! (Yes)
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top