Consider a sequence of integers, where the term is given by What is largest integer that is a divisor of all numbers in this sequence?
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.
The number should be odd since there are nunbers in the sequence that are not even. Evaluate a 1 = 2 ⋅ 4 ⋅ 6 ⋅ 8 ⋅ 1 0 = 2 8 ⋅ 1 5 . Im going to prove that in any term of the sequence there will appear the factors 3 and 5 . The final digits can be one of these: in some order: 1 , 3 , 5 , 7 , 9 or 2 , 4 , 6 . 8 , 0 . Obviously the ones enting with 5 and 0 are divisible by 5 . But what about three? We can subtitute some n of the forms 3 x 3 x + 1 or 3 x + 2 . For the first case the second term would give 3 x + 3 . The second case, the third term gives 3 x + 6 . For the third case, the fifth term gives 3 x + 9 . Therefore there will always appear the factors 3 and 5 and thus all the terms will be divisible by the answer: 1 5 .