MODBasic Difficult

Problem - 4260

Let $n$ be an integer which is divisible by neither $2$ nor $5$. Show that $n$ must be divisible by a number whose digits are all $1$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error