AMC12 2023 B
AMC12 2023 B · Q16
AMC12 2023 B · Q16. It mainly tests Money / coins, Number theory misc.
In the state of Coinland, coins have values $6,10,$ and $15$ cents. Suppose $x$ is the value in cents of the most expensive item in Coinland that cannot be purchased using these coins with exact change. What is the sum of the digits of $x?$
在Coinland国,硬币的面值为$6$、$10$和$15$美分。设$x$是用这些硬币精确支付Coinland国最贵的无法购买的物品的价值(美分)。$x$的各位数字之和是多少?
(A)
8
8
(B)
10
10
(C)
7
7
(D)
11
11
(E)
9
9
Answer
Correct choice: (D)
正确答案:(D)
Solution
This problem asks to find largest $x$ that cannot be written as
\[6 a + 10 b + 15 c = x, \hspace{1cm} (1)\]
where $a, b, c \in \Bbb Z_+$.
Denote by $r \in \left\{ 0, 1 \right\}$ the remainder of $x$ divided by 2.
Modulo 2 on Equation (1), we get
By using modulus $m \in \left\{ 2, 3, 5 \right\}$ on the equation above, we get
$c \equiv r \pmod{2}$.
Following from the Chicken McNugget Theorem, we have that any number that is no less than $(3-1)(5-1) = 8$ can be expressed in the form of $3a + 5b$ with $a, b \in \Bbb Z_+$.
Therefore, all even numbers that are at least equal to $2 \cdot 8 + 15 \cdot 0 = 16$ can be written in the form of Equation (1) with $a, b, c \in \Bbb Z_+$.
All odd numbers that are at least equal to $2 \cdot 8 + 15 \cdot 1 = 31$ can be written in the form of Equation (1) with $a, b, c \in \Bbb Z_+$.
The above two cases jointly imply that all numbers that are at least 30 can be written in the form of Equation (1) with $a, b, c \in \Bbb Z_+$.
Next, we need to prove that 29 cannot be written in the form of Equation (1) with $a, b, c \in \Bbb Z_+$.
Because 29 is odd, we must have $c \equiv 1 \pmod{2}$.
Because $a, b, c \in \Bbb Z_+$, we must have $c = 1$.
Plugging this into Equation (1), we get $3 a + 5 b = 7$.
However, this equation does not have non-negative integer solutions.
All analysis above jointly imply that the largest $x$ that has no non-negative integer solution to Equation (1) is 29.
Therefore, the answer is $2 + 9 = \boxed{\textbf{(D) 11}}$.
本题要求找到最大的$x$,无法表示为
\[6 a + 10 b + 15 c = x, \hspace{1cm} (1)\]
其中$a, b, c \in \Bbb Z_+$。
设$r \in \left\{ 0, 1 \right\}$为$x$除以2的余数。
对方程(1)取模2,我们得到
通过使用模$m \in \left\{ 2, 3, 5 \right\}$对方程(1)取模,我们得到
$c \equiv r \pmod{2}$。
根据Chicken McNugget定理,任何不小于$(3-1)(5-1) = 8$的数都可以表示为$3a + 5b$的形式,其中$a, b \in \Bbb Z_+$。
因此,所有至少等于$2 \cdot 8 + 15 \cdot 0 = 16$的偶数都可以表示为方程(1)的形式,其中$a, b, c \in \Bbb Z_+$。
所有至少等于$2 \cdot 8 + 15 \cdot 1 = 31$的奇数都可以表示为方程(1)的形式,其中$a, b, c \in \Bbb Z_+$。
以上两情况共同表明,所有至少为30的数都可以表示为方程(1)的形式,其中$a, b, c \in \Bbb Z_+$。
接下来,需要证明29无法表示为方程(1)的形式,其中$a, b, c \in \Bbb Z_+$。
因为29是奇数,必须有$c \equiv 1 \pmod{2}$。
因为$a, b, c \in \Bbb Z_+$,必须有$c = 1$。
将此代入方程(1),得到$6 a + 10 b = 14$。
然而,此方程没有非负整数解。
以上所有分析共同表明,方程(1)没有非负整数解的最大$x$是29。
因此,答案是$2 + 9 = \boxed{\textbf{(D) 11}}$。
Topics
Related Questions
Practice full AMC exams on amcdrill.
Try full-length practice and diagnostics at www.amcdrill.com.