# 1977 IMO Problems/Problem 2

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

## Problem

In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.

## Solution

Let $x_1,x_2,\ldots$ be the given sequence and let $s_n=x_1+x_2+\ldots+x_n$. The conditions from the hypothesis can be now written as $s_{n+7} and $s_{n+11}>s_n$ for all $n\ge 1$. We then have: $0 a contradiction. Therefore, the sequence cannot have $17$ terms. In order to show that $16$ is the answer, just take 16 real numbers satisfying $s_{10}. We have $x_1=s_1$ and $x_n=s_n-s_{n-1}$ for $n\ge 2$. Thus we found all sequences with the given properties.

The above solution was posted and copyrighted by enescu. The original thread for this problem can be found here: [1]
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 12, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}