Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2000 AMC 10 Problems/Problem 20"

(→‎Solution)
(→‎Video Solution)
 
(21 intermediate revisions by 12 users not shown)
Line 3: Line 3:
 
Let <math>A</math>, <math>M</math>, and <math>C</math> be nonnegative integers such that <math>A+M+C=10</math>.  What is the maximum value of <math>A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A</math>?
 
Let <math>A</math>, <math>M</math>, and <math>C</math> be nonnegative integers such that <math>A+M+C=10</math>.  What is the maximum value of <math>A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A</math>?
  
−
<math>\mathrm{(A)}\ 49 \qquad\mathrm{(B)}\ 59 \qquad\mathrm{(C)}\ 69 \qquad\mathrm{(D)}\ 79 \qquad\mathrm{(E)}\ 89</math>
+
<math>\textbf{(A)}\ 49 \qquad\textbf{(B)}\ 59 \qquad\textbf{(C)}\ 69 \qquad\textbf{(D)}\ 79 \qquad\textbf{(E)}\ 89</math>
  
−
==Solution==
+
==Solution 1==
  
 
The trick is to realize that the sum <math>AMC+AM+MC+CA</math> is similar to the product <math>(A+1)(M+1)(C+1)</math>. If we multiply <math>(A+1)(M+1)(C+1)</math>, we get <cmath>(A+1)(M+1)(C+1) = AMC + AM + AC + MC + A + M + C + 1.</cmath> We know that <math>A+M+C=10</math>, therefore <math>(A+1)(M+1)(C+1) = (AMC + AM + MC + CA) + 11</math> and <cmath>AMC + AM + MC + CA = (A+1)(M+1)(C+1) - 11.</cmath> Now consider the maximal value of this expression. Suppose that some two of <math>A</math>, <math>M</math>, and <math>C</math> differ by at least <math>2</math>.  Then this triple <math>(A,M,C)</math> is not optimal. (To see this, WLOG let <math>A\geq C+2.</math> We can then increase the value of <math>(A+1)(M+1)(C+1)</math> by changing <math>A \to A-1</math> and <math>C \to C+1</math>.)
 
The trick is to realize that the sum <math>AMC+AM+MC+CA</math> is similar to the product <math>(A+1)(M+1)(C+1)</math>. If we multiply <math>(A+1)(M+1)(C+1)</math>, we get <cmath>(A+1)(M+1)(C+1) = AMC + AM + AC + MC + A + M + C + 1.</cmath> We know that <math>A+M+C=10</math>, therefore <math>(A+1)(M+1)(C+1) = (AMC + AM + MC + CA) + 11</math> and <cmath>AMC + AM + MC + CA = (A+1)(M+1)(C+1) - 11.</cmath> Now consider the maximal value of this expression. Suppose that some two of <math>A</math>, <math>M</math>, and <math>C</math> differ by at least <math>2</math>.  Then this triple <math>(A,M,C)</math> is not optimal. (To see this, WLOG let <math>A\geq C+2.</math> We can then increase the value of <math>(A+1)(M+1)(C+1)</math> by changing <math>A \to A-1</math> and <math>C \to C+1</math>.)
  
 
Therefore the maximum is achieved when <math>(A,M,C)</math> is a rotation of <math>(3,3,4)</math>. The value of <math>(A+1)(M+1)(C+1)</math> in this case is <math>4\cdot 4\cdot 5=80,</math> and thus the maximum of <math>AMC + AM + MC + CA</math> is <math>80-11 = \boxed{\textbf{(C)}\ 69}.</math>
 
Therefore the maximum is achieved when <math>(A,M,C)</math> is a rotation of <math>(3,3,4)</math>. The value of <math>(A+1)(M+1)(C+1)</math> in this case is <math>4\cdot 4\cdot 5=80,</math> and thus the maximum of <math>AMC + AM + MC + CA</math> is <math>80-11 = \boxed{\textbf{(C)}\ 69}.</math>
 +
 +
==Solution 2 ==
 +
