Question: Let n be a positive integer not divisible by 2 or 5. Prove there is a multiple of n whose digits are all 1. (Hint:
Let n be a positive integer not divisible by 2 or 5. Prove there is a multiple of n whose digits are all 1. (Hint: Look at the sequence 1, 11, 111,..., and use the pigeonhole principle.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
