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

Home > Numbers
Favorable Numbers (Posted on 2006-11-02) Difficulty: 2 of 5
Call a positive integer n "favorable" if there is a set of n distinct positive integers whose reciprocals' sum adds to 1.

How many unfavorable numbers are there?

See The Solution Submitted by Gamer    
Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Me too, me too! But... | Comment 4 of 5 |
Just have to agree with the others:

1 = 1/1
1 = 1/2                      + 1/3  + 1/6
1 = 1/2 + 1/4                + 1/6  + 1/12
1 = 1/2 + 1/4 + 1/8          + 1/12 + 1/24
1 = 1/2 + 1/4 + 1/8 + 1/16   + 1/24 + 1/48


etc. etc. etc.

But the real question is: If n is favorable, how many different sums in its favor exist?


  Posted by JLo on 2006-11-02 13:42:05
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 (14)
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