I was trying to use the divisibility rules of 2,3,5 and 7 but I becomes very tedious and couldn's solve the problem. I think there could be a faster way to solve it or to apply those rules. Please help me and thank you very much.
-
Which multiples of 2 are also multiples of 3? Then work out which of those are also multiples of 5. Then you can find a simple formula for those which are also multiples of 7. – Empy2 Apr 29 '17 at 14:36
2 Answers
Hint: The last digit has to be $0$ to be divisible by $2$ and $5$ simultaneously. Thus, The number you are seeking is $ABC0$ where $A,B,C\in\{0,1,4,9\}$ but $A \ne 0$.
Also, $A+B+C=3k$ for divisibility via $3$-Equation $(1)$
And $A+B+C =7 \lambda$-Equation$(2)$
Although I'd recommend checking divisibility rules for $7$ before taking equation $(2)$ into account.
or in short, it should be divisible by $21$.
I can see only one number here i.e. $4410$
Disclaimer: But there can be more. I haven't check the whole sample space yet.
- 4,727
-
4410 is the only solution, I did a quick check on all 4 digit numbers (if you count 0000 as a 4 digit number, this is another solution). – stanley dodds Apr 29 '17 at 14:55
-
Why must $A+B+C$ be a multiple of 7? That is not even true for the example you found. – Harald Hanche-Olsen Apr 29 '17 at 14:56
-
-
If $n$ is divisible by $2,3,5$ and $7$, then $n$ is a multiple of $2 \cdot 3 \cdot 5 \cdot 7 \cdot = 210$.
That means that $m = \dfrac{1}{10}n = abc_{10}$ is a multiple of $21$ and $\{a,b,c\} \subset \{0,1,4,9\}$.
Let's first find all $m$ thst are multiples of $3$.
Note that $0, 9 \equiv 0 \pmod 3$ and $1,4 \equiv 1 \pmod 3$ So $m$ consists of all $1$'s and $4$'s or of all $0$'s and $9$'s. We get these possibilities.
\begin{array}{cccccccc} 111 & 114 & 141 & 144 & 411 & 414 & 441 & 444 \\ 900 & 909 & 990 & 999 \end{array}
Out of these $12$ integers, only $441$ is also a multiple of $7$.
Hence the answer is $n = 4410$
- 26,769