Proving n is not divisble by m using Division Algorithm

55 Views Asked by At

When $n$ and $m$ are integers, how could I write a statement equivalent to the statement "$n$ is not divisible by $m$" using ideas from the Division Algorithm?

1

There are 1 best solutions below

1
On BEST ANSWER

I'm not totally sure what you mean by this, but generally, '$n$ is not divisible by $m$' means that there does not exist an integer $k$ so that $n=mk$.

Please post a comment if you were looking for something different. Thanks!