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

Home > Just Math
Choose-Product Conclusion (Posted on 2014-07-23) Difficulty: 3 of 5
Determine all possible pairs (m,n) of positive integers such that C(m,n) equals the product of all prime numbers ≤ m.

Note:
C is the choose function, that is:
C(m,n) = m!/(n! * (m-n)!)

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some Thoughtscomputer exploration (possible spoiler)Charlie2014-07-23 15:32:03
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 (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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