Show that if $b\mid c$ and $b > \gcd(c, d)$, then $b\nmid d$.

61 Views Asked by At

I have no clue about how to go about this question. I feel like I need more info, but I don't know, please help.

1

There are 1 best solutions below

2
On

hint: Use proof by contradiction:

Assume $b\mid c$ and $b\gt \gcd(c, d).$

Now suppose, for the sake of contradiction, that $b\mid d$.

So, if $b$ divides $c$ and $b$ divides $d$, then $b \mid \gcd(c, d).\quad$ (Why?).

But ...