
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
April 11th, 2019, 08:34 AM  #1 
Newbie Joined: Apr 2019 From: canada Posts: 3 Thanks: 0  Problem (Bezout's theorem/GCD)
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!) / ((nm)! m!) Show that (gcd (n, m) / n) (C (n, m)) is an integer. Tip: Bézout's theorem. Thank you. Last edited by skipjack; April 11th, 2019 at 03:56 PM. 
April 11th, 2019, 03:43 PM  #2  
Global Moderator Joined: May 2007 Posts: 6,732 Thanks: 689  Quote:
 
April 11th, 2019, 03:53 PM  #3 
Global Moderator Joined: Dec 2006 Posts: 20,485 Thanks: 2041 
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.

April 11th, 2019, 06:52 PM  #4 
Newbie Joined: Apr 2019 From: canada Posts: 3 Thanks: 0 
It's actually called théorème de Bézout in French. I maybe translated it wrong; sorry.
Last edited by skipjack; April 12th, 2019 at 05:31 AM. 
April 11th, 2019, 07:38 PM  #5 
Newbie Joined: Apr 2019 From: canada Posts: 3 Thanks: 0 
Thank you skipjack 

Tags 
bezout, problem, theorem or gcd, theorem or gdc 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bezout's Identity converse  zylo  Abstract Algebra  3  January 9th, 2019 07:49 AM 
Bayes' Theorem  problem  andrijaada99  Probability and Statistics  2  May 2nd, 2018 01:03 PM 
Binomial Theorem problem  HairOnABiscuit  Calculus  2  April 4th, 2012 12:58 PM 
Mean Value Theorem problem?  jkmartinez  Calculus  1  October 27th, 2009 02:58 PM 
Bezout's identity and odd co primes  Euzenius  Number Theory  3  July 16th, 2009 10:41 AM 