Maths Olympiad Prep

Library / /25 of 71

Combinatorics Difficulty 5.0 AIME Prove it United States

Problem:

Determine the number of 8-tuples of nonnegative integers (a1,a2,a3,a4,b1,b2,b3,b4)\left(a_{1}, a_{2}, a_{3}, a_{4}, b_{1}, b_{2}, b_{3}, b_{4}\right) satisfying 0akk0 \leq a_{k} \leq k, for each k=1,2,3,4k=1,2,3,4, and
a1+a2+a3+a4+2b1+3b2+4b3+5b4=19. a_{1} + a_{2} + a_{3} + a_{4} + 2 b_{1} + 3 b_{2} + 4 b_{3} + 5 b_{4} = 19.

Solution

Answer: 1540 Same as Combinatorics Test problem 10.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.