Difference between revisions of "2022 AIME I Problems/Problem 6"

Line 2: Line 2:
 
Find the number of ordered pairs of integers <math>(a, b)</math> such that the sequence<cmath>3, 4, 5, a, b, 30, 40, 50</cmath>is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression.
 
Find the number of ordered pairs of integers <math>(a, b)</math> such that the sequence<cmath>3, 4, 5, a, b, 30, 40, 50</cmath>is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression.
  
== Solution ==
+
== Solution 1==
 
Since <math>3,4,5,a</math> and <math>3,4,5,b</math> cannot be an arithmetic progression, <math>a</math> or <math>b</math> can never be <math>6</math>. Since <math>b, 30, 40, 50</math> and <math>a, 30, 40, 50</math> cannot be an arithmetic progression, <math>b</math> can never be <math>20</math>. Since <math>a < b</math>, there are <math>{24 - 2 \choose 2} = 231</math> ways to choose <math>a</math> and <math>b</math> with these two restrictions in mind.
 
Since <math>3,4,5,a</math> and <math>3,4,5,b</math> cannot be an arithmetic progression, <math>a</math> or <math>b</math> can never be <math>6</math>. Since <math>b, 30, 40, 50</math> and <math>a, 30, 40, 50</math> cannot be an arithmetic progression, <math>b</math> can never be <math>20</math>. Since <math>a < b</math>, there are <math>{24 - 2 \choose 2} = 231</math> ways to choose <math>a</math> and <math>b</math> with these two restrictions in mind.
  
Line 22: Line 22:
  
 
~ ihatemath123
 
~ ihatemath123
 +
 +
==Solution 2==
 +
Denote <math>S = \left\{ (a, b) : 6 \leq a < b \leq 29 \right\}</math>.
 +
 +
Denote by <math>A</math> a subset of <math>S</math>, such that there exists an arithmetic sequence that has 4 terms and includes <math>a</math> but not <math>b</math>.
 +
 +
Denote by <math>B</math> a subset of <math>S</math>, such that there exists an arithmetic sequence that has 4 terms and includes <math>b</math> but not <math>a</math>.
 +
 +
Hence, <math>C</math> is a subset of <math>S</math>, such that there exists an arithmetic sequence that has 4 terms and includes both <math>a</math> and <math>b</math>.
 +
 +
Hence, this problem asks us to compute
 +
\[
 +
| S | - \left( | A | + | B | + | C | \right) .
 +
\]
 +
 +
First, we compute <math>| S |</math>.
 +
 +
We have <math>| S | = \binom{29 - 6 + 1}{2} = \binom{24}{2} = 276</math>.
 +
 +
Second, we compute <math>| A |</math>.
 +
 +
\textbf{Case 1}: <math>a = 6</math>.
 +
 +
We have <math>b = 8 , \cdots , 19, 21, 22, \cdots, 29</math>.
 +
Thus, the number of solutions is 21.
 +
 +
\textbf{Case 2}: <math>a = 20</math>.
 +
 +
We have <math>b = 21, 22, \cdots , 29</math>.
 +
Thus, the number of solutions is 9.
 +
 +
Thus, <math>| A | = 21 + 9 = 30</math>.
 +
 +
Third, we compute <math>| B |</math>.
 +
 +
In <math>B</math>, we have <math>b = 6, 20</math>. However, because <math>6 \leq a < b</math>, we have <math>b \geq 7</math>.
 +
Thus, <math>b = 20</math>.
 +
 +
This implies <math>a = 7, 8, 9, 11, 12, \cdots , 19</math>.
 +
Thus, <math>| B | = 12</math>.
 +
 +
Fourth, we compute <math>| C |</math>.
 +
 +
\textbf{Case 1}: In the arithmetic sequence, the two numbers beyond <math>a</math> and <math>b</math> are on the same side of <math>a</math> and <math>b</math>.
 +
 +
Hence, <math>(a, b) = (6 , 7), (7, 9) , (10, 20)</math>.
 +
Therefore, the number solutions in this case is 3.
 +
 +
\textbf{Case 2}: In the arithmetic sequence, the two numbers beyond <math>a</math> and <math>b</math> are on the opposite sides of <math>a</math> and <math>b</math>.
 +
 +
\textbf{Case 2.1}: The arithmetic sequence is <math>3, a, b, 30</math>.
 +
 +
Hence, <math>(a, b) = (12, 21)</math>.
 +
 +
\textbf{Case 2.2}: The arithmetic sequence is <math>4, a, b, 40</math>.
 +
 +
Hence, <math>(a, b) = (16, 28)</math>.
 +
 +
\textbf{Case 2.3}: The arithmetic sequence is <math>5, a, b, 50</math>.
 +
 +
Hence, <math>(a, b) = (20, 35)</math>.
 +
 +
Putting two cases together, <math>| C | = 6</math>.
 +
 +
Therefore,
 +
\begin{align*}
 +
| S | - \left( | A | + | B | + | C | \right)
 +
