- #1
whiteman
- 9
- 0
Homework Statement
Let k be any positive integer. Prove that there exists a positive
integer multiple n of k such that the only digits in n are 0s and
1s. (Use the pigeonhole principle.)
Homework Equations
The General Pigeonhole Principle
If more than mk things are distributed into k boxes then
at least one box receives more than m things.
The Attempt at a Solution
Don't know where to start off. I just need a bit of a nudge and hopefully that'll get me started. thanks :)