0

Prove that $\exists n,m \in \mathbb{N}$ such that $$3n+5m=12 $$ This is clearly false, but I am not sure how to conduct a proof stating it is false. Should I just give examples with $n = 1,2,3$ and then pick $m$s afterwards?

Shaun
  • 44,997

2 Answers2

2

Since it asks for solutions in $\mathbb{N}$, you could cycle through all the (finitely) many possible solutions and show none satisfies the equation - i.e. you exhaustively show all possible solutions fail.

However, another simple argument is to suppose that some $m$, $n$ exist in $\mathbb{N}$ such that $3n + 5m = 12$. In this case, $n = \frac{12-5m}{3}$, by rearrangement. Thus, $n =4- \frac{5m}{3}$. But, $\frac{5m}{3}\not\in \mathbb{N}$ for $m<3$. So, $m\geq3$, but in this case we have $5m\geq15$ and hence $n$ must be negative, i.e. $n\not\in \mathbb{N}$. This is a simple proof by contradiction.

JWeissman
  • 300
  • 1
  • 9
1

If $0\in\mathbb N$ then take $n=4$ and $m=0$.

Otherwise, $n\ge 1$ and $m\ge 1$, and so $3n+5m\ge 8$. The next possible values are $8+3=11$ and $8+5=13$. And so $12$ is out.

lhf
  • 216,483