& = 276 - \left( 30 + 12 + 6 \right) \\
 +
& = \boxed{\textbf{(228) }} .
 +
\end{align*}
 +
 +
~Steven Chen (www.professorchenedu.com)
  
 
==See Also==
 
==See Also==
 
{{AIME box|year=2022|n=I|num-b=5|num-a=7}}
 
{{AIME box|year=2022|n=I|num-b=5|num-a=7}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 22:34, 17 February 2022

Problem

Find the number of ordered pairs of integers $(a, b)$ such that the sequence\[3, 4, 5, a, b, 30, 40, 50\]is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression.

Solution 1

Since $3,4,5,a$ and $3,4,5,b$ cannot be an arithmetic progression, $a$ or $b$ can never be $6$. Since $b, 30, 40, 50$ and $a, 30, 40, 50$ cannot be an arithmetic progression, $b$ can never be $20$. Since $a < b$, there are ${24 - 2 \choose 2} = 231$ ways to choose $a$ and $b$ with these two restrictions in mind.

However, there are still specific invalid cases counted in these $231$ pairs $(a,b)$. Since \[3,5,a,b\] cannot form an arithmetic progression, $\underline{(a,b) \neq (7,9)}$. \[a,b,30,50\] cannot be an arithmetic progression, so $(a,b) \neq (-10,10)$; however, since this pair was not counted in our $231$, we do not need to subtract it off. \[3,a,b,30\] cannot form an arithmetic progression, so $\underline{(a,b) \neq (12,21)}$. \[4, a, b, 40\] cannot form an arithmetic progression, so $\underline{(a,b) \neq (16,28)}$. \[5, a,b, 50\] cannot form an arithmetic progression, $(a,b) \neq 20, 35$; however, since this pair was not counted in our $231$ (since we disallowed $a$ or $b$ to be $20$), we do not to subtract it off.

Also, the sequences $(3,a,b,40)$, $(3,a,b,50)$, $(4,a,b,30)$, $(4,a,b,50)$, $(5,a,b,30)$ and $(5,a,b,40)$ will never be arithmetic, since that would require $a$ and $b$ to be non-integers.

So, we need to subtract off $3$ progressions from the $231$ we counted, to get our final answer of $\boxed{228}$.

~ ihatemath123

Solution 2

Denote $S = \left\{ (a, b) : 6 \leq a < b \leq 29 \right\}$.

Denote by $A$ a subset of $S$, such that there exists an arithmetic sequence that has 4 terms and includes $a$ but not $b$.

Denote by $B$ a subset of $S$, such that there exists an arithmetic sequence that has 4 terms and includes $b$ but not $a$.

Hence, $C$ is a subset of $S$, such that there exists an arithmetic sequence that has 4 terms and includes both $a$ and $b$.

Hence, this problem asks us to compute \[ | S | - \left( | A | + | B | + | C | \right) . \]

First, we compute $| S |$.

We have $| S | = \binom{29 - 6 + 1}{2} = \binom{24}{2} = 276$.

Second, we compute $| A |$.

\textbf{Case 1}: $a = 6$.

We have $b = 8 , \cdots , 19, 21, 22, \cdots, 29$. Thus, the number of solutions is 21.

\textbf{Case 2}: $a = 20$.

We have $b = 21, 22, \cdots , 29$. Thus, the number of solutions is 9.

Thus, $| A | = 21 + 9 = 30$.

Third, we compute $| B |$.

In $B$, we have $b = 6, 20$. However, because $6 \leq a < b$, we have $b \geq 7$. Thus, $b = 20$.

This implies $a = 7, 8, 9, 11, 12, \cdots , 19$. Thus, $| B | = 12$.

Fourth, we compute $| C |$.

\textbf{Case 1}: In the arithmetic sequence, the two numbers beyond $a$ and $b$ are on the same side of $a$ and $b$.

Hence, $(a, b) = (6 , 7), (7, 9) , (10, 20)$. Therefore, the number solutions in this case is 3.

\textbf{Case 2}: In the arithmetic sequence, the two numbers beyond $a$ and $b$ are on the opposite sides of $a$ and $b$.

\textbf{Case 2.1}: The arithmetic sequence is $3, a, b, 30$.

Hence, $(a, b) = (12, 21)$.

\textbf{Case 2.2}: The arithmetic sequence is $4, a, b, 40$.

Hence, $(a, b) = (16, 28)$.

\textbf{Case 2.3}: The arithmetic sequence is $5, a, b, 50$.

Hence, $(a, b) = (20, 35)$.

Putting two cases together, $| C | = 6$.

Therefore, \begin{align*} | S | - \left( | A | + | B | + | C | \right) & = 276 - \left( 30 + 12 + 6 \right) \\ & = \boxed{\textbf{(228) }} . \end{align*}

~Steven Chen (www.professorchenedu.com)

See Also

2022 AIME I (ProblemsAnswer KeyResources)
Preceded by
Problem 5
Followed by
Problem 7
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions

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