2020 AMC 10B Exam Solutions

Scroll down to view professional video solutions and written solutions curated by LIVE, by Po-Shen Loh, print PDF solutions, view answer key, or:

Try Exam

All of the real AMC 8 and AMC 10 problems in our complete solution collection are used with official permission of the Mathematical Association of America (MAA).

Want to learn professionally through interactive video classes?

1.

What is the value of 1(2)3(4)5(6)?1 - (-2) - 3 - (-4) - 5 - (-6)?

20-20

3-3

33

55

2121

Solution:

Let's first notice that when we subtract a negative number, it is the same as adding it's positive counterpart. In other words: a(b)=a+ba-(-b) = a+b With that in mind, we can rewrite the above expression as: 1+23+45+61+2-3+4-5+6 Which can be solved to yield 55 as our final answer.

Thus, D is the correct answer.

2.

Carl has 55 cubes each having side length 1,1, and Kate has 55 cubes each having side length 2.2. What is the total volume of the 1010 cubes?

2424

2525

2828

4040

4545

Solution:

Recall that a cube with a side length of aa has a volume of a3.a^3. With this in mind, Carl's cubes (each with side length 11) have a volume of 13=11^3=1 each. Therefore, all of Carl's 55 cubes will have a total volume of 51=5.5\cdot 1=5.

Similarly, Kate's cubes (each with side length 22) have a volume of 23=82^3=8 each. Therefore, all of Kates's 55 cubes will have a total volume of 58=40.5\cdot 8=40.

Therefore, the total volume of these 10 cubes is 5+40=45.5+40=45.

Thus, the correct answer is E.

3.

The ratio of ww to xx is 4:3,4:3, the ratio of yy to zz is 3:2,3:2, and the ratio of zz to xx is 1:6.1:6. What is the ratio of ww to y?y?

4:34:3

3:23:2

8:38:3

4:14:1

16:316:3

Solution:

Let's begin by restating the following: w:x=wx=43=4:3w:x = \dfrac{w}{x}=\dfrac43=4:3 y:z=yz=32=3:2y:z = \dfrac{y}{z}=\dfrac32=3:2 z:x=zx=16=1:6z:x = \dfrac{z}{x}=\dfrac16=1:6 Armed with these three equations, we want to find w:y=wy.w:y= \dfrac wy. To do this, we must try and represent wy\dfrac wy using wx,yz,\dfrac wx, \dfrac yz, and zy.\dfrac zy.

Notice that we can represent wy\dfrac wy as wzzy.\dfrac wz \cdot \dfrac zy.

Further notice that wz=wxxz.\dfrac wz = \dfrac wx \cdot \dfrac xz. Therefore, combining these two facts shows us that: wy=wxxzzy=wx1(zx)1(yz)=431(16)1(32)=436123=489=163\begin{align*}\dfrac wy &= \dfrac wx \cdot \dfrac xz \cdot \dfrac zy\\ &= \dfrac wx \cdot \dfrac {1}{(\dfrac zx)} \cdot \dfrac {1}{(\dfrac yz)} \\ &= \dfrac 43 \cdot \dfrac{1}{(\dfrac 16)} \cdot \dfrac{1}{(\dfrac 32)} \\ &= \dfrac 43 \cdot \dfrac 61 \cdot \dfrac 23\\ &= \dfrac{48}{9}\\ &= \dfrac{16}{3} \end{align*} As such: w:y=wy=163=16:3w:y = \dfrac wy = \dfrac {16}{3} = 16:3 Thus, E is the correct answer.

4.

The acute angles of a right triangle are aa^{\circ} and b,b^{\circ}, where a>ba>b and both aa and bb are prime numbers. What is the least possible value of b?b?

22

33

55

77

1111

Solution:

We know that the interior angles of a triangle add up to 180,180^{\circ}, and since the triangle in question is a right triangle, by definition one of the interior angles must measure 90.90^{\circ}. The remaining two acute angles, aa^{\circ} and b,b^{\circ}, must therefore have a sum of 18090=90.180^{\circ}-90^{\circ}=90^{\circ}.

Let's begin by exploring the largest values of aa^{\circ} and going from there, as those will naturally yield the smallest values of b.b^{\circ}.

The greatest possible value of aa^{\circ} is 89.89^{\circ}. This makes b=9089=1,b^{\circ}=90^{\circ}-89^{\circ}=1^{\circ}, which is not prime, so this is not a valid possible case.

Moving on, the next largest possible value of aa^{\circ} is 83.83^{\circ}. This makes b=9083=7,b^{\circ}=90^{\circ}-83^{\circ}=7^{\circ}, which is prime! Therefore, this is the smallest possible value of b.b.

Thus, D is the correct answer.

5.

How many distinguishable arrangements are there of 11 brown tile, 11 purple tile, 22 green tiles, and 33 yellow tiles in a row from left to right? (Tiles of the same color are indistinguishable.)

210210

420420

630630

840840

10501050

Solution:

We have 1+1+2+3=71+1+2+3=7 total tiles, and as such, there are 7!7! total ways to order them. However, notice that this is overcounting, as it assumes that all tiles are indistinguishable, when in reality, the yellow and green tiles can be reordered amongst themselves without any change to the overall tiling pattern.

Let's remove this overcounting as follows. There are 33 yellow tiles, and as such, there are 3!=63!=6 ways to switch them around amongst themselves such that the overall tiling pattern is unchanged, as they are indistinguishable.

Similarly, there are 22 green tiles, and as such, there are 2!=22!=2 ways to switch them around amongst themselves such that the overall tiling pattern is unchanged, as they are indistinguishable.

Therefore, there are 7!62=7543=760=420\begin{align*}\dfrac{7!}{6\cdot 2}&=7\cdot 5\cdot 4\cdot 3 \\ &= 7\cdot 60 \\ &= 420\end{align*} possible tilings.

Thus, B is the correct answer.

6.

Driving along a highway, Megan noticed that her odometer showed 1595115951 (miles). This number is a palindrome — it reads the same forward and backward. Then 22 hours later, the odometer displayed the next higher palindrome. What was her average speed, in miles per hour, during this 22-hour period?

50

55

60

65

70

Solution:

We want to find the smallest palindrome larger than 15951,15951, and to do so, we want to increase the value of the middle digit. This is because if we increased the value of any other digit with less place value (say, the ones place), we would also need to increase the value of the digit with greater place value (i.e. ten-thousands place).

Therefore, we must replace the number 99 to the next greatest integer: 10.10. As all digits must be between 00 and 99 (inclusive), we write a zero in place of the nine, and increase the thousands digit (and the tens — to preserve the palindrome).

As such, the next smallest palindrome larger than 1595115951 is 16061.16061.

As Megan drives 160611595116061-15951=110=110 miles in 22 hours, she drives at an average of 5555 mph.

Thus, B is the correct answer.

7.

How many positive even multiples of 33 less than 20202020 are perfect squares?

77

88

99

1010

1212

Solution:

If a number is even, it must be a multiple of 2,2, and as such, if a number is a positive even multiple of 3,3, it is a multiple of 33 and 2,2, meaning that it is a multiple of 6.6.

As such, we can write arbitrary positive multiples of six as 6k,6k, for k0.k ≥ 0.

We want to find the number of positive even multiples of 33 — or more simply, positive integers of the form 6k6k — that are also perfect squares. Therefore, we are looking for integers less than 20202020 of the form: (6k)2.\left(6k\right)^2.

Notice that for k=8,(6k)2=23042020,k=8, (6k)^2 = 2304 ≥ 2020, and for k=7,(6k)2=17642020.k=7, (6k)^2 = 1764 \le 2020. This means that the maximum kk we can have is 7,7, and as k>0k > 0 all k:1k7k: 1\le k\le 7 are valid solutions.

As such, there are 77 solutions.

Thus, A is the correct answer.

8.

Points PP and QQ lie in a plane with PQ=8.PQ=8. How many locations for point RR in this plane are there such that the triangle with vertices P,P, Q,Q, and RR is a right triangle with area 1212 square units?

22

44

66

88

1212

Solution:

We know that the area of PQR,\triangle PQR, denoted A(PQR),A(\triangle PQR), is equal to 12PQhR,\dfrac 12 \cdot PQ \cdot h_R, where hRh_R is equal to the height of PQR.\triangle PQR.

As A(PQR)=12A(\triangle PQR) = 12 and PQ=8,PQ=8, we can see that hR=3.h_R = 3.

WLOG, allow P=(4,0)P=(-4,0) and Q=(4,0).Q=(4,0). With this in mind, let's case on the position of the right angle:

P=90.\angle P = 90^{\circ}. This implies that R=(4,±3).R=(-4,\pm 3).

Q=90.\angle Q = 90^{\circ}. This implies that R=(4,±3).R=(4,\pm 3).

R=90.\angle R = 90^{\circ}. This implies that 82=PR2+QR282=(4x)2+y2+(4x)2+y282=(4x)2+(±3)2+(4x)2+(±3)282=(4+x)2+(4x)2+1846=(4+x)2+(4x)246=16+8x+x2+168x+x214=2x2x=±7\begin{align*} 8^2 &= PR^2+QR^2\\ 8^2 &=(-4-x)^2 + y^2 \\&+ (4-x)^2 + y^2\\ 8^2 &=(-4-x)^2 + (\pm 3)^2 \\&+ (4-x)^2 + (\pm 3)^2\\ 8^2 &=(4+x)^2 + (4-x)^2 + 18 \\ 46 &= (4+x)^2+ (4-x)^2\\ 46 &=16+8x+x^2\\&+16-8x+x^2\\ 14&= 2x^2\\ x&= \pm \sqrt{7} \end{align*} Thus, we have R=(±7,±3).R = (\pm \sqrt{7},\pm 3).

As such, we have 2+2+4=82+2+4=8 possible locations for R.R.

Thus, the correct answer is D.

9.

How many ordered pairs of integers (x,y)(x, y) satisfy the equation x2020+y2=2y?x^{2020}+y^2=2y?

11

22

33

44

infinitely many

Solution:

We can rewrite the equation as y22y+x2020=0.y^2-2y+x^{2020}=0. Using the quadratic formula, we know that: y=2±44(1)(x2020)2y = \dfrac{2 \pm \sqrt{4-4(1)(x^{2020}) }}{2}

As yy must be an integer, and therefore a real number, we must have 44x202004-4x^{2020} \ge 0 to prevent negative square roots. This suggests: 44x20200x202011x1.\begin{align*}4-4x^{2020} &\ge 0 \\ x^{2020} &\le 1\\ -1 \le x \le 1. \end{align*} Since xx must be an integer for yy to be an integer, this gives us three xx values, each with either one or two corresponding yy values. With this, we have the following four solutions: (1,1)(-1,1) (0,0)(0,0) (0,2)(0,2) (1,1)(1,1)

Thus, D is the correct answer.

10.

A three-quarter sector of a circle of radius 44 inches together with its interior can be rolled up to form the lateral surface area of a right circular cone by taping together along the two radii shown. What is the volume of the cone in cubic inches?

3π53\pi\sqrt{5}

4π34\pi\sqrt{3}

3π73\pi\sqrt{7}

6π36\pi\sqrt{3}

6π76\pi\sqrt{7}

Solution:

Remember that the volume of a cone is equal to 13πr2h.\dfrac 13 \pi r^2 h. Further notice that the circumference of the base of the cone is equal to the remaining circumference of the circle: 34\dfrac 34 the circumference of the complete circle.

Therefore, the circumference of the base of the cone is equal to: C=342(π)(4)=6π\begin{align*} C &= \dfrac 34 \cdot 2(\pi) (4)\\ &= 6\pi \end{align*} This suggests that the radius of the cone's base (rr') is equal to: C=2πr6π=2πrr=3.\begin{align*} C &= 2\pi r' \\ 6\pi &= 2\pi r' \\ r' &= 3. \end{align*} Also, when we tape together the marked radii to form the cone, the radii in question become the slanted height of the cone. This can be used to find the actual height of the cone, which by the Pythagorean Theorem, is equal to: SL2=h2+(r)242=h2+3216=h2+97=h2h=7.\begin{align*}SL^2 &= h^2 + (r')^2\\ 4^2 &= h^2 +3^2 \\ 16 &= h^2 + 9\\ 7 &= h^2 \\ h &= \sqrt{7}. \end{align*} Thus, the volume of the cone is equal to: V=13πr2h=13π(r)2h=13π(3)27=13π97=3π7\begin{align*}V &= \dfrac 13 \pi r^2 h \\ &= \dfrac 13 \pi (r')^2 h\\ &= \dfrac 13 \pi (3)^2 \cdot \sqrt{7} \\ &= \dfrac 13 \pi 9\sqrt{7} \\ &= 3\pi\sqrt{7} \end{align*}

Thus, the correct answer is C.

11.

Ms. Carr asks her students to read any 55 of the 1010 books on a reading list. Harold randomly selects 55 books from this list, and Betty does the same. What is the probability that there are exactly 22 books that they both select?

18\dfrac{1}{8}

536\dfrac{5}{36}

1445\dfrac{14}{45}

2563\dfrac{25}{63}

12\dfrac{1}{2}

Solution:

Assume that Harold has already picked his 55 books. Of these five books, there are (52)\binom{5}{2} ways that Betty can have picked exactly two of the same books as Harold, and (53)\binom{5}{3} ways that Betty can choose her other three books from the 55 books not on Harold's list.

As such, there are (52)(53)=100\binom{5}{2}\binom{5}{3}=100 ways for Betty to choose her books such that she chooses exactly two books on Harold's list and three books not on Harold's list.

Therefore, as there are (105)=252\binom{10}{5}=252 ways that Betty can choose her books arbitrarily, and 100100 of those choices satisfy the above conditions, the probability that they have exactly two books in common is: 100252=2563\dfrac{100}{252} = \dfrac{25}{63}

Thus, D is the correct answer.

12.

The decimal representation of 12020\frac{1}{20^{20}} consists of a string of zeros after the decimal point, followed by a 99 and then several more digits. How many zeros are in that initial string of zeros after the decimal point?

2323

2424

2525

2626

2727

Solution:

Before tackling the problem itself, let's notice that a pattern emerges when dividing 1 by different integers, where aa is one digit: 1a=0.k110a=0.0k1102a=0.00k\begin{align*} \dfrac{1}{a} &= 0.\underline{k} \cdots \\ \dfrac{1}{10a} &= 0.0\underline{k} \cdots\\ \dfrac{1}{10^2a} &= 0.00\underline{k} \cdots\\ \vdots \end{align*} for some digit kk (the dots represent the fact that there may be digits after kk).

It seems that 1÷(10na)1\div (10^n a) will have nn zeros after the decimal point.

Returning to the original problem, notice that 2020=1020220.20^{20} = 10^{20} \cdot 2^{20}. As 210=10241000=103,2^{10}=1024 \approx 1000 = 10^3, it follows that 220106.2^{20} \approx 10^6. Thus: 20201061020=1026.20^{20} \approx 10^6\cdot 10^{20} = 10^{26}. Therefore: 1202011026,\dfrac{1}{20^{20}} \approx \dfrac{1}{10^{26}}, which, by the pattern established above, implies that there are 2626 zeroes after the decimal point.

Thus, the correct answer is D.

13.

Andy the Ant lives on a coordinate plane and is currently at (20,20)(-20, 20) facing east (that is, in the positive xx-direction). Andy moves 11 unit and then turns 9090^{\circ} left. From there, Andy moves 22 units (north) and then turns 9090^{\circ} left. He then moves 33 units (west) and again turns 9090^{\circ} left. Andy continues his progress, increasing his distance each time by 11 unit and always turning left. What is the location of the point at which Andy makes the 2020th2020\text{th} left turn?

(1030,994)(-1030,-994)

(1030,990)(-1030,-990)

(1026,994)(-1026,-994)

(1026,990)(-1026,-990)

(1022,994)(-1022,-994)

Solution:

Let's begin by seeing how each step changes the Andy's coordinate:

Step 1: Andy moves one unit east and then turns left. Therefore, his new position is (19,20),(-19,20), facing north.

Step 2: Andy moves two units north and then turns left. Therefore, his new position is (19,22),(-19,22), facing west.

Step 3: Andy moves three units west and then turns left. Therefore, his new position is (22,22),(-22,22), facing south.

Step 4: Andy moves four units south and then turns left. Therefore, his new position is (22,18),(-22,18), facing east.

A cyclic pattern seems to emerge, as every four steps Andy takes, it seems that if his original position is (a,b)(a,b) facing east, is new position is (a2,b2)(a-2,b-2) facing east.

As there are 505505 such 44-step cycles in the 20202020 steps Andy takes, it follows that Andy's final position is: (20505(2),20505(2))=(201010,201010)=(1030,990)\begin{align*}&(-20-505(2),20-505(2))\\ =&(-20-1010,20-1010)\\ =& (-1030,-990)\end{align*}

Thus, B is the correct answer.

14.

As shown in the figure below, six semicircles lie in the interior of a regular hexagon with side length 2 so that the diameters of the semicircles coincide with the sides of the hexagon. What is the area of the shaded region — inside the hexagon but outside all of the semicircles?

633π6\sqrt3-3\pi

9322π\dfrac{9\sqrt3}{2}-2\pi

332π3\dfrac{3\sqrt3}{2}-\dfrac{\pi}{3}

33π3\sqrt3-\pi

932π\dfrac{9\sqrt3}{2}-\pi

Solution:

Firstly construct the following lines between points on the hexagon:

Observe that the area of the shaded region is simply 66 times the area of the following shaded region:

As the entire figure is simply two equilateral triangles with side length 1,1, the total area is: 234=322\cdot \dfrac{\sqrt{3}}{4}=\dfrac{\sqrt{3}}{2} The unshaded region has an area equal to a circular sector with radius 11 and an angle π3\dfrac{\pi}{3} (as the triangle is equilateral). As such, the area of the unshaded region is: π32ππ=16π=π6\dfrac{\frac{\pi}{3}}{2\pi} \cdot \pi = \dfrac{1}{6} \cdot \pi = \dfrac{\pi}{6} Meaning the area of the shaded region is: 32π6\dfrac{\sqrt{3}}{2}-\dfrac{\pi}{6} And as such, the area of the larger, complete shaded area in the hexagon is: 6(32π6)=33π6\cdot \left(\dfrac{\sqrt{3}}{2}-\dfrac{\pi}{6}\right) = 3\sqrt{3}-\pi Thus, D is the correct answer.

15.

Steve wrote the digits 1,1, 2,2, 3,3, 4,4, and 55 in order repeatedly from left to right, forming a list of 10,00010,000 digits, beginning 123451234512123451234512\ldots

He then erased every third digit from his list (that is, the 33rd, 66th, 99th, \ldots digits from the left), then erased every fourth digit from the resulting list (that is, the 44th, 88th, 1212th, \ldots digits from the left in what remained), and then erased every fifth digit from what remained at that point.

What is the sum of the three digits that were then in the positions 2019,2020,2021?2019, 2020, 2021?

77

99

1010

1111

1212

Solution:

Let's begin by analyzing the list of digits after the removal of the third digits.

Although the list initially cycles with a period of 55 (as in, the list repeats itself every 55 digits), as lcm(3,5)=15,3,5)=15, the relative positions from which we delete digits from repeats every 1515 digits. Therefore: 123451234512345123451234512345 12345123451234512\cancel{3}45\cancel{1}23\cancel{4}51\cancel{2}34\cancel{5} Therefore, the new list is: 12452351341245235134 and repeats every 1010 digits.

Similarly, we consider the same procedure for removing the fourth digits.

As lcm(4,10)=20,(4,10)=20, let's consider the first 2020 digits of this list when making our deletions, as after this point, the relative positions of our deletions will repeat. 1245235134124523513412452351341245235134 12452351341245235134124\cancel{5}235\cancel{1}341\cancel{2}452\cancel{3}513\cancel{4} Therefore, the new list is: 124235341452513124235341452513 and repeats every 1515 digits.

Lastly, we consider the same procedure for removing the fifth digits.

As lcm(5,15)=15,(5,15)=15, let's consider the first 1515 digits of this list when making our deletions, as after this point, the relative positions of our deletions will repeat. 124235341452513124235341452513 1242353414525131242\cancel{3}5341\cancel{4}5251\cancel{3} Therefore, the new list is: 124253415251124253415251 and repeats every 1212 digits.

As 20193mod12,2019 \equiv 3 \bmod{12}, we know that the 20192019th digit is equal to the 33rd digit in the list above. As such, it follows that: position 2019=4\mathrm{position } ~2019 = 4 position 2020=2\mathrm{position } ~2020 = 2 position 2021=5\mathrm{position } ~2021 = 5 Therefore, the sum of these values is 4+2+5=11.4+2+5=11.

Thus, the correct answer is D.

16.

Bela and Jenn play the following game on the closed interval [0,n][0, n] of the real number line, where nn is a fixed integer greater than 4.4. They take turns playing, with Bela going first. At his first turn, Bela chooses any real number in the interval [0,n].[0, n]. Thereafter, the player whose turn it is chooses a real number that is more than one unit away from all numbers previously chosen by either player. A player unable to choose such a number loses. Using optimal strategy, which player will win the game?

Bela will always win.

Jenn will always win.

Bela will win if and only if nn is odd.

Jenn will win if and only if nn is odd.

Bela will win if and only if n >8.

Solution:

Consider the following strategy:

Bela begins by choosing the middle value n2\dfrac{n}{2} in [0,n].[0,n]. From then on, whatever value say — kk — Jenn chooses, Bela will always choose nk.n-k. As Bela goes first, and chooses the middle value, she will always be able to choose the mirrored value of Jenn's move and Jenn will run out of number to pick first.

Therefore, following this strategy, Bela will always win.

Thus, A is the correct answer.

17.

There are 1010 people standing equally spaced around a circle. Each person knows exactly 33 of the other 99 people: the 22 people standing next to her or him, as well as the person directly across the circle. How many ways are there for the 1010 people to split up into 55 pairs so that the members of each pair know each other?

1111

1212

1313

1414

1515

Solution:

We case upon the number of opposite pairs. As in, we count the number of possible pairs when we have 0,1,2,,50,1,2,\cdots,5 pairs whose members are across the circle from one another. Then, we will add up all these values to find the total number of ways to split up the 1010 people.

00 opposite pairs

In this case, we select pairs by either matching person 11 with person 2,2, and person 33 with person 4,4, and so on. Or, we can match person 11 with person 10,10, and person 99 with person 8,8, and so on. As such, there are 22 ways to pair up individuals in this case.

11 opposite pair

In this case, we have 55 possible pairs where a person is matched with the person across from them, and everyone else pairs with the person next to them.

22 opposite pairs

We cannot have 22 opposite pairs, as there would be one person on either side that will not have a pair adjacent to them.

33 opposite pairs

In this case, we have (53)=10\binom{5}{3} = 10 possible ways to match a person with the person across from them, where everyone else pairs with the person next to them. However, notice that there are duplicates, so we divide the 1010 possibilities by 22 to get 5.5.

44 opposite pairs

We cannot have 44 opposite pairs, as there would be one person on either side that will not have a pair adjacent to them.

55 opposite pairs

In this case, there is only one way to do this.

As such, there are 2+5+5+1=132+5+5+1=13 ways to pair up individuals such that the members of each pair know each other.

Thus, the correct answer is C.

18.

An urn contains one red ball and one blue ball. A box of extra red and blue balls lie nearby. George performs the following operation four times: he draws a ball from the urn at random and then takes a ball of the same color from the box and returns those two matching balls to the urn. After the four iterations the urn contains six balls. What is the probability that the urn contains three balls of each color?

16\dfrac16

15\dfrac15

14\dfrac14

13\dfrac13

12\dfrac12

Solution:

Begin by noting that there are (42)=6\binom{4}{2}=6 ways to arrange two red and two blue balls in different orders.

Now, given an arbitrary arrangement of these four balls, we want to find the probability of said arrangement happening. We will show that the probability of each arrangement is the same.

We first want to find the total number of choices we have to choose from, and as there are 22 choices for the first step, 33 choices for the second step, 44 choices for the third step, and 55 choices for the fourth step, it follows that there are 2345=1202\cdot 3\cdot 4\cdot 5 = 120 different ways to choose an arrangement.

Regardless of the details of the specific arrangement we aim to get, the first time a red ball is added will come from 11 choice, and the second time will come from 22 choices, as that is the initial number of red balls in the urn. This also holds for the greens. As such, the number of successful choices is: (12)2=4(1\cdot 2)^2 = 4

As such, for an arbitrary ordering of two red and two blue balls, we have a 4120=130\dfrac{4}{120} = \dfrac{1}{30} probability. As there are 66 possible arrangements, the total probability is 15.\dfrac 15.

Thus, the correct answer is B.

19.

In a certain card game, a player is dealt a hand of 1010 cards from a deck of 5252 distinct cards. The number of distinct (unordered) hands that can be dealt to the player can be written as 158A00A4AA0.158A00A4AA0. What is the digit A?A?

22

33

44

66

77

Video solution:
Solution video thumbnail

Click to load, then click again to play

Written solution:

The number of distinct hands that can be dealt to the player is equal to: (5210)=52!42!10!=101713747461143=158A00A4AA0\begin{align*} &\binom{52}{10} \\ &= \dfrac{52!}{42!\cdot 10!}\\ &=10\cdot 17\cdot 13\cdot 7\cdot 47\cdot 46\cdot 11\cdot 43\\ &= 158A00A4AA0 \end{align*}

Therefore: 1713747461143=158A00A4AA\begin{align*} &17\cdot 13\cdot 7\cdot 47\cdot 46\cdot 11\cdot 43\\ &= 158A00A4AA \end{align*}

To find the units digit, we can find the value of this expression mod 1010: A1713747461143mod107377613mod101963mod1098mod102mod10\begin{align*} A &\equiv 17\cdot 13\cdot 7\cdot 47\cdot \\&46\cdot 11\cdot 43 \bmod{10}\\ &\equiv 7\cdot 3\cdot 7\cdot 7\cdot 6\cdot 1\cdot 3 \bmod{10}\\ &\equiv 1\cdot 9\cdot 6\cdot 3 \bmod{10}\\ &\equiv 9\cdot 8 \bmod{10}\\ &\equiv 2 \bmod{10}\\ \end{align*}

Therefore, as 0A9,0\le A \le 9, and A2mod10,A\equiv 2\bmod{10}, it follows that A=2.A=2.

Thus, A is the correct answer.

20.

Let BB be a right rectangular prism (box) with edges lengths 1,1, 3,3, and 4,4, together with its interior. For real r0,r\geq0, let S(r)S(r) be the set of points in 33-dimensional space that lie within a distance rr of some point in B.B. The volume of S(r)S(r) can be expressed as ar3+br2+cr+d,ar^{3} + br^{2} + cr +d, where a,a, b,b, c,c, and dd are positive real numbers. What is bcad?\dfrac{bc}{ad}?

66

1919

2424

2626

3838

Video solution:
Solution video thumbnail

Click to load, then click again to play

Written solution:

Consider S(r)S(r) at the following regions:

The rectangular prism itself (B):(B):

In this region, r=0,r=0, and therefore the volume of S(0)=d=134=12.S(0) = d = 1\cdot 3\cdot 4 = 12.

The extensions of the faces of B:B:

The volumes of this region are equal to the sums of the volumes of the boxes produced by extending every face on BB to a distance r.r. Therefore, the total volume of this region is: 2(13+14+34)r=38r2(1\cdot 3+1\cdot 4+3\cdot 4)\cdot r = 38r

The quarter-cylinders at each of the edges of B:B:

There are 1212 edges on B,B, meaning that there are 1212 quarter-cylinders. 44 of which have length 4,4,44 of which have length 3,3, and 44 of which have length 2.2. All of these cylinders have radius r.r. Therefore, the volumes is: 144πr2(4+3+1)=8πr2\dfrac 14 \cdot 4\pi r^2(4+3+1)=8\pi r^2

The eighth-spheres at every vertex of B:B:

There are 88 vertices on B,B, and the eighth-sphere corresponding to each one has a radius r.r. As such, the total volume is: 818(43πr3)=43πr38\cdot \dfrac 18\cdot\left(\dfrac 43 \pi r^3\right) =\dfrac 43 \pi r^3

Therefore, the total area enclosed by S(r)=43πr3+8πr2+38r+12S(r) = \dfrac 43 \pi r^3 + 8\pi r^2 + 38r + 12

As such: a=43πa=\dfrac 43 \pi b=8πb= 8\pi c=38c= 38 d=12d=12

Therefore:bcad=838π16π=19\dfrac{bc}{ad} = \dfrac{8\cdot 38\pi}{16\pi} =19

Thus, the correct answer is B.

21.

In square ABCD,ABCD, points EE and HH lie on AB\overline{AB} and DA,\overline{DA}, respectively, so that AE=AH.AE=AH. Points FF and GG lie on BC\overline{BC} and CD,\overline{CD}, respectively, and points II and JJ lie on EH\overline{EH} so that FIEH\overline{FI} \perp \overline{EH} and GJEH.\overline{GJ} \perp \overline{EH}. See the figure below. Triangle AEH,AEH, quadrilateral BFIE,BFIE, quadrilateral DHJG,DHJG, and pentagon FCGJIFCGJI each has area 1.1. What is FI2?FI^2?

73\dfrac73

8428-4\sqrt2

1+21+\sqrt2

742\dfrac74\sqrt2

222\sqrt2

Video solution:
Solution video thumbnail

Click to load, then click again to play

Written solution:

As we know that the sum of the areas of AEH+BFIE+DHJG+FCGJI=1+1+1+1=4,\begin{align*}&AEH+BFIE+ \\&DHJG+FCGJI \\&= 1+1+1+1 \\&= 4,\end{align*} we know that the side length of the square is 2.2.

Similarly, as AEHAEH has an area of 1,1, we know that AH=AE=2.AH=AE=\sqrt{2}.

Now, let us extend the figure as follows:

With the construction of KK as the eventual intersection of FBFB and IE,IE, we can notice that BEKBEK is a right isosceles triangle, with side length 22.2-\sqrt{2}. Therefore, its area is 322.3-2\sqrt{2}.

From this, we can further deduce that FIKFIK is also a right isosceles triangle, with area 12FIIK=12FI2=1+322=422,\begin{align*}\dfrac 12 FI\cdot IK &= \dfrac 12 FI^2 \\&= 1+3-2\sqrt{2} \\&= 4-2\sqrt{2},\end{align*} implying that FI2=842.FI^2 = 8-4\sqrt{2}.

Thus, the correct answer is B.

22.

What is the remainder when 2202+2022^{202} +202 is divided by 2101+251+1?2^{101}+2^{51}+1?

100100

101101

200200

201201

202202

Video solution:
Solution video thumbnail

Click to load, then click again to play

Written solution:

Observe that: 2202+202=(2101)2+22101+122101+201=(2101+1)222101+201=a2b2+201,\begin{align*} 2^{202}+202 &= \left(2^{101}\right)^2+2\cdot 2^{101} +1 \\&-2\cdot 2^{101} + 201 \\ &= \left(2^{101}+1\right)^2 \\&-2\cdot 2^{101} + 201 \\ &= a^2-b^2+201, \end{align*} where a=2101+1a=2^{101}+1 and b=251.b=2^{51}. Thus, by difference of squares: a2b2+201=(a+b)(ab)+201\begin{gather*}a^2-b^2+201\\=(a+b)(a-b)+201\end{gather*} Which means that: 2202+202=(2101+251+1)(2101251+1)+201.\begin{gather*}2^{202}+202 =\\(2^{101}+2^{51}+1)(2^{101}-2^{51}+1)\\+201.\end{gather*} Therefore, 2202+202(2101+251+1)(2101251+1)+201201mod(2101+251+1). \begin{gather*} 2^{202} + 202 \equiv \\ (2^{101}+2^{51}+1)(2^{101}-2^{51}+1)+ \\ 201 \equiv 201 \bmod{(2^{101}+2^{51}+1).} \end{gather*}

Thus, the correct answer is D.

23.

Square ABCDABCD in the coordinate plane has vertices at the points A(1,1),B(1,1),C(1,1),A(1,1), B(-1,1), C(-1,-1), and D(1,1).D(1,-1). Consider the following four transformations:

L,L, a rotation of 9090^{\circ} counterclockwise around the origin;

R,R, a rotation of 9090^{\circ} clockwise around the origin;

H,H, a reflection across the xx-axis; and

V,V, a reflection across the yy-axis.

Each of these transformations maps the squares onto itself, but the positions of the labeled vertices will change. For example, applying RR and then VV would send the vertex AA at (1,1)(1,1) to (1,1)(-1,-1) and would send the vertex BB at (1,1)(-1,1) to itself. How many sequences of 2020 transformations chosen from {L,R,H,V}\{L, R, H, V\} will send all of the labeled vertices back to their original positions? (For example, R,R,V,HR, R, V, H is one sequence of 44 transformations that will send the vertices back to their original positions.)

2372^{37}

32363\cdot 2^{36}

2382^{38}

32373\cdot2^{37}

2392^{39}

Video solution:
Solution video thumbnail

Click to load, then click again to play

Written solution:

Notice that all of these transformations result in each vertex being moved to some adjacent vertex. For example, after one transformation, vertex AA will always be at either (1,1)(-1,1) or (1,1).(1,-1).

It follows that after any odd number of transformations, vertex AA will always be either in quadrant II or IV, and after any even number of transformations, AA will always be in either quadrant I or III. This rule holds for all other vertices, and after 1919 moves, we are left with the following four possible states:

(ABDC)\begin{pmatrix}A&B\\D&C\end{pmatrix}

(CBDA)\begin{pmatrix}C&B\\D&A\end{pmatrix}

(ADBC)\begin{pmatrix}A&D\\B&C\end{pmatrix}

(CDBA)\begin{pmatrix}C&D\\B&A\end{pmatrix}

From each of these positions, it is possible to return to the original position with only one transformation as transformation 2020: In order, they are V,L,R,H.V,L,R,H.

As such, as there are 4194^{19} ways to make the first 1919 transformations, and all of these transformations lead to one of four final configurations, each with one valid move to get back to the original position, we conclude that there are exactly 419=2384^{19} = 2^{38} sequences of 2020 transformations that map the square back to its original position.

Thus, C is the correct answer.

24.

How many positive integers nn satisfy n+100070=n?\dfrac{n+1000}{70} = \lfloor \sqrt{n} \rfloor?

(Recall that x\lfloor x\rfloor is the greatest integer not exceeding x.x.)

22

44

66

3030

3232

Video solution:
Solution video thumbnail

Click to load, then click again to play

Written solution:

