Maths Olympiad Prep

Library / /259 of 1394

Combinatorics Difficulty 4.9 AIME Find the answer

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\left(a_{1}, a_{1}+a_{2}\right., etc.) are non-negative.

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

Solution

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

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.