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.)
re(2): possible solution | Comment 3 of 6 |
(In reply to re: possible solution by Steve Herman)

Thanks for that, Steve.

I assumed that 'only two distinct digits' meant exactly two for the very reason you mentioned, i.e. that if one digit is allowed then M=0 works for all N.

But if exactly two digits are required, then N=0 becomes an exception, which is why I noted it.

  Posted by broll on 2015-01-17 23:01:42
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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