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

Home > Numbers
Interesting representation (Posted on 2016-02-08) Difficulty: 2 of 5
Show that every positive integer is a sum of one or more numbers of the form 2^r*3^s, where r and s are nonnegative integers and no summand divides another.

Remarks: This problem was originally created by Paul Erdős.
Note that the representations need not be unique: for instance, 11 = 2+9 = 3+8:

No Solution Yet Submitted by Ady TZIDON    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts Non-answer | Comment 1 of 6
Of course to be much of a problem the addends must also be unique otherwise you could just use 1+1+1+1+...

Couldn't s be zero and just add in binary?
11 = 8+2+1
12 = 8+4
13 = 8+4+1

Never mind the above they violate: no summand divides another.
As I noticed just before I posted but decided to share anyway.

  Posted by Jer on 2016-02-08 15:42:16
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information