All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Binomial GCDs (Posted on 2016-08-08) Difficulty: 3 of 5
N is a positive integer.
Find the GCD of C(2n,1), C(2n,3), ….C(2n,2n-1)
where C(a,b) = a!/(a - b)!b!:

See The Solution Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips Clarification | Comment 1 of 3
One should assume that N=n.
  Posted by Ady TZIDON on 2016-08-08 09:28:17
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information