A number is flexible if it is a multiple of 8 and if a single-digit number is inserted in places between the digits and also at both ends of the original number separately, the new numbers generated are also multiples of 8 . For example, the number 2 0 0 is a flexible number because it is a multiple of 8 and when 8 is inserted in between and at both ends of the digits 2 , 0 , 0 , we have 8 2 0 0 , 2 8 0 0 , 2 0 8 0 , 2 0 0 8 , which are all multiples of 8 . Find the total number of positive three-digit flexible numbers.
Clarifications:
1.A three-digit number must be a number with three digits and the first digit must not be 0 .
2.When 0 is inserted at the beginning of a number, the result will be the same as the original number.
3.If any one of the single-digit numbers ( 0 − 9 ) paired with a three-digit number yields the intended result, then the three-digit number is indeed flexible.
This is part of the set Fun With Problem-Solving .
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.
First, let the desired three-digit number be a b c .
And, let the single-digit number be p.
The possible outcomes are p a b c , a p b c , a b p c , a b c p .
Strategically, let us consider a b c p first
a b c p = 1 0 a b c + p
a b c is divisible by 8
⇒ a b c ≡ 0 ( m o d 8 )
⇒ a b c 0 ≡ 0 ( m o d 8 )
⇒ a b c p ≡ p ( m o d 8 )
Since a b c p is divisible by 8
⇒ a b c p ≡ 0 ( m o d 8 )
Therefore, ⇒ p ≡ 0 ( m o d 8 )
p = 0 or p = 8
a b c is divisible by 8
⇒ a b c is divisible by 4
⇒ b c is divisible by 4
In a p b c ,
a p b c is divisible by 8
p b c is divisible by 8
⇒ p b c ≡ 0 ( m o d 8 )
⇒ p ≡ 0 ( m o d 8 )
⇒ 1 0 0 p ≡ 0 ( m o d 8 )
⇒ 1 0 0 p + b c ≡ b c ( m o d 8 )
⇒ p b c ≡ b c ( m o d 8 )
⇒ b c ≡ 0 ( m o d 8 )
Therefore, b c is divisible by 8.
In a b p c
a b p c is divisible by 8
b p c is divisible by 8
b c ≡ 0 ( m o d 8 )
b 0 c = 1 0 0 b + c = ( 1 0 b + c ) + 9 0 b = b c + 9 0 b
b c ≡ 0 ( m o d 8 )
b 0 c ≡ 9 0 b ( m o d 8 ) ------(1)
p ≡ 0 ( m o d 8 )
1 0 p ≡ 0 ( m o d 8 ) -----------------------(2)
(1)+(2): b p c ≡ 9 0 b ( m o d 8 )
b p c ≡ 0 ( m o d 8 )
So, 9 0 b ≡ 0 ( m o d 8 )
9 0 b is divisible by 8
Let 9 0 b = 8 x , such that x is positive integer.
⇒ 4 5 b = 4 x
⇒ x = 4 4 5 b
x is a positive integer.
Hence, b is divisible by 4
b = 0 or b = 4 or b = 8
We have shown b c is divisible by 8
b c = 1 0 b + c
b ≡ 0 ( m o d 4 )
⇒ 2 b ≡ 0 ( m o d 8 )
⇒ 1 0 b ≡ 0 ( m o d 8 )
⇒ 1 0 b + c ≡ c ( m o d 8 )
b c is divisible by 8
⇒ 1 0 b + c ≡ 0 ( m o d 8 )
Therefore, c ≡ 0 ( m o d 8 )
c is divisible by 8
c = 0 or c = 8
Combining the results we have,
p = 0 or p = 8
b = 0 or b = 4 or b = 8
c = 0 or c = 8
a b c is divisible by 8
b c is divisible by 8
a b c = 1 0 0 a + b c
1 0 0 a is divisible by 8
1 0 0 ≡ 4 ( m o d 8 )
2 0 0 ≡ 8 ( m o d 8 )
2 0 0 ≡ 0 ( m o d 8 )
1 0 0 a = 2 0 0 , 4 0 0 , 6 0 0 , 8 0 0
a = 2 , 4 , 6 , 8
Finally, we have
a = 2 or a = 4 or a = 6 or a = 8
b = 0 or b = 4 or b = 8
c = 0 or c = 8
So, the number of possible values of a b c = 4 × 3 × 2 = 2 4
The total number of positive three-digit flexible numbers= 2 4
Problem Loading...
Note Loading...
Set Loading...
Let our three digit number be a b c . Then first of all it must be divisible by 8 so we have 1 0 0 a + 1 0 b + c ≡ 0 m o d 8 ⟹ 4 a + 2 b + c ≡ 0 m o d 8 . (1)
Then it must be that 8 a b c is divisible by 8, but 8 a b c ≡ 8 × 1 0 0 0 + a b c ≡ a b c m o d 8 so no new properties are obtained.
Then it must be that a 8 b c ≡ 0 m o d 8 so 1 0 0 0 × a + 1 0 b + c ≡ 0 m o d 8 ⟹ 2 b + c ≡ 0 m o d 8 . (2) .
Then it must be that a b 8 c ≡ 0 m o d 8 so 1 0 0 0 a + 1 0 0 b + c ≡ 0 m o d 8 ⟹ 4 b + c ≡ 0 m o d 8 . (3)
Finally it must be that a b c 8 ≡ 0 m o d 8 so 1 0 0 0 a + 1 0 0 b + 1 0 c ≡ 0 m o d 8 ⟹ 4 b + 2 c ≡ 0 m o d 8 (4)
Subtracting (2) from (1) we get 4 a ≡ 0 m o d 8 ⟹ a ≡ 0 m o d 2 .
Subtracting (2) from (3) we get 2 b ≡ 0 m o d 8 ⟹ b ≡ 0 m o d 4 .
Subtracting (3) from (4) we get c ≡ 0 m o d 8 .
Therefore any choice of: a ∈ { 2 , 4 , 6 , 8 } , b ∈ { 0 , 4 , 8 } , c ∈ { 0 , 8 } yields a flexible number. And there are 4 × 3 × 2 = 2 4 ways of picking.