Prove that any given positive whole number less than or equal to n! can be represented as the sum of at most n distinct divisors of n!, where n is a positive integer.
 |
All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars |
