Prove by pigeon hole principle.

Let $$k \in \mathbb{Z}^+$$ . Prove that there exists a positive integer n such that k|n and the only digits in n are 0's and 3's.

Question

Prove by pigeon hole principle.

Let $$k \in \mathbb{Z}^+$$ . Prove that there exists a positive integer n such that k|n and the only digits in n are 0's and 3's.

whpalmer4 · Answer

Let $k \in \mathbb Z^+$ . Prove that there exists a positive integer $n$ such that $k|n$ and the only digits in n are 0's and 3's

chihiroasleaf · Answer

how to edit my question? -_-

whpalmer4 · Answer

Beats me, I've never asked one :-)

whpalmer4 · Answer

In OpenStudy, you want to use \ ( (without the space) and \ ) (again, without the space) to include equation text inline.  You can also do $ $ (no space) or \ [  \ ] (no space) around stuff, but it will be placed on its own line.