2010 AMC 10B Problem 22
Below is the professionally curated solution for Problem 22 of the 2010 AMC 10B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2010 AMC 10B solutions, or check the answer key.
All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).
Difficulty rating: 1790
22.
Seven distinct pieces of candy are to be distributed among three bags. The red bag and the blue bag must each receive at least one piece of candy; the white bag may remain empty. How many arrangements are possible?
Solution:
We can count this with complementary counting. The total number of ways to distribute the candies with no restrictions is
To find the number of invalid arrangements, we have to count the number of ways where either the red or blue bag is empty.
For the case where the red bag is empty, each candy has options for the bag that goes into. There are then arrangements for this case. Similarly, there are arrangements for the case where the blue bag is empty.
There is an overlap of one case where both bags are empty. The final answer is then
Thus, C is the correct answer.
Problem 22 in Other Years
2000 AMC 10 · 2001 AMC 10 · 2002 AMC 10A · 2002 AMC 10B · 2003 AMC 10A · 2003 AMC 10B · 2004 AMC 10A · 2004 AMC 10B · 2005 AMC 10A · 2005 AMC 10B · 2006 AMC 10A · 2006 AMC 10B · 2007 AMC 10A · 2007 AMC 10B · 2008 AMC 10A · 2008 AMC 10B · 2009 AMC 10A · 2009 AMC 10B · 2010 AMC 10A · 2011 AMC 10A · 2011 AMC 10B · 2012 AMC 10A · 2012 AMC 10B · 2013 AMC 10A · 2013 AMC 10B · 2014 AMC 10A · 2014 AMC 10B · 2015 AMC 10A · 2015 AMC 10B · 2016 AMC 10A · 2016 AMC 10B · 2017 AMC 10A · 2017 AMC 10B · 2018 AMC 10A · 2018 AMC 10B · 2019 AMC 10A · 2019 AMC 10B · 2020 AMC 10A · 2020 AMC 10B · 2021 AMC 10A Spring · 2021 AMC 10B Spring · 2021 AMC 10A Fall · 2021 AMC 10B Fall · 2022 AMC 10A · 2022 AMC 10B · 2023 AMC 10A · 2023 AMC 10B · 2024 AMC 10A · 2024 AMC 10B · 2025 AMC 10A · 2025 AMC 10B