2010 AMC 10B Problem 3
Below is the professionally curated solution for Problem 3 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: 720
3.
A drawer contains red, green, blue, and white socks with at least of each color. What is the minimum number of socks that must be pulled from the drawer to guarantee a matching pair?
Solution:
To maximize the number of socks, we want to grab as many single socks as possible before getting a pair.
There are colors, which means that we can draw one sock of each color before drawing a pair.
This means that it takes at least socks to be drawn before a pair is guaranteed.
Thus, C is the correct answer.
Problem 3 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