A palindrome is a word, number, phrase, or other sequence of characters which spells the same backward as forward.
Examples of numeric palindromes: 1 1 , 2 4 2 , 5 0 0 5 , 7 5 3 5 7 , 9 2 6 4 6 2 9
What is the smallest numeric palindrome (integer) that is divisible to all digits except for 5 and 0 ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Does the dot mean the multiplication symbol?
Log in to reply
yes dot between number and letter is multiplication.
Since the palindrome number is divisible by 1 , 2 , 3 , 4 , 6 , 7 , 8 , and 9 , it must be divisible by the lowest common multiple lcm ( 1 , 2 , 3 , 4 , 6 , 7 , 8 , 9 ) = 7 × 8 × 9 = 5 0 4 . Therefore the palindrome number must be a multiple of 5 0 4 . Using Python coding the smallest of such multiple is 4 8 3 8 4 .
What the meaning of " is divisible to all digits except for 5 and 0 "?
I suppose the author wanted to say "is divisible by all 1 digit numbers except 5 . Divisibility by 0 is not determinable.
Problem Loading...
Note Loading...
Set Loading...
let the number be x :
( 1 , 2 , 3 , 4 , 6 , 7 , 8 , 9 ) ∣ x ⇒ 7 × 8 × 9 ∣ x ⇒ 5 0 4 ∣ x
Obviously 504 is not palindrome, so x ≥ 2 × 5 0 4 > 1 0 0 0 , i.e. x has at least 4 digits.
if x has 4 digits:
let x = a b b a = 1 0 0 1 ⋅ a + 1 1 0 ⋅ b = 7 × 1 4 3 ⋅ a + 2 × 5 × 1 1 ⋅ b
9 ∣ x ⇒ 9 ∣ ( a + b + b + a ) ⇒ 9 ∣ ( a + b )
7 ∣ x ⇒ 7 ∣ a b b a ⇒ 7 ∣ b
∴ b = 7 , a = 2 , x = 2 7 7 2
but 8 ∤ 2 7 7 2 , so x must have more than 4 digits.
if x has 5 digits:
let x = a b c b a = 8 × 1 2 5 ⋅ a b + c b a
8 ∣ x ⇒ 8 ∣ c b a
Then c b a must be one of (c is even):
c08
c16
c24
c32
c48
c56
c64
c72
c88
c96
or (c is odd):
c04
c12
c28
c36
c44
c52
c68
c76
c84
c92
As 9 ∣ x , it is easy to get c ( c = 9 k − 2 a − 2 b ). And 7 ∣ x , then we can get the solution x = 4 8 3 8 4
Q.E.D.