An arithmetic sequence has integral entries. The sum of some 4 consecutive terms is 30. The sum of some 5 consecutive terms is 30. For at least how many terms do the two sub-sequences overlap?
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, observe that we can get three overlaps, if the arithmetic sequence includes 4 , 5 , 6 , 7 , 8 , 9 :
4 consecutive terms adding to 30: 5 consecutive terms adding to 30: … , 4 , 5 , 6, 7, 8 , 9 , … … , 4 , 5 , 6, 7, 8 , 9 , …
There also exists one with four overlaps, but we don't actually need it since we want the minimum number of overlaps:
4 consecutive terms adding to 30: 5 consecutive terms adding to 30: … , 0 , 3, 6, 9, 12 , … … , 0 , 3, 6, 9, 12 , …
We now have to show that it's impossible to have less overlaps. Without loss of generality, suppose that our sequence is increasing, otherwise just reverse it.
Since there are 5 consecutive terms adding to 3 0 , the middle term is 6 . Thus our sequence has the term 6 . The sequence cannot be constant, since if it is, everything must be 6 but then the sum of any 4 consecutive terms is 2 4 , not 3 0 . Thus the sequence has difference d ≥ 1 .
If the overlap is less than 3 terms, 6 cannot be included in the 4 consecutive terms (because it's in the middle of the 5 consecutive terms; any way you try, using the 6 requires you to also overlap at least three terms). Thus either all these 4 consecutive terms are earlier than the 6 (and thus less than it), or later than the 6 (and thus greater than it).
The first case is trivial. If all terms are less than 6 , their sum is less than 6 ⋅ 4 = 2 4 . This is impossible.
For the second case, observe that the terms are 6 + k d , 6 + ( k + 1 ) d , 6 + ( k + 2 ) d , 6 + ( k + 3 ) d for some k ≥ 1 , d ≥ 1 . Their sum is 2 4 + ( 4 k + 6 ) d . But we also have:
2 4 + ( 4 k + 6 ) d ≥ 2 4 + ( 4 ⋅ 1 + 6 ) ⋅ 1 = 3 4 > 3 0
Thus this case is also impossible. Thus it's impossible to have less than three overlaps. This gives our answer 3 .