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 "2022 AIME I Problems/Problem 6"
Line 1: Line 1:
−
==solution 1==
+
== Problem ==
 +
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.
  
−
divide cases into <math>7\leq a<20; 21\leq a\leq28</math>.
+
== Solution ==
−
There are three cases that arithmetic sequence forms: <math>3,12,21,30;4,16,28,40;3,5,7,9</math>. So the answer is <math>22+...+10+1+2+...+8-13-3=228</math>
+
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.
  
−
~bluesoul
+
However, there are still specific invalid cases counted in these <math>231</math> pairs <math>(a,b)</math>. Since
 +
<cmath>3,5,a,b</cmath>
 +
cannot form an arithmetic progression, <math>\underline{(a,b) \neq (7,9)}</math>.
 +
<cmath>a,b,30,50</cmath>
 +
cannot be an arithmetic progression, so <math>(a,b) \neq (-10,10)</math>; however, since this pair was not counted in our <math>231</math>, we do not need to subtract it off.
 +
<cmath>3,a,b,30</cmath>
 +
cannot form an arithmetic progression, so <math>\underline{(a,b) \neq (12,21)}</math>.
 +
<cmath>4, a, b, 40</cmath>
 +
cannot form an arithmetic progression, so <math>\underline{(a,b) \neq (16,28)}</math>.
 +
<cmath>5, a,b, 50</cmath>
 +
cannot form an arithmetic progression, <math>(a,b) \neq 20, 35</math>; however, since this pair was not counted in our <math>231</math> (since we disallowed <math>a</math> or <math>b</math> to be <math>20</math>), we do not to subtract it off.
 +
 
 +
Also, the sequences <math>(3,a,b,40)</math>, <math>(3,a,b,50)</math>, <math>(4,a,b,30)</math>, <math>(4,a,b,50)</math>, <math>(5,a,b,30)</math> and <math>(5,a,b,40)</math> will never be arithmetic, since that would require <math>a</math> and <math>b</math> to be non-integers.
 +
 
 +
So, we need to subtract off <math>3</math> progressions from the <math>231</math> we counted, to get our final answer of <math>\boxed{228}</math>.
 +
 
 +
~ ihatemath123
 +
 
 +
==See Also==
 +
{{AIME box|year=2022|n=I|num-b=2|num-a=4}}
 +
{{MAA Notice}}

Revision as of 19:45, 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

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

See Also

2022 AIME I (Problems • Answer Key • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2022_AIME_I_Problems/Problem_6&oldid=171183"