True or False?
All integers which are in the form 1 2 0 0 8 , 1 2 0 3 0 8 , 1 2 0 3 3 0 8 , 1 2 0 3 3 3 0 8 , … , 1 2 0 n number of 3’s 3 3 3 3 3 3 3 … 3 0 8 , … are divisible by 19.
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.
We have:
1
2
0
n
number of 3’s
3
3
3
3
3
3
…
3
0
8
=
1
2
⋅
1
0
n
+
3
+
3
1
0
n
+
2
−
1
−
2
5
=
3
(
3
6
0
+
1
)
⋅
1
0
n
+
2
−
(
1
+
7
5
)
=
3
1
9
⋅
(
1
9
⋅
1
0
n
+
2
−
4
)
is divisible by
1
9
.
how did you get from step two to step three?
I followed the algebraic manipulations from step 2 to step 3, but yes, a couple of extra steps displayed would definitely be helpful.
After dividing 120 by 19 the remainder is 6.
63 when divided by 19 again the remainder is 6.
the remainder will continue to be 6 as long as 3 is the next digit in the number.
when we are done with 3s, we are left with 08 and 608 is divisible by 19.
So irrespective of number of threes the number is always divisible by 19.
We note that the only difference between successive numbers is the number, n, of 3's between 120 and 08. To shift the first 3 digits to the left, we merely subtract 8 and multiply the number by 10. To construct the next term, we add 308. For a number with n 3's, this procedure generates the next number in the sequence, with n+1 3's. It is trivial to demonstrate that 12008 is divisible by 19, so multiplication by 10 yields a number that is also divisible by 19. Subtracting 8, multiplying by 10 and adding 308 is equal to adding 228 to 10 times the original number, 12008. It is also clear that 228 is divisible by 19. So the next number is also divisible by 19. In general, 10 times a number divisible by 19 plus another number divisible by 19 yields a number also divisible by 19. Any number constructed this way is divisible by 19, and starting with the base number 12008 also satisfies the description of the form specified in the problem. Therefore, the answer is TRUE.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Proof of Mathematical Induction
The crucial observation is that any two successive terms have a difference of the form 1 0 8 3 n number of 0’s 0 0 0 0 … 0 , which is divisible by 1 9 .
Therefore, let the terms in the series be expressed as a n = a n − 1 + 1 0 8 3 × 1 0 n , n ⩾ 2 , with a 1 = 1 2 0 0 8 . We need to prove that a n is divisible by 1 9 for all n ∈ N .
Proof by induction is used:
Initial Step:
For n = 1 :
a 1 = 1 2 0 0 8 = 1 9 × 6 3 2 .
∴ The statement is true for n = 1 .
Inductive Step:
Assume the statement is true for some n = k , n ∈ N , i.e. a k is divisible by 1 9 .
Then, for n = k + 1 :
a k + 1 = a k + 1 0 8 3 × 1 0 k + 1 .
Since 1 0 8 3 = 5 7 × 1 9 , 1 0 8 3 is divisible by 1 9 , therefore 1 0 8 3 × 1 0 k + 1 is divisible by 1 9 ; Also since a k is divisible by 1 9 , we can conclude that a k + 1 is divisible by 1 9 .
∴ We have proven that if the statement is true for some n = k , then it is also true for n = k + 1 .
Thus, by the Principle of Mathematical Induction, the statement is true for all n ∈ N . QED