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.)
re: Analytic Answer | Comment 5 of 7 |
(In reply to Analytic Answer by Brian Smith)

Assume n starts with 3:
Then n, 2n, 3n are 3xx, 6xx, and 9xx.  There can be no carry from the tens to the hundreds in this case.   This implies the tens digit in 9xx is at least 6.  To get that high the tens digit in 3xx must be 2, which leaves 7 as the only possible tens digit in 9xx.  Then the numbers are 32x, 6xx, 97x.  This leaves only n=324, 325, or 326 as possible candidates.  None of those satisfy the problem.


  Posted by Jer on 2016-04-12 14:11:58
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 (2)
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