Notice that if we want to maximize <math>AMC + AM + MC + AC</math>, we want A, M, and C to be as close as possible. For example, if <math>A = 7, B = 2,</math> and <math>C=1,</math> then the expression would have a much smaller value than if we were to substitute <math>A = 4, B = 5</math>, and <math>C = 1</math>. So to make A, B, and C as close together as possible, we divide <math>\frac{10}{3}</math> to get <math>3</math>. Therefore, A must be 3, M must be 3, and C must be 4.  <math>AMC + AM + MC + AC = 36 + 12 + 12 + 9 = 69</math>. So the answer is <math>\boxed{\textbf{(C)}\ 69.}</math>
 +
 +
==Solution 3 ==
 +
According to our knowledge in AM-GM, the closer numbers are, the value of their product is bigger. Assume that <math>A=B<C</math>, we can get the set <math>A=3,B=3,C=4</math> which the answer is <math>\boxed{\textbf{(C)}\ 69.}</math>
 +
~bluesoul
 +
 +
==Video Solution==
 +
https://www.youtube.com/watch?v=Vdou0LpTlzY&t=22s
 +
 +
https://www.youtube.com/watch?v=ECzZPuuQMbE    ~David
  
 
==See Also==
 
==See Also==
Line 15: Line 27:
 
{{AMC10 box|year=2000|num-b=19|num-a=21}}
 
{{AMC10 box|year=2000|num-b=19|num-a=21}}
 
{{MAA Notice}}
 
{{MAA Notice}}
 +
 +
[[Category:Introductory Algebra Problems]]

Latest revision as of 17:12, 22 April 2023

Problem

Let $A$, $M$, and $C$ be nonnegative integers such that $A+M+C=10$. What is the maximum value of $A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A$?

$\textbf{(A)}\ 49 \qquad\textbf{(B)}\ 59 \qquad\textbf{(C)}\ 69 \qquad\textbf{(D)}\ 79 \qquad\textbf{(E)}\ 89$

Solution 1

The trick is to realize that the sum $AMC+AM+MC+CA$ is similar to the product $(A+1)(M+1)(C+1)$. If we multiply $(A+1)(M+1)(C+1)$, we get \[(A+1)(M+1)(C+1) = AMC + AM + AC + MC + A + M + C + 1.\] We know that $A+M+C=10$, therefore $(A+1)(M+1)(C+1) = (AMC + AM + MC + CA) + 11$ and \[AMC + AM + MC + CA = (A+1)(M+1)(C+1) - 11.\] Now consider the maximal value of this expression. Suppose that some two of $A$, $M$, and $C$ differ by at least $2$. Then this triple $(A,M,C)$ is not optimal. (To see this, WLOG let $A\geq C+2.$ We can then increase the value of $(A+1)(M+1)(C+1)$ by changing $A \to A-1$ and $C \to C+1$.)

Therefore the maximum is achieved when $(A,M,C)$ is a rotation of $(3,3,4)$. The value of $(A+1)(M+1)(C+1)$ in this case is $4\cdot 4\cdot 5=80,$ and thus the maximum of $AMC + AM + MC + CA$ is $80-11 = \boxed{\textbf{(C)}\ 69}.$

Solution 2

Notice that if we want to maximize $AMC + AM + MC + AC$, we want A, M, and C to be as close as possible. For example, if $A = 7, B = 2,$ and $C=1,$ then the expression would have a much smaller value than if we were to substitute $A = 4, B = 5$, and $C = 1$. So to make A, B, and C as close together as possible, we divide $\frac{10}{3}$ to get $3$. Therefore, A must be 3, M must be 3, and C must be 4. $AMC + AM + MC + AC = 36 + 12 + 12 + 9 = 69$. So the answer is $\boxed{\textbf{(C)}\ 69.}$

Solution 3

According to our knowledge in AM-GM, the closer numbers are, the value of their product is bigger. Assume that $A=B<C$, we can get the set $A=3,B=3,C=4$ which the answer is $\boxed{\textbf{(C)}\ 69.}$ ~bluesoul

Video Solution

https://www.youtube.com/watch?v=Vdou0LpTlzY&t=22s

https://www.youtube.com/watch?v=ECzZPuuQMbE ~David

See Also

2000 AMC 10 (Problems • Answer Key • Resources)
Preceded by
Problem 19 		Followed by
Problem 21
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2000_AMC_10_Problems/Problem_20&oldid=192402"