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

Home > Numbers
1 to 9 concatenation (Posted on 2016-04-12) Difficulty: 3 of 5
What is the largest number n so that n, 2n, and 3n together contain every digit from 1-9 exactly once?

Analytical solution preferred.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
a solution | Comment 2 of 7 |
n=327 works.  2n=654 and 3n=981.

But then n*(power of 10) is a solution too so there is no largest n. 

  Posted by xdog on 2016-04-12 12:17:43
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 (6)
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