0

I got this riddle that I just couldnt solve. It's simple, how can you prove that a:b will always be C ? (a, b and c are natural numbers) For example 12:3=4, 4 will be the only solution.

zarko
  • 15

2 Answers2

1

Well, by writing $a/b$ as an expression, you're sort of assuming that it is "well-defined", that is, it has exactly one value. Otherwise, there might be a scenario where you could say $a/b \ne a/b$, which would be absurd. So I'll rephrase the question.

If $b \ne 0$ (can't divide by $0$), $a = bc$ and $a = bc'$, how do we know that $c = c'$?

Proof: $$ bc = bc' \implies bc - bc' = 0 \implies b(c - c') = 0$$ In the integers, if two things multiply to $0$, at least one is $0$. Since $b \ne 0$, we know that $c - c' = 0$, and so $c = c'$.

Note that this is essentially a proof that division is well-defined.

Henry Swanson
  • 12,972
0

The Euclidean Division Theorem states that when you divide 2 natural numbers (except for division by 0) a quotient and remainder exist, and are unique. proof

qwr
  • 10,716