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?

  Submitted by Gamer    
Rating: 3.0000 (1 votes)
Solution: (Hide)
There are different solutions, but one simple method uses the equation from the solution to Unit Fractions: 1/a=1/(a-1)-1/(a*(a-1))

By applying it successively to the last term of the sequence forming 1/2, 1/3, 1/6, strictly smaller fractions may be created, thus allowing n to be any number 3 or greater. For n=4, 1/2, 1/3, 1/7, 1/42; for n=5 1/2, 1/3, 1/7, 1/43, 1/1806; ...

What is left to check is for n=1 and n=2. For n=1, the series 1 works, but for n=2, the only integers whose sum adds to 1 are 2 and 2, but they are not distinct, thus 2 is the only unfavorable number.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Puzzle AnswerK Sengupta2022-05-09 21:38:45
SolutionMe too, me too! But...JLo2006-11-02 13:42:05
SolutionInductive answerFederico Kereki2006-11-02 12:43:16
SolutionEric2006-11-02 12:14:47
SolutionMinimalist Answer / No SpoilerOld Original Oskar!2006-11-02 10:56:09
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 (12)
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