2016 AMC 12B Problem 24

Attempt Problem 24 of the 2016 AMC 12B below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2016 AMC 12B solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

24.

There are exactly 77,00077{,}000 ordered quadruples (a,b,c,d)(a,b,c,d) such that gcd(a,b,c,d)=77\gcd(a,b,c,d)=77 and lcm(a,b,c,d)=n.\text{lcm}(a,b,c,d)=n. What is the smallest possible value of n?n?

13,86013{,}860

20,79020{,}790

21,56021{,}560

27,72027{,}720

41,58041{,}580

Answer: D
Concepts:greatest common divisorleast common multipleprime factorization
Difficulty rating: 2550
Small Hint:

Divide everything by 77.77. With m=n77,m=\frac{n}{77}, you need reduced quadruples of gcd 11 and lcm m,m, analyzed one prime at a time

Big Hint:

For a prime with maximum exponent M,M, the count of exponent quadruples is 2(6M2+1).2(6M^2+1). Use the factorization of 7700077000 to determine how many primes divide mm and which values of MM can occur

Solution:

Writing each entry as 7777 times a reduced value, we need gcd=1\gcd=1 and lcm=m=n77.\text{lcm}=m=\frac{n}{77}. For each prime pp dividing mm with maximum exponent M,M, the number of valid exponent quadruples is (M+1)42M4(M+1)^4-2M^4 +(M1)4+(M-1)^4 =2(6M2+1).=2(6M^2+1). The total over all primes must equal 77,000=2353711.77{,}000=2^3\cdot5^3\cdot7\cdot11. Since 2(6M2+1)2(6M^2+1) equals 14,14, 50,50, and 110110 for M=1,2,3,M=1,2,3, and 1450110=77,000,14\cdot50\cdot110=77{,}000, the exponents 1,2,31,2,3 give one candidate factorization.

Every prime contributes exactly one factor of 2,2, so exactly three primes divide m.m. Their odd factors 6M2+16M^2+1 must divide 77,00023=9625.\frac{77{,}000}{2^3}=9625. Checking the divisors gives M=1,2,3,8,M=1,2,3,8, with odd factors 7,25,55,385.7,25,55,385. The choice M=8M=8 leaves only 2525 for the product of the other two odd factors, but each is at least 7,7, so this is impossible. Therefore the maximum exponents are exactly 1,2,3.1,2,3. To minimize m=n77,m=\frac{n}{77}, assign the largest exponent to the smallest prime: m=23325=360,m=2^3\cdot3^2\cdot5=360, so n=77360=27,720.n=77\cdot360=27{,}720.

Thus, the correct answer is D.

Problem 23#23
Full Exam

Problem 24 in Other Years

1950 AMC 12 · 1951 AMC 12 · 1952 AMC 12 · 1953 AMC 12 · 1954 AMC 12 · 1955 AMC 12 · 1956 AMC 12 · 1957 AMC 12 · 1958 AMC 12 · 1959 AMC 12 · 1960 AMC 12 · 1961 AMC 12 · 1962 AMC 12 · 1963 AMC 12 · 1964 AMC 12 · 1965 AMC 12 · 1966 AMC 12 · 1967 AMC 12 · 1968 AMC 12 · 1969 AMC 12 · 1970 AMC 12 · 1971 AMC 12 · 1972 AMC 12 · 1973 AMC 12 · 1974 AMC 12 · 1975 AMC 12 · 1976 AMC 12 · 1977 AMC 12 · 1978 AMC 12 · 1979 AMC 12 · 1980 AMC 12 · 1981 AMC 12 · 1982 AMC 12 · 1983 AMC 12 · 1984 AMC 12 · 1985 AMC 12 · 1986 AMC 12 · 1987 AMC 12 · 1988 AMC 12 · 1989 AMC 12 · 1990 AMC 12 · 1991 AMC 12 · 1992 AMC 12 · 1993 AMC 12 · 1994 AMC 12 · 1995 AMC 12 · 1996 AMC 12 · 1997 AMC 12 · 1998 AMC 12 · 1999 AMC 12 · 2000 AMC 12 · 2001 AMC 12 · 2002 AMC 12A · 2002 AMC 12B · 2003 AMC 12A · 2003 AMC 12B · 2004 AMC 12A · 2004 AMC 12B · 2005 AMC 12A · 2005 AMC 12B · 2006 AMC 12A · 2006 AMC 12B · 2007 AMC 12A · 2007 AMC 12B · 2008 AMC 12A · 2008 AMC 12B · 2009 AMC 12A · 2009 AMC 12B · 2010 AMC 12A · 2010 AMC 12B · 2011 AMC 12A · 2011 AMC 12B · 2012 AMC 12A · 2012 AMC 12B · 2013 AMC 12A · 2013 AMC 12B · 2014 AMC 12A · 2014 AMC 12B · 2015 AMC 12A · 2015 AMC 12B · 2016 AMC 12A · 2017 AMC 12A · 2017 AMC 12B · 2018 AMC 12A · 2018 AMC 12B · 2019 AMC 12A · 2019 AMC 12B · 2020 AMC 12A · 2020 AMC 12B · 2021 AMC 12A Spring · 2021 AMC 12B Spring · 2021 AMC 12A Fall · 2021 AMC 12B Fall · 2022 AMC 12A · 2022 AMC 12B · 2023 AMC 12A · 2023 AMC 12B · 2024 AMC 12A · 2024 AMC 12B · 2025 AMC 12A · 2025 AMC 12B