Skip to main content

2021/22 AHSMC Part 1 Problem 11

Problem 11 of 16

Shelley is shelling peas. Each pea pod contains either 99 or 1010 peas. Shelley knows how many peas she has, but she forgot how many pods they came from, and cannot figure it out, even though she is very good at math. What is the smallest number of peas Shelley might have?

Answer choices

Show solution

Solution

First note that if Shelley had 9090 peas, then they may have come from 1010 pods of 99 peas each, or from 99 pods of 1010 peas each, so she cannot tell how many pods of each type she had opened. We now show that 9090 is the answer to the problem. Let mm be the number of pods with 99 peas and nn the number of pods with 1010 peas. The problem is equivalent to finding the smallest positive integer kk for which the equation 9m+10n=k9m + 10n = k has at least two solutions in non-negative integers mm and nn. Suppose that (m1,n1)(m_1, n_1) and (m2,n2)(m_2, n_2) are two distinct solutions of this equation. So 9m1+10n1=9m2+10n29m_1 + 10n_1 = 9m_2 + 10n_2, or 9(m1−m2)=10(n2−n1)9(m_1 - m_2) = 10(n_2 - n_1), where we can assume that m1>m2m_1 > m_2 and n2>n1n_2 > n_1. Then 1010 must divide into m1−m2>0m_1 - m_2 > 0, so m1−m2m_1 - m_2 must be at least 1010. So m1≥10m_1 \ge 10, but this means that the total number k=9m1+10n1k = 9m_1 + 10n_1 of peas is at least 9×10=909 \times 10 = 90. The answer is (E).

Alternative Solution: Let mm be the number of pods with 99 peas and nn the number of pods with 1010 peas. The problem is equivalent to finding the smallest positive integer kk for which the equation 9m+10n=k 9m + 10n = k has at least two solutions in the set of non-negative integers.

Notice that if (m1,n1)(m_1, n_1), (m2,n2)(m_2, n_2) are two distinct integer solutions of this equation then 9(m2−m1)+10(n2−n1)=0  ⟹  9(m2−m1)=10(n1−n2)=90s 9(m_2 - m_1) + 10(n_2 - n_1) = 0 \implies 9(m_2 - m_1) = 10(n_1 - n_2) = 90s where ss is an integer, and hence m2=m1+10s,n2=n1−9s. m_2 = m_1 + 10s, \qquad n_2 = n_1 - 9s. The pair (−k,k)(-k, k) is an integer solution of the equation, so any integral solution of the equation is of the form (m,n)=(−k+10s, k−9s), (m, n) = (-k + 10s,\ k - 9s), where ss is an arbitrary integer. We have m≥0, n≥0  ⟺  −k+10s≥0, k−9s≥0  ⟺  k10≤s≤k9. m \ge 0,\ n \ge 0 \iff -k + 10s \ge 0,\ k - 9s \ge 0 \iff \frac{k}{10} \le s \le \frac{k}{9}. A necessary condition for which the equation has at least two solutions in the set of non-negative integers is k9−k10≥1  ⟺  k≥90. \frac{k}{9} - \frac{k}{10} \ge 1 \iff k \ge 90. Notice that for k=90k = 90 we have s=9s = 9, s=10s = 10 and the solutions are (0,9)(0, 9) and (10,0)(10, 0). The answer is (E).