1

I wanted to check if this was a valid proof for the following:

Let $n \in\mathbb Z$. Prove that if $15n$ is even, then $9n$ is even.

What I have is the following: $$\forall n\in\mathbb Z,p\left( n\right) \rightarrow q\left( n\right) $$ $${\sim q}\rightarrow {\sim p}$$

$p(x)$: $15n$ is even

$q(x)$: $9n$ is even

proof: let $9n=2k+1 \Longrightarrow n=\dfrac {2k+1}{9}$ $$15\left( \dfrac {2k+1}{9}\right) =\dfrac {5}{3}\left( 2k+1\right) $$ $$\dfrac {10}{3}k+\dfrac {5}{3}$$ $$\dfrac {10}{3}K+\dfrac {2}{3}+1=2\left( \dfrac {5k}{3}+\dfrac {1}{3}\right) +1$$

Since $\left( \dfrac {5K}{3}+\dfrac {1}{3}\right) \in\mathbb Z$ and is odd, $15n$ is even.

Help would be appreciated, thank you

PutsandCalls
  • 1,051

1 Answers1

6

$\neg q(n)\implies$

$9n\not\equiv0\pmod2\implies$

$9n\equiv1\pmod2\implies$

$\exists{k\in\mathbb{Z}}:9n=2k+1\implies$

$\exists{k\in\mathbb{Z}}:15n=6n+2k+1\implies$

$\exists{k\in\mathbb{Z}}:15n=2(3n+k)+1\implies$

$15n\equiv1\pmod2\implies$

$15n\not\equiv0\pmod2\implies$

$\neg p(n)$

barak manos
  • 43,109