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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!