Problem (Bezout's theorem/GCD)

Apr 2019
3
0
canada
Hello, can you help me solve this problem? It's urgent please:

Let 1 <= m <= n be two integers.
Note by C (n; m) = (n!) / ((n-m)! m!)
Show that (gcd (n, m) / n) (C (n, m)) is an integer.

Tip: Bézout's theorem.
Thank you.
 
Last edited by a moderator:

skipjack

Forum Staff
Dec 2006
21,479
2,470
See this article. The hint was presumably referring to Bézout's identity (also called Bézout's lemma) rather than Bézout's theorem.
 
Apr 2019
3
0
canada
It's actually called théorème de Bézout in French. I maybe translated it wrong; sorry.
 
Last edited by a moderator: