2022 AMC 10B Solutions

Scroll down to view professionally curated solutions from LIVE by Po-Shen Loh, print PDF solutions, view answer key, or take the full timed exam.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

1.

Define x ♢ yx~\diamondsuit~ y to be ∣x−y∣|x-y| for all real numbers xx and y.y. What is the value of (1 ♢ (2 ♢ 3))−((1 ♢ 2) ♢ 3)?(1~\diamondsuit~(2~\diamondsuit~3))-((1~\diamondsuit~2)~\diamondsuit~3)?
−2 -2
−1 -1
0 0
1 1
2 2
Concepts:custom operationabsolute valueorder of operations
Small hint:
Remember that the operation is absolute difference
Big hint:
Evaluate each diamond operation from the inside out
Solution:
Working from the innermost operations outward gives 1♢(2♢3)=∣1−∣2−3∣∣=0,(1♢2)♢3=∣∣1−2∣−3∣=2. \begin{aligned} 1\mathbin\diamondsuit(2\mathbin\diamondsuit3)&=|1-|2-3||=0,\\ (1\mathbin\diamondsuit2)\mathbin\diamondsuit3&=||1-2|-3|=2. \end{aligned} Therefore, the given difference is 0−2=−2.0-2=-2.
Thus, the answer is A .

2.

In rhombus ABCD,ABCD, point PP lies on segment AD‾\overline{AD} so that BP‾⊥AD‾,\overline{BP} \perp \overline{AD}, AP=3,AP = 3, and PD=2.PD = 2. What is the area of ABCD?ABCD?
35 3\sqrt 5
10 10
65 6\sqrt 5
20 20
25 25
Difficulty rating: 940
Small hint:
The side length of the rhombus is AD=AP+PDAD = AP + PD
Big hint:
In right triangle APB,APB, find BP,BP, then use area =AD⋅BP= AD \cdot BP
Solution:
The side length is AD=AP+PD=5,AD = AP + PD = 5, so AB=5.AB = 5. In right triangle APB,APB, BP=AB2−AP2=25−9=4. \begin{aligned} BP &= \sqrt{AB^2 - AP^2} \\ &= \sqrt{25 - 9} = 4. \end{aligned}
Taking ADAD as the base and BPBP as the height, the area is AD⋅BP=5⋅4=20.AD \cdot BP = 5 \cdot 4 = 20.
Thus, the correct answer is D.

3.

How many three-digit positive integers have an odd number of even digits?
150 150
250 250
350 350
450 450
550 550
Difficulty rating: 1100
Small hint:
A three-digit number cannot start with 00
Big hint:
Count by the number of even digit positions
Solution:
There are 9⋅10=909\cdot10=90 choices for the hundreds and tens digits. Once those two digits are fixed, the units digit must have whichever parity makes the total number of even digits odd. There are always 55 digits of the required parity (including 00 among the even digits).
Therefore, the number of integers is 90⋅5=450.90\cdot5=450.
Thus, the answer is D .

4.

A donkey suffers an attack of hiccups and the first hiccup happens at 4:004:00 one afternoon. Suppose that the donkey hiccups regularly every 55 seconds. At what time does the donkey’s 700700th hiccup occur?
1515 seconds after 4:584:58
2020 seconds after 4:584:58
2525 seconds after 4:584:58
3030 seconds after 4:584:58
3535 seconds after 4:584:58
Difficulty rating: 870
Small hint:
Convert the elapsed seconds past 4:004{:}00 into minutes and seconds
Big hint:
Count the number of five-second intervals after 4:004{:}00
Solution:
Since we want to look at the 700700th hiccup, we need to look at time that is 699699 hiccups after the first one.
This would be 699⋅5=3495699\cdot 5 = 3495 seconds. Note that 3495=60⋅58+15,3495 = 60\cdot 58+15, so the time would be 5858 minutes and 1515 seconds after the first hiccup. This would therefore be 4:584:58 and 1515 seconds.
Thus, the answer is A .

5.

What is the value of (1+13)(1+15)(1+17)(1−132)(1−152)(1−172)?\frac{\left(1+\frac{1}{3}\right)\left(1+\frac15\right)\left(1+\frac17\right)}{\sqrt{\left(1-\frac{1}{3^2}\right)\left(1-\frac{1}{5^2}\right)\left(1-\frac{1}{7^2}\right)}}?
3 \sqrt3
2 2
15 \sqrt{15}
4 4
105 \sqrt{105}
Difficulty rating: 1280
Small hint:
Rewrite each square-root factor as a product of two nearby fractions
Big hint:
Pair each factor in the numerator with the matching factor under the square root
Solution:
Let the given positive expression be E.E. Squaring it and using 1−1p2=(1−1p)(1+1p)1-\frac{1}{p^2}=(1-\frac{1}{p})(1+\frac{1}{p}) gives E2=∏p∈{3,5,7}1+1p1−1p=42⋅64⋅86=4. \begin{aligned} E^2&=\prod_{p\in\{3,5,7\}}\frac{1+\frac{1}{p}}{1-\frac{1}{p}}\\ &=\frac42\cdot\frac64\cdot\frac86=4. \end{aligned} Hence E=2.E=2.
Thus, the answer is B .

6.

How many of the first ten numbers of the sequence 121,11211,1112111,…121, 11211, 1112111, \ldots are prime numbers?
0 0
1 1
2 2
3 3
4 4
Difficulty rating: 1240
Small hint:
Look for a factorization of each term into two integers both greater than 11
Big hint:
Try writing a term as a repunit times a number of the form 10n+1,10^n + 1, for example 11211=111⋅10111211 = 111 \cdot 101
Solution:
The nnth term consists of nn ones, then a 2,2, then nn ones. It factors as a repunit times a number of the form 10n+1:10^n + 1: 121=11⋅11,11211=111⋅101,1112111=1111⋅1001, \begin{aligned} &121 = 11 \cdot 11, \\ &\quad 11211 = 111 \cdot 101, \\ &\quad 1112111 = 1111 \cdot 1001, \end{aligned} and in general the nnth term equals 1⋯1⏟n+1⋅(10n+1).\underbrace{1\cdots1}_{n+1} \cdot (10^n + 1).
For every n≥1n \ge 1 both factors exceed 1,1, so every term is composite. None of the ten numbers is prime.
Thus, the correct answer is A.

7.

For how many values of the constant kk will the polynomial x2+kx+36x^{2}+kx+36 have two distinct integer roots?
 6 \ 6
 8 \ 8
 9 \ 9
 14 \ 14
 16 \ 16
Difficulty rating: 1140
Small hint:
If the roots are pp and q,q, then pq=36pq = 36 and k=−(p+q)k = -(p+q)
Big hint:
Count the ordered-independent factor pairs of 3636 with two distinct integers, including negatives
Solution:
If the roots are integers pp and q,q, then pq=36pq = 36 and k=−(p+q).k = -(p+q). Distinct roots must have the same sign, so we list factor pairs of 3636 with p≠q.p \ne q.
The positive pairs are (1,36),(2,18),(3,12),(4,9),(1,36), (2,18), (3,12), (4,9), and the negative pairs are (−1,−36),(-1,-36), (−2,−18),(-2,-18), (−3,−12),(-3,-12), (−4,−9).(-4,-9). The pair (6,6)(6,6) is excluded since the roots must be distinct.
Each of these 88 pairs gives a different value of k.k.
Thus, the correct answer is B.

8.

Consider the following 100100 sets of 1010 elements each: {1,2,3,…,10},{11,12,13,…,20},{21,22,23,…,30},⋮{991,992,993,…,1000}.\begin{gathered} \{1,2,3,\ldots,10\},\\ \{11,12,13,\ldots,20\},\\ \{21,22,23,\ldots,30\},\\ \vdots\\ \{991,992,993,\ldots,1000\}. \end{gathered} How many of these sets contain exactly two multiples of 7?7?
 40 \ 40
 42 \ 42
 43 \ 43
 49 \ 49
 50 \ 50
Difficulty rating: 1360
Small hint:
A block of 1010 consecutive integers contains either one or two multiples of 77
Big hint:
Count the total multiples of 77 in {1,…,1000},\{1,\ldots,1000\}, then let xx blocks have two and 100−x100-x have one
Solution:
Among 11 to 10001000 there are ⌊10007⌋=142\left\lfloor \tfrac{1000}{7} \right\rfloor = 142 multiples of 7.7. Because 10>7,10 \gt 7, each block of 1010 consecutive integers contains one or two multiples of 7.7.
If xx blocks contain two and the remaining 100−x100 - x contain one, then 2x+(100−x)=142,2x + (100 - x) = 142, so x=42.x = 42.
Thus, the correct answer is B.

9.

The sum 12!+23!+34!+⋯+20212022!\dfrac{1}{2!}+\dfrac{2}{3!}+\dfrac{3}{4!}+\cdots+\dfrac{2021}{2022!} can be expressed as a−1b!,a-\dfrac{1}{b!}, where aa and bb are positive integers. What is a+b?a+b?
 2020 \ 2020
 2021 \ 2021
 2022 \ 2022
 2023 \ 2023
 2024 \ 2024
Difficulty rating: 1220
Small hint:
Look for a difference involving consecutive factorial reciprocals
Big hint:
Rewrite each term so the sum telescopes
Solution:
Each term telescopes because k(k+1)!=1k!−1(k+1)!.\frac{k}{(k+1)!}=\frac{1}{k!}-\frac{1}{(k+1)!}. Summing makes every intermediate factorial reciprocal cancel, leaving 1−12022!.1-\frac1{2022!}. Hence a=1,b=2022,a=1, b=2022, and a+b=2023.a+b=2023.
Thus, our answer is D .

10.

Camila writes down five positive integers. The unique mode of these integers is 22 greater than their median, and the median is 22 greater than their arithmetic mean. What is the least possible value for the mode?
 5 \ 5
 7 \ 7
 9 \ 9
 11 \ 11
 13 \ 13
Difficulty rating: 1520
Small hint:
The mode exceeds the median, so it can only appear among the two largest numbers
Big hint:
Let the median be m;m; for a unique mode the two largest must both equal m+2,m+2, and the sum is 5(m−2)5(m-2)
Solution:
List the numbers in increasing order with median m.m. The mode is m+2>m,m + 2 \gt m, so it can only occur among the two largest entries; for it to be the unique mode, both of them must equal m+2.m + 2.
The mean is m−2,m - 2, so the total is 5(m−2).5(m-2). With the two largest equal to m+2m + 2 and the median m,m, the two smallest sum to 5(m−2)−m−2(m+2)5(m-2) - m - 2(m+2) =2m−14.= 2m - 14.
The two smallest are distinct positive integers, so 2m−14≥1+2=3,2m - 14 \ge 1 + 2 = 3, giving m≥9.m \ge 9. With m=9m = 9 the list 1,3,9,11,111, 3, 9, 11, 11 works, so the least mode is m+2=11.m + 2 = 11.
Thus, the correct answer is D.

11.

All the high schools in a large school district are involved in a fundraiser selling T-shirts. Which of the choices below is logically equivalent to the statement “No school bigger than Euclid HS sold more T-shirts than Euclid HS”?
All schools smaller than Euclid HS sold fewer T-shirts than Euclid HS.
No school that sold more T-shirts than Euclid HS is bigger than Euclid HS.
All schools bigger than Euclid HS sold fewer T-shirts than Euclid HS.
All schools that sold fewer T-shirts than Euclid HS are smaller than Euclid HS.
All schools smaller than Euclid HS sold more T-shirts than Euclid HS.
Difficulty rating: 900
Small hint:
Use the contrapositive of the implication
Big hint:
Translate the statement into an implication
Solution:
The statement says: if a school is bigger than Euclid HS, then it did not sell more T-shirts than Euclid HS. Its contrapositive is: if a school sold more T-shirts than Euclid HS, then it is not bigger than Euclid HS. This is exactly choice B . Choice C is stronger than the original statement because it rules out a bigger school selling the same number of T-shirts.
Thus, the answer is B .

12.

A pair of fair 66-sided dice is rolled nn times. What is the least value of nn such that the probability that the sum of the numbers face up on a roll equals 77 at least once is greater than 12?\dfrac{1}{2}?
2 2
3 3
4 4
5 5
6 6
Difficulty rating: 960
Small hint:
Compare (56)n\left(\frac56\right)^n with 12\frac12
Big hint:
Use the complement: no roll has sum 77
Solution:
To compute this, we can also find the least nn such that the probability of not rolling a 77 is less than 12.\dfrac 12. Each roll has an independent probability of 16\dfrac 16 of getting 7,7, so it has a 56\dfrac 56 probability of not landing on 7.7.
Thus, the probability of none of the rolls being 77 is (56)n.\left(\dfrac 56\right)^n. We must find the least nn such that (56)n<12.\left(\dfrac 56\right)^n < \dfrac 12.
If n=3,n=3, then the probability is 125216,\dfrac{125}{216}, which is greater than 12.\dfrac 12.
If n=4,n=4, then the probability is 6251296,\dfrac{625}{1296}, which is less than 12.\dfrac 12. This makes the answer 4.4.
Thus, the answer is C .

13.

The positive difference between a pair of primes is equal to 2,2, and the positive difference between the cubes of the two primes is 31106.31106. What is the sum of the digits of the least prime that is greater than those two primes?
 8 \ 8
 10 \ 10
 11 \ 11
 13 \ 13
 16 \ 16
Difficulty rating: 1140
Small hint:
Factor the difference of cubes
Big hint:
Let the twin primes be pp and p+2p+2
Solution:
Since the primes are 22 away from each other, we can make them equal to m−1,m+1,m-1,m+1, where mm is their average.
Then, (m+1)3−(m−1)3=31106,(m+1)^3-(m-1)^3 = 31106 , making m3+3m2+3m+1m^3+3m^2+3m+1−(m3−3m2+3m−1)-(m^3-3m^2+3m-1) =6m2+2=31106.= 6m^2+2 = 31106.
Therefore, m2=5184,m^2= 5184, so m=72.m=72.
The primes are therefore 71,73.71,73. The least prime greater than both of those is 79,79, and its digit sum is 16.16.
Thus, the answer is E .

14.

Suppose that SS is a subset of {1,2,3,⋯ ,25}\left\{ 1, 2, 3, \cdots , 25 \right\} such that the sum of any two (not necessarily distinct) elements of SS is never an element of S.S. What is the maximum number of elements SS may contain?
 12 \ 12
 13 \ 13
 14 \ 14
 15 \ 15
 16 \ 16
Difficulty rating: 1600
Small hint:
Pair the numbers below the maximum element so that each pair sums to that maximum
Big hint:
Let mm be the largest element of SS
Solution:
The set S={13,14⋯ ,25}S = \{13,14 \cdots ,25\} has 1313 elements, and every pair has sum greater than 25,25, so this size is attainable.
Conversely, let mm be the maximum element of S.S. For every element of SS satisfying i<m,i<m, the number ii and the number m−im-i cannot both belong to S.S.
Thus, among the numbers below m,m, at most one number can be chosen from each pair with sum mm; if mm is even, the middle number cannot be chosen either. Hence at most ⌊m−12⌋\lfloor \dfrac {m-1}2 \rfloor elements lie below m,m, and including mm gives at most ⌊m−12⌋+1\lfloor \dfrac{m-1}2 \rfloor +1 elements.
The maximum value of this has m=25,m=25, yielding 13.13.
Thus, the answer is B .

15.

Let SnS_n be the sum of the first nn terms of an arithmetic sequence that has a common difference of 2.2. The quotient S3nSn\dfrac{S_{3n}}{S_n} does not depend on n.n. What is S20?S_{20}?
340 340
360 360
380 380
400 400
420 420
Difficulty rating: 1820
Small hint:
Force the quotient to be independent of n
Big hint:
Write the arithmetic sequence in terms of first term and common difference
Solution:
Write the nnth term as a+2n,a+2n, so the term before the first term is a.a. Then Sn=∑i=1n(a+2i)=n(a+n+1).\begin{aligned}S_n&=\sum_{i=1}^n(a+2i)\\&=n(a+n+1).\end{aligned}
Hence S3nSn=3(a+3n+1)a+n+1=9−6(a+1)a+n+1. \begin{aligned} \frac{S_{3n}}{S_n}&=\frac{3(a+3n+1)}{a+n+1}\\ &=9-\frac{6(a+1)}{a+n+1}. \end{aligned}
For this expression to be independent of n,n, its numerator 6(a+1)6(a+1) in the final fraction must be 0.0. Thus a=−1.a=-1.
Therefore, S20=20(−1+20+1)=400.S_{20}=20(-1+20+1)=400.
Thus, the answer is D .

16.

The diagram below shows a rectangle with side lengths 44 and 88 and a square with side length 5.5. Three vertices of the square lie on three different sides of the rectangle, as shown. What is the area of the region inside both the square and the rectangle?
1518 15\dfrac{1}{8}
1538 15\dfrac{3}{8}
1512 15\dfrac{1}{2}
1558 15\dfrac{5}{8}
1578 15\dfrac{7}{8}
Difficulty rating: 1900
Small hint:
Set up coordinates; the tilt of the square makes 33-44-55 right triangles at the corners
Big hint:
The whole square lies inside the rectangle except one triangle sticking out past the top edge; subtract that triangle from 2525
Solution:
Place the rectangle as [0,8]×[0,4].[0,8] \times [0,4]. The tilted square, using the 33-44-55 right triangles, has vertices (4,0),(4, 0), (0,3),(0, 3), (3,7),(3, 7), and (7,4).(7, 4).
The entire square lies inside the rectangle except for the triangle poking above the top edge y=4.y = 4. That triangle has vertices (0.75,4),(0.75, 4), (3,7),(3, 7), and (7,4),(7, 4), with area 12⋅(7−0.75)⋅(7−4)=758. \dfrac12 \cdot (7 - 0.75) \cdot (7 - 4) = \dfrac{75}{8}.
The region inside both is 25−758=1258=1558.25 - \dfrac{75}{8} = \dfrac{125}{8} = 15\dfrac58.
Thus, the correct answer is D.

17.

One of the following numbers is not divisible by any prime number less than 10.10. Which is it?
2606−1 2^{606}-1
2606+1 2^{606}+1
2607−1 2^{607}-1
2607+1 2^{607}+1
2607+3607 2^{607}+3^{607}
Difficulty rating: 1780
Small hint:
All five numbers are odd, so test divisibility only by 3,5,3, 5, and 77
Big hint:
Use the cycles of 2n2^n modulo 3,5,7:3, 5, 7: for example 2n≡1(mod3)2^n \equiv 1 \pmod 3 when nn is even
Solution:
Every option is odd, so only the primes 3,5,73, 5, 7 need checking.
Option A: 2606≡1(mod3),2^{606} \equiv 1 \pmod 3, so 2606−12^{606} - 1 is divisible by 3.3. Option B: 2606≡4(mod5),2^{606} \equiv 4 \pmod 5, so 2606+12^{606} + 1 is divisible by 5.5. Option D: 2607≡2(mod3),2^{607} \equiv 2 \pmod 3, so 2607+12^{607} + 1 is divisible by 3.3. Option E: modulo 5,5, 2607+3607≡3+2=5≡0.2^{607} + 3^{607} \equiv 3 + 2 = 5 \equiv 0.
For 2607−1:2^{607} - 1: it is ≡1(mod3),\equiv 1 \pmod 3, ≡2(mod5),\equiv 2 \pmod 5, and (since 23≡1(mod7)2^3 \equiv 1 \pmod 7 and 607≡1(mod3)607 \equiv 1 \pmod 3) ≡1(mod7).\equiv 1 \pmod 7. So it is not divisible by any prime below 10.10.
Thus, the correct answer is C.

18.

Consider systems of three linear equations with unknowns x,x, y,y, and z,z, {a1x+b1y+c1z=0a2x+b2y+c2z=0a3x+b3y+c3z=0 \begin{cases} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{cases} where each of the coefficients is either 00 or 11 and the system has a solution other than x=y=z=0.x=y=z=0. For example, one such system is {1x+1y+0z=00x+1y+1z=00x+0y+0z=0 \begin{cases} 1 x + 1 y + 0 z & = 0 \\ 0 x + 1 y + 1 z & = 0 \\ 0 x + 0 y + 0 z & = 0 \end{cases} with a nonzero solution of (x,y,z)=(1,−1,1).(x,y,z) = (1, -1, 1). How many such systems of equations are there? (The equations in a system need not be distinct, and two systems containing the same equations in a different order are considered different.)
 302 \ 302
 338 \ 338
 340 \ 340
 343 \ 343
 344 \ 344
Difficulty rating: 1970
Small hint:
For three distinct nonzero dependent rows, one row is the ordinary sum of two rows with disjoint supports
Big hint:
Count all binary coefficient matrices and subtract nonsingular ones
Solution:
There are 29=5122^9=512 ordered binary coefficient matrices. A homogeneous system has only the zero solution exactly when its three row vectors are linearly independent, so we count those matrices and subtract.
An independent matrix must have three distinct nonzero rows. There are 7⋅6⋅5=2107\cdot6\cdot5=210 ordered choices of such rows. Among three distinct nonzero binary vectors, dependence occurs exactly when one is the ordinary sum of the other two; the two summands must have disjoint nonempty supports.
If the sum has support of size 2,2, choose its two coordinates in 33 ways; its summands are the two corresponding unit vectors. If the sum has support of size 3,3, choose which one coordinate forms one summand in 33 ways, with the other two coordinates forming the other summand. Thus there are 3+3=63+3=6 unordered dependent triples, each with 3!=63!=6 row orders.
Hence the number of independent matrices is 210−6⋅6=174.210-6\cdot6=174. The desired number of singular matrices, and therefore of systems with a nonzero solution, is 512−174=338.512-174=338.
Thus, the answer is B .

19.

Each square in a 5×55 \times 5 grid is either filled or empty, and has up to eight adjacent neighboring squares, where neighboring squares share either a side or a corner. The grid is transformed by the following rules:
• Any filled square with two or three filled neighbors remains filled.
• Any empty square with exactly three filled neighbors becomes a filled square.
• All other squares remain empty or become empty.
A sample transformation is shown in the figure below.
Suppose the 5×55 \times 5 grid has a border of empty squares surrounding a 3×33 \times 3 subgrid. How many initial configurations will lead to a transformed grid consisting of a single filled square in the center after a single transformation? (Rotations and reflections of the same configuration are considered different.)
 14 \ 14
 18 \ 18
 22 \ 22
 26 \ 26
 30 \ 30
Difficulty rating: 2200
Small hint:
Only the inner 3×33 \times 3 can be filled; the center becoming filled needs exactly 33 filled neighbors (if it was empty) or 22-33 (if it was filled)
Big hint:
The binding constraint is that no border square gains exactly three filled neighbors; check that every valid configuration has exactly three filled cells
Solution:
Only the inner 3×33 \times 3 squares can start filled. For the center to be filled afterward, if it began empty it needs exactly 33 filled neighbors, and if it began filled it needs 22 or 3.3.
Every other square must end empty. The key restriction is that no border square may acquire exactly three filled neighbors, which rules out filling all three squares along an outer edge of the 3×3.3 \times 3.
If the center starts empty, exactly 33 of its 88 neighbors must be filled. Checking these triples up to square symmetry leaves four types. With ring coordinates centered at (0,0),(0,0), representatives are {(−1,−1),(−1,0),(1,1)},{(−1,−1),(−1,1),(1,−1)},{(−1,−1),(−1,1),(1,0)},{(−1,−1),(0,1),(1,0)}. \begin{gathered} \{(-1,-1),(-1,0),(1,1)\},\\ \{(-1,-1),(-1,1),(1,-1)\},\\ \{(-1,-1),(-1,1),(1,0)\},\\ \{(-1,-1),(0,1),(1,0)\}. \end{gathered} Their symmetry-orbit sizes are 8,4,4,4,8,4,4,4, giving 2020 configurations.
If the center starts filled, the same neighbor check leaves only the two configurations in which the other filled cells are opposite corner neighbors. Hence the total is 20+2=22.20+2=22.
Thus, the correct answer is C.

20.

Let ABCDABCD be a rhombus with ∠ADC=46∘.\angle ADC = 46^\circ. Let EE be the midpoint of CD‾,\overline{CD}, and let FF be the point on BE‾\overline{BE} such that AF‾\overline{AF} is perpendicular to BE‾.\overline{BE}. What is the degree measure of ∠BFC?\angle BFC?
 110 \ 110
 111 \ 111
 112 \ 112
 113 \ 113
 114 \ 114
Difficulty rating: 2150
Small hint:
Show that DD is the midpoint of AG‾,\overline{AG}, making AGAG a diameter
Big hint:
Extend BE‾\overline{BE} to meet line ADAD at GG
Solution:
Extend BE‾\overline{BE} to meet line ADAD at G.G. Because AD∥BC,AD\parallel BC, we have ∠GDE=∠ECB,\angle GDE=\angle ECB, and ∠GED=∠BEC\angle GED=\angle BEC are vertical angles. Also DE=EC,DE=EC, so △GDE≅△BCE.\triangle GDE\cong\triangle BCE. Hence DG=BC=AD.DG=BC=AD.
Thus DD is the midpoint of AG‾.\overline{AG}. The circle centered at DD through AA also passes through CC and G.G. Since AF⊥FG,AF\perp FG, Thales’ theorem places FF on this circle as well.
Because DGDG is opposite DA,DA, ∠GDC=180∘−∠ADC=134∘.\begin{aligned}\angle GDC&=180^\circ-\angle ADC\\&=134^\circ.\end{aligned} The inscribed angle ∠GFC\angle GFC subtending arc GCGC is therefore 67∘.67^\circ. Finally, B,F,GB,F,G are collinear, so ∠BFC=180∘−67∘=113∘.\angle BFC=180^\circ-67^\circ=113^\circ.
Thus, the answer is D .

21.

Let P(x)P(x) be a polynomial with rational coefficients such that when P(x)P(x) is divided by the polynomial x2+x+1,x^2 + x + 1, the remainder is x+2,x+2, and when P(x)P(x) is divided by the polynomial x2+1,x^2+1, the remainder is 2x+1.2x+1. There is a unique polynomial of least degree with these two properties. What is the sum of the squares of the coefficients of that polynomial?
 10 \ 10
 13 \ 13
 19 \ 19
 20 \ 20
 23 \ 23
Difficulty rating: 2080
Small hint:
The least-degree polynomial is a cubic; write P(x)=x+2P(x) = x + 2 +(x2+x+1)(px+q)+ (x^2 + x + 1)(px + q)
Big hint:
Reduce that expression modulo x2+1x^2 + 1 using x2≡−1,x^2 \equiv -1, and match it to 2x+12x + 1
Solution:
No linear polynomial can have the two different remainders. If P(x)=ax2+bx+cP(x)=ax^2+bx+c were quadratic, comparing its remainders would give both b−a=1, c−a=2b-a=1,\ c-a=2 and b=2, c−a=1,b=2,\ c-a=1, a contradiction. Thus the least possible degree is 3.3. Write P(x)=(x+2)P(x) = (x + 2) +(x2+x+1)(px+q),+ (x^2 + x + 1)(px + q), which has remainder x+2x + 2 upon division by x2+x+1.x^2 + x + 1.
Reducing modulo x2+1x^2 + 1 (so x2≡−1x^2 \equiv -1) gives remainder (q+1)x+(2−p).(q + 1)x + (2 - p). Setting this equal to 2x+12x + 1 gives q=1q = 1 and p=1.p = 1.
Then P(x)=x3+2x2+3x+3,P(x) = x^3 + 2x^2 + 3x + 3, and the sum of the squares of the coefficients is 1+4+9+9=23.1 + 4 + 9 + 9 = 23.
Thus, the correct answer is E.

22.

Let SS be the set of circles in the coordinate plane that are tangent to each of the three circles with equations x2+y2=4,x2+y2=64,x^{2}+y^{2}=4,\qquad x^{2}+y^{2}=64, and (x−5)2+y2=3.(x-5)^{2}+y^{2}=3. What is the sum of the areas of all circles in S?S?
 48π \ 48 \pi
 68π \ 68 \pi
 96π \ 96 \pi
 102π \ 102 \pi
 136π \ 136 \pi
Difficulty rating: 2280
Small hint:
Pair cases according to whether it is internally or externally tangent to the smaller concentric circle
Big hint:
Every desired circle is internally tangent to the largest concentric circle
Solution:
Call the concentric circles of radii 22 and 88 the inner and outer circles. Let a desired circle have radius rr and let its center be distance dd from the origin. It must be internally tangent to the outer circle, so d+r=8.d+r=8.
If it is externally tangent to the inner circle, then d−r=2,d-r=2, giving (r,d)=(3,5).(r,d)=(3,5). If it contains the inner circle, then r−d=2,r-d=2, giving (r,d)=(5,3).(r,d)=(5,3). Thus every desired circle has radius 33 or 5.5.
The third given circle has radius 3\sqrt3 and center (5,0).(5,0). For either value of r,r, a desired circle may be internally or externally tangent to it, so the distance between their centers is r−3r-\sqrt3 or r+3.r+\sqrt3. In all four cases, if this distance is q,q, then ∣d−q∣<5<d+q,|d-q|<5<d+q, so the circle of possible centers intersects the circle of radius dd about the origin in two points, symmetric across the xx-axis, as shown. Hence there are 44 desired circles of each radius.
The total area is therefore 4(52π+32π)=136π.4(5^2\pi+3^2\pi)=136\pi. Thus, E is the correct answer.

23.

Ant Amelia starts on the number line at 00 and crawls in the following manner. For n=1,n=1, 2,2, 3;3; Amelia chooses a time duration tnt_n and an increment xnx_n independently and uniformly at random from the interval (0,1).(0,1). During the nnth step of the process, Amelia moves xnx_n units in the positive direction, using up tnt_n minutes. If the total elapsed time has exceeded 11 minute during the nnth step, she stops at the end of that step; otherwise, she continues with the next step, taking at most 33 steps in all. What is the probability that Amelia’s position when she stops will be greater than 1?1?
13 \dfrac 13
12 \dfrac 12
23 \dfrac 23
34 \dfrac 34
56 \dfrac 56
Difficulty rating: 2130
Small hint:
Use geometric probabilities for sums of two or three independent numbers in (0,1)(0,1)
Big hint:
The stopping time depends only on the variables t1,t_1, t2,t_2, and t3t_3
Solution:
The stopping time depends only on the time variables, while the final position depends only on the distance variables, so the corresponding probabilities multiply.
For two independent numbers in (0,1),(0,1), the probability that their sum is less than 11 is the area of a right triangle, namely 12.\frac12.
For three independent numbers in (0,1),(0,1), the probability that their sum is less than 11 is the volume of a tetrahedron with side intercepts 1,1, namely 16.\frac16.
If t1+t2>1,t_1+t_2>1, Amelia stops after two steps. This has probability 12,\frac12, and independently x1+x2>1x_1+x_2>1 has probability 12,\frac12, contributing 14.\frac14.
If t1+t2<1,t_1+t_2<1, Amelia takes the third step. This has probability 12,\frac12, and independently x1+x2+x3>1x_1+x_2+x_3>1 has probability 1−16=56,1-\frac16=\frac56, contributing 512.\frac5{12}.
The total probability is 14+512=23.\frac14+\frac5{12}=\frac23.
Thus, the answer is C .

24.

Consider functions ff that satisfy ∣f(x)−f(y)∣≤12∣x−y∣|f(x)-f(y)|\leq \dfrac{1}{2}|x-y| for all real numbers xx and y.y. Of all such functions that also satisfy the equation f(300)=f(900),f(300) = f(900), what is the greatest possible value of the following expression? f(f(800))−f(f(400))f(f(800))-f(f(400))
25 25
50 50
100 100
150 150
200 200
Difficulty rating: 2390
Small hint:
After proving the upper bound, give a piecewise-linear function that attains it
Big hint:
Use the contraction condition twice on each side of f(300)=f(900)f(300)=f(900)
Solution:
Applying the contraction inequality twice gives ∣f(f(400))−f(f(300))∣≤12∣f(400)−f(300)∣≤25, \begin{aligned} &|f(f(400))-f(f(300))|\\ &\quad\le\frac12|f(400)-f(300)|\\ &\quad\le25, \end{aligned} and similarly ∣f(f(800))−f(f(900))∣≤25.|f(f(800))-f(f(900))|\le25.
Set M=f(f(300))=f(f(900)).M=f(f(300))=f(f(900)). The triangle inequality now yields ∣f(f(800))−f(f(400))∣≤∣f(f(800))−M∣+∣M−f(f(400))∣≤50. \begin{aligned} &|f(f(800))-f(f(400))|\\ &\quad\le|f(f(800))-M|\\ &\qquad+|M-f(f(400))|\\ &\quad\le50. \end{aligned}
To attain the bound, define ff by linear interpolation through the points (300,600),(400,550),(550,575),(650,625),(800,650),(900,600).\begin{gathered}(300,600),(400,550),(550,575),\\ (650,625),(800,650),(900,600).\end{gathered} and set f(x)=600f(x)=600 for x≤300x\leq300 or x≥900.x\geq900. Every segment has slope with absolute value at most 12,\dfrac12, so the contraction condition holds. In particular, f(300)=f(900)=600,f(300)=f(900)=600, f(400)=550,f(400)=550, and f(800)=650.f(800)=650. Hence f(f(400))=f(550)=575,f(f(400))=f(550)=575, while f(f(800))=f(650)=625,f(f(800))=f(650)=625, giving the difference 50.50.
Thus, the answer is B .

25.

Let x0,x_0, x1,x_1, x2,x_2, …\dotsc be a sequence of numbers, where each xkx_k is either 00 or 1.1. For each positive integer n,n, define Sn=∑k=0n−1xk2kS_n = \sum_{k=0}^{n-1} x_k 2^k Suppose 7Sn≡1(mod2n)7S_n \equiv 1 \pmod{2^n} for all n≥1.n \geq 1. What is the value of the sum x2019+2x2020+x_{2019} + 2x_{2020} + 4x2021+8x2022?4x_{2021} + 8x_{2022}?
6 6
7 7
12 12
14 14
15 15
Difficulty rating: 2330
Small hint:
The congruence defines the binary digits of the inverse of 77
Big hint:
Find S2019S_{2019} and S2023,S_{2023}, then subtract to isolate the four digits
Solution:
The desired sum is S2023−S201922019.\frac{S_{2023}-S_{2019}}{2^{2019}}. Also, 0≤Sn<2n.0\le S_n<2^n.
Therefore, for a unique mn∈{0,1,…,6},m_n\in\{0,1,\ldots,6\}, 7Sn=mn2n+1.7S_n=m_n2^n+1. Reducing modulo 77 gives mn2n≡−1(mod7).m_n2^n\equiv-1\pmod7.
Since 23≡1(mod7)2^3\equiv1\pmod7 and 2019≡0(mod3),2019\equiv0\pmod3, we get m2019=6.m_{2019}=6. Since 2023≡1(mod3),2023\equiv1\pmod3, we have 2m2023≡−1(mod7),2m_{2023}\equiv-1\pmod7, so m2023=3.m_{2023}=3. Hence S2019=6⋅22019+17,S2023=3⋅22023+17.\begin{gathered}S_{2019}=\frac{6\cdot2^{2019}+1}{7},\\ S_{2023}=\frac{3\cdot2^{2023}+1}{7}.\end{gathered}
Finally, S2023−S201922019=3⋅24−67=6. \frac{S_{2023}-S_{2019}}{2^{2019}} =\frac{3\cdot2^4-6}{7}=6.
Thus, the correct answer is A .
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.Terms of UsePrivacy PolicyCOPPA Privacy Policy