Problem:
Count the number of sequences a1,a2,a3,a4,a5 of integers such that ai≤1 for all i and all partial sums (a1,a1+a2,a1+a2+a3,…,a1+a2+a3+a4+a5) are non-negative.
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.