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

Home > Numbers
Ulam numbers (Posted on 2017-06-03) Difficulty: 3 of 5
We define recursively the Ulam numbers by setting u1 = 1, u2 = 2, and for each subsequent integer n, we set n equal to the next Ulam number if it can be written uniquely as the sum of two different Ulam numbers; e.g.: u3 = 3, u4 = 4, u5 = 6, etc.

Prove that there are infinitely many Ulam numbers.

Now a D4 BONUS.
3 (=1+2). Find another Ulam number is that is the sum of two consecutive Ulam numbers.

How about a 3rd one?

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

Comments: ( Back to comment list | You must be logged in to post comments.)
Question One erratum and one ENCORE | Comment 4 of 5 |
1. 3rd line from the bottom :    erase the 1st is.
2.  How about a 3rd one? - nobody addressed it yet...

  Posted by Ady TZIDON on 2017-06-04 08:10:31
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 (4)
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