

(2 intermediate revisions by one other user not shown) 
Line 1: 
Line 1: 
−  ==Problem==
 +  #REDIRECT[[2019_AMC_10B_Problems/Problem_7]] 
−  Exact change to buy 12 red candy, 14 green candy, 15 blue candy, or n purple candy. Purple candy cost 20 cents, what is the minimum number of n?
 
−   
−  ==Solution==
 
−  We simply need to find a value of 20*n that divides 12, 14, and 15. 20*18 divides 12 and 15, but not 14. 20*21 successfully divides 12, 14 and 15, meaning that we have exact change (in this case, 420 cents) to buy each type of candy, so the minimum value of <math>\boxed{n = 21}</math>.
 
−   
−  ==Solution 2==
 
−  This problem is equivalent to finding the LCM of 12, 14, 15, and 20 (and then dividing it by 20). It is easy to see that the prime factorization of said LCM must be <math>7 \cdot 3 \cdot 5 \cdot 2^2</math>. We can divide by 20 now, before we ever multiply it out, leaving us with <math>7 \cdot 3 = 21 = \boxed{D}</math>
 
−   
−   Robin's Solution
 
−   
−  ==See Also==
 
−  {{AMC12 boxyear=2019ab=Bnumb=4numa=6}}
 
−  {{MAA Notice}}
 