perplexus.info :: Just Math : Binomial GCDs

Binomial GCDs (Posted on 2016-08-08)

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!:

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

The required GCD is exactly the largest power of 2 that divides 2n.
EXPLANATION:
Refer to the solution submitted by Brian Smith in this location.

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
Solution	Brian Smith	2022-09-30 12:34:08
Heuristic solution	Charlie	2016-08-08 14:34:12
Clarification	Ady TZIDON	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:


perplexus dot info