Suppose m, n ∈ N. Explain why n|m implies n ≤ m.

57 Views Asked by At

I know that, by definition, n|m implies m=pn for which p is an integer, but I don't know how to get nm.

1

There are 1 best solutions below

2
On

Assuming everything is positive, just note that $k\cdot n \ge n$ for positive integers $k$. (That's just saying that "Multiplying by a number by something bigger than one makes it bigger.")

Of course it breaks if you allow $n$ to divide $-n$, for example.