We know that by definition that xx<x+1.\lfloor x\rfloor\le x < \lfloor x \rfloor+1 . Therefore: n+100070n<n+107070\dfrac{n+1000}{70} \le \sqrt{n} < \dfrac{n+1070}{70} Solving each inequality separately: n+100070nn+100070nn70n+10000(n50)(n20)0\begin{align*} \dfrac{n+1000}{70} &\le \sqrt{n}\\ n+1000 &\le 70\sqrt{n}\\ n-70\sqrt{n}+1000 &\le 0\\ (\sqrt{n}-50)(\sqrt{n}-20) &\le 0 \end{align*} 20n50400n2500 \begin{gather*} 20\le \sqrt{n} \le 50\\ 400\le n \le 2500 \end{gather*} and n<n+1070700<n70n+1070.\begin{gather*} \sqrt{n} < \dfrac{n+1070}{70} \\ 0 < n-70\sqrt{n}+1070. \end{gather*} Using the qudratic formula yields n<35155 \sqrt{n} < 35-\sqrt{155} 0n<138070155 0 \le n < 1380-70\sqrt{155} or n>35+155 \sqrt{n} > 35+\sqrt{155} 1380+70155<n. 1380+70\sqrt{155} < n.

Therefore, as we now know that nn is in the interval [400,138070155)[400,1380-70\sqrt{155}) or in (1380+70155,2500].(1380+70\sqrt{155},2500].

Furthermore, we know that nn is an integer, and as n+100070=n\dfrac{n+1000}{70} = \lfloor \sqrt{n} \rfloor must be an integer, then it follows that: n+10000mod70n+1000 \equiv 0 \bmod{70} n+200mod70n+20 \equiv 0 \bmod{70} n20mod70n \equiv -20 \bmod{70} n50mod70n \equiv 50 \bmod{70} As such, n=70k+50,n=70k+50, for some integer k.k. Therefore, we substitute to see that: k[5,19155)k \in [5,19-\sqrt{155})    k[5,6] \implies k \in [5,6] or k(19+155,35]k \in (19+\sqrt{155},35]    k[32,35].\implies k \in [32,35]. And so, we have 66 values of k,k, and as each kk corresponds to exactly one n,n, we have 66 solutions for n.n.

Thus, C is the correct answer.

25.

Let D(n)D(n) denote the number of ways of writing the positive integer nn as a product n=f1f2fk,n = f_1\cdot f_2\cdots f_k, where k1,k\ge1, the fif_i are integers strictly greater than 1,1, and the order in which the factors are listed matters (that is, two representations that differ only in the order of the factors are counted as distinct). For example, the number 66 can be written as 6,6, 23,2\cdot 3, and 32,3\cdot2, so D(6)=3.D(6) = 3. What is D(96)?D(96)?

112112

128128

144144

172172

184184

Video solution:
Solution video thumbnail

Click to load, then click again to play

Written solution:

Notice that 96=253.96=2^5\cdot 3. To find all the ways to factor 9696 with the conditions listed above, we must find all the ways to group our five 22's and one 33 such that each group has at least one element, from which we multiply all the elements in each group to get our factor pair.

This can be solved using a method similar to stars and bars, as we can depict this situation as: (2,2,,2,2,2,,3)=483(2,2,|,2,2,2,|,3) = 4\cdot 8\cdot 3 Where we have kk groups created by k1k-1 dividers, and as we have 6 ways to arrange the prime factors and 252^5 ways to place the dividers such that each group has at least one element, we have 6256\cdot 2^5 total ways to arrange factors.

However, we must notice that whenever we have a group that includes 33 and at least one other prime factor (i.e. any groups that have a product of 6,12,24,48,966,12,24,48,96) such that the factor that this group represents is of the form 32i,3\cdot 2^i, then we will overcount this case by a factor of i+1.i+1. In other words, we double count our 66's, triple count our 1212's, and quadruple count our 2424's.

This is because we consider different arrangements within a group to constitute entirely different groups, when in fact, they are the same. For example: (2,2,,2,3,,2,2)=464(2,2,|,2,3,|,2,2) = 4\cdot 6 \cdot 4 (2,2,,3,2,,2,2)=464(2,2,|,3,2,|,2,2) = 4\cdot 6 \cdot 4 both represent the same factor triple, but are considered to be distinct.

We must compensate for this overcounting by counting the number of these distinct but equal cases and subtracting. To do this, consider all cases where 33 is grouped with at least one 2.2. This can be similarly represented as the previous case, only this time with four 22's and one 66 (as 6=236=2\cdot 3), resulting in groups such as: (2,2,2,,2,6)(2,2,2,|,2,6) With this representation, there are 55 ways to arrange the elements, and 242^4 ways to place dividers, and as such, there are 5245\cdot 2^4 overcounted cases.

Therefore, all that is left is to subtract our overcount, and from this, we see that D(96)=625524=24(125)=716=112\begin{align*}D(96) &= 6\cdot 2^5 - 5\cdot 2^4 \\&= 2^4 (12-5) \\&= 7\cdot 16 \\&= 112 \end{align*}

Thus, A is the correct answer.