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

Home > Just Math
Possible or not? (Posted on 2015-01-17) Difficulty: 4 of 5
Prove or disprove the following:
For any integer number N there exists at least one integer number M, such that the decimal presentation of M*N needs only two distinct digits.

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

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts re(3): possible solution | Comment 4 of 6 |
(In reply to re(2): possible solution by broll)

1.".I assumed that 'only two distinct digits' meant exactly two for "..

AND RIGHTLY SO.

 Anyone with common sense would object to describing 0 (zero)
as two-distinct-digit number.
When anyone asks you "tea or coffee?" only professional nitpicker might respond with a clarifying question
"Is the or inclusive or exclusive?"

2. Re your remark - d3 or d4 - I felt like 3.5 and was about to comply with your suggestion, but apparently was too slow.
No big deal.

3. I missed the "Jim" part - please explain...



  Posted by Ady TZIDON on 2015-01-18 04:18:04
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