Maths Olympiad Prep

Track / Stage 4 / 63 of 340 #803 of 2444

Problem 803

AMC 12 late, AIME early
Combinatorics Difficulty 4.4 Find the answer United States competition problems · United States

Count the number of sequences a1,a2,a3,a4,a5a_{1}, a_{2}, a_{3}, a_{4}, a_{5} of integers such that ai1a_{i} \leq 1 for all ii and all partial sums (a1,a1+a2,a1+a2+a3,,a1+a2+a3+a4+a5)\left(a_{1}, a_{1}+a_{2}, a_{1}+a_{2}+a_{3}, \ldots, a_{1}+a_{2}+a_{3}+a_{4}+a_{5}\right) are non-negative.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Next problem →

Official solution

Solution:

C(C( length +1)=C(6)=132+1 ) = C(6) = 132.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.