Library / /165 of 175

, 2022

Combinatorics Difficulty 3.0 AMC 10/12 Find the answer United Kingdom

Two lists of numbers are as shown below. List S: 3 5 8 11 13 14. List T: 2 5 6 10 12 13. Jenny decided she would move one number from List S to List T and one number from List T to List S so that the sum of the numbers in the new List S is equal to the sum of the numbers in the new List T. In how many ways could she do this?

(A) $1$ (B) $2$ (C) $3$ (D) $4$ (E) $5$

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

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; past papers published free at ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.