This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 9

2021 Stanford Mathematics Tournament, R1

[b]p1.[/b] A rectangular pool has diagonal $17$ units and area $120$ units$^2$. Joey and Rachel start on opposite sides of the pool when Rachel starts chasing Joey. If Rachel runs $5$ units/sec faster than Joey, how long does it take for her to catch him? [b]p2. [/b] Alice plays a game with her standard deck of $52$ cards. She gives all of the cards number values where Aces are $1$’s, royal cards are $10$’s and all other cards are assigned their face value. Every turn she flips over the top card from her deck and creates a new pile. If the flipped card has value $v$, she places $12 - v$ cards on top of the flipped card. For example: if she flips the $3$ of diamonds then she places $9$ cards on top. Alice continues creating piles until she can no longer create a new pile. If the number of leftover cards is $4$ and there are $5$ piles, what is the sum of the flipped over cards? [b]p3.[/b] There are $5$ people standing at $(0, 0)$, $(3, 0)$, $(0, 3)$, $(-3, 0)$, and $(-3, 0)$ on a coordinate grid at a time $t = 0$ seconds. Each second, every person on the grid moves exactly $1$ unit up, down, left, or right. The person at the origin is infected with covid-$19$, and if someone who is not infected is at the same lattice point as a person who is infected, at any point in time, they will be infected from that point in time onwards. (Note that this means that if two people run into each other at a non-lattice point, such as $(0, 1.5)$, they will not infect each other.) What is the maximum possible number of infected people after $t = 7$ seconds? [b]p4.[/b] Kara gives Kaylie a ring with a circular diamond inscribed in a gold hexagon. The diameter of the diamond is $2$ mm. If diamonds cost $\$100/ mm ^2$ and gold costs $\$50 /mm ^2$ , what is the cost of the ring? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R5

[b]p17.[/b] Let the roots of the polynomial $f(x) = 3x^3 + 2x^2 + x + 8 = 0$ be $p, q$, and $r$. What is the sum $\frac{1}{p} +\frac{1}{q} +\frac{1}{r}$ ? [b]p18.[/b] Two students are playing a game. They take a deck of five cards numbered $1$ through $5$, shuffle them, and then place them in a stack facedown, turning over the top card next to the stack. They then take turns either drawing the card at the top of the stack into their hand, showing the drawn card to the other player, or drawing the card that is faceup, replacing it with the card on the top of the pile. This is repeated until all cards are drawn, and the player with the largest sum for their cards wins. What is the probability that the player who goes second wins, assuming optimal play? [b]p19.[/b] Compute the sum of all primes $p$ such that $2^p + p^2$ is also prime. [b]p20.[/b] In how many ways can one color the $8$ vertices of an octagon each red, black, and white, such that no two adjacent sides are the same color? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R2

[b]p5.[/b] Find the number of three-digit integers that contain at least one $0$ or $5$. The leading digit of the three-digit integer cannot be zero. [b]p6.[/b] What is the sum of the solutions to $\frac{x+8}{5x+7} =\frac{x+8}{7x+5}$ [b]p7.[/b] Let $BC$ be a diameter of a circle with center $O$ and radius $4$. Point $A$ is on the circle such that $\angle AOB = 45^o$. Point $D$ is on the circle such that line segment$ OD$ intersects line segment $AC$ at $E$ and $OD$ bisects $\angle AOC$. Compute the area of $ADE$, which is enclosed by line segments $AE$ and $ED$ and minor arc $AD$. [b]p8. [/b] William is a bacteria farmer. He would like to give his fiance$ 2021$ bacteria as a wedding gift. Since he is an intelligent and frugal bacteria farmer, he would like to add the least amount of bacteria on his favorite infinite plane petri dish to produce those $2021$ bacteria. The infinite plane petri dish starts off empty and William can add as many bacteria as he wants each day. Each night, all the bacteria reproduce through binary fission, splitting into two. If he has infinite amount of time before his wedding day, how many bacteria should he add to the dish in total to use the least number of bacteria to accomplish his nuptial goals? PS. You should use hide for answers Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R8

[b]p29.[/b] Consider pentagon $ABCDE$. How many paths are there from vertex $A$ to vertex $E$ where no edge is repeated and does not go through $E$. [b]p30.[/b] Let $a_1, a_2, ...$ be a sequence of positive real numbers such that $\sum^{\infty}_{n=1} a_n = 4$. Compute the maximum possible value of $\sum^{\infty}_{n=1}\frac{\sqrt{a_n}}{2^n}$ (assume this always converges). [b]p31.[/b] Define function $f(x) = x^4 + 4$. Let $$P =\prod^{2021}_{k=1} \frac{f(4k - 1)}{f(4k - 3)}.$$ Find the remainder when $P$ is divided by $1000$. [b]p32.[/b] Reduce the following expression to a simplified rational: $\cos^7 \frac{\pi}{9} + \cos^7 \frac{5\pi}{9}+ \cos^7 \frac{7\pi}{9}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R4

[b]p13.[/b] Emma has the five letters: $A, B, C, D, E$. How many ways can she rearrange the letters into words? Note that the order of words matter, ie $ABC DE$ and $DE ABC$ are different. [b]p14.[/b] Seven students are doing a holiday gift exchange. Each student writes their name on a slip of paper and places it into a hat. Then, each student draws a name from the hat to determine who they will buy a gift for. What is the probability that no student draws himself/herself? [b]p15.[/b] We model a fidget spinner as shown below (include diagram) with a series of arcs on circles of radii $1$. What is the area swept out by the fidget spinner as it’s turned $60^o$ ? [img]https://cdn.artofproblemsolving.com/attachments/9/8/db27ffce2af68d27eee5903c9f09a36c2a6edf.png[/img] [b]p16.[/b] Let $a,b,c$ be the sides of a triangle such that $gcd(a, b) = 3528$, $gcd(b, c) = 1008$, $gcd(a, c) = 504$. Find the value of $a * b * c$. Write your answer as a prime factorization. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R6

[b]p21[/b]. If $f = \cos(\sin (x))$. Calculate the sum $\sum^{2021}_{n=0} f'' (n \pi)$. [b]p22.[/b] Find all real values of $A$ that minimize the difference between the local maximum and local minimum of $f(x) = \left(3x^2 - 4\right)\left(x - A + \frac{1}{A}\right)$. [b]p23.[/b] Bessie is playing a game. She labels a square with vertices labeled $A, B, C, D$ in clockwise order. There are $7$ possible moves: she can rotate her square $90$ degrees about the center, $180$ degrees about the center, $270$ degrees about the center; or she can flip across diagonal $AC$, flip across diagonal $BD$, flip the square horizontally (flip the square so that vertices A and B are switched and vertices $C$ and $D$ are switched), or flip the square vertically (vertices $B$ and $C$ are switched, vertices $A$ and $D$ are switched). In how many ways can Bessie arrive back at the original square for the first time in $3$ moves? [b]p24.[/b] A positive integer is called [i]happy [/i] if the sum of its digits equals the two-digit integer formed by its two leftmost digits. Find the number of $5$-digit happy integers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R7

[b]p25.[/b] Compute: $$\frac{ \sum^{\infty}_{i=0}\frac{(2\pi)^{4i+1}}{(4i+1)!}}{\sum^{\infty}_{i=0}\frac{(2\pi)^{4i+1}}{(4i+3)!}}$$ [b]p26.[/b] Suppose points $A, B, C, D$ lie on a circle $\omega$ with radius $4$ such that $ABCD$ is a quadrilateral with $AB = 6$, $AC = 8$, $AD = 7$. Let $E$ and $F$ be points on $\omega$ such that $AE$ and $AF$ are respectively the angle bisectors of $\angle BAC$ and $\angle DAC$. Compute the area of quadrilateral $AECF$. [b]p27.[/b] Let $P(x) = x^2 - ax + 8$ with a a positive integer, and suppose that $P$ has two distinct real roots $r$ and $s$. Points $(r, 0)$, $(0, s)$, and $(t, t)$ for some positive integer t are selected on the coordinate plane to form a triangle with an area of $2021$. Determine the minimum possible value of $a + t$. [b]p28.[/b] A quartic $p(x)$ has a double root at $x = -\frac{21}{4}$ , and $p(x) - 1344x$ has two double roots each $\frac14$ less than an integer. What are these two double roots? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R3

[b]p9.[/b] The frozen yogurt machine outputs yogurt at a rate of $5$ froyo$^3$/second. If the bowl is described by $z = x^2+y^2$ and has height $5$ froyos, how long does it take to fill the bowl with frozen yogurt? [b]p10.[/b] Prankster Pete and Good Neighbor George visit a street of $2021$ houses (each with individual mailboxes) on alternate nights, such that Prankster Pete visits on night $1$ and Good Neighbor George visits on night $2$, and so on. On each night $n$ that Prankster Pete visits, he drops a packet of glitter in the mailbox of every $n^{th}$ house. On each night $m$ that Good Neighbor George visits, he checks the mailbox of every $m^{th}$ house, and if there is a packet of glitter there, he takes it home and uses it to complete his art project. After the $2021^{th}$ night, Prankster Pete becomes enraged that none of the houses have yet checked their mail. He then picks three mailboxes at random and takes out a single packet of glitter to dump on George’s head, but notices that all of the mailboxes he visited had an odd number of glitter packets before he took one. In how many ways could he have picked these three glitter packets? Assume that each of these three was from a different house, and that he can only visit houses in increasing numerical order. [b]p11. [/b]The taxi-cab length of a line segment with endpoints $(x_1, y_1)$ and $(x_2, y_2)$ is $|x_1 - x_2| + |y_1- y_2|$. Given a series of straight line segments connected head-to-tail, the taxi-cab length of this path is the sum of the taxi-cab lengths of its line segments. A goat is on a rope of taxi-cab length $\frac72$ tied to the origin, and it can’t enter the house, which is the three unit squares enclosed by $(-2, 0)$,$(0, 0)$,$(0, -2)$,$(-1, -2)$,$(-1, -1)$,$(-2, -1)$. What is the area of the region the goat can reach? (Note: the rope can’t ”curve smoothly”-it must bend into several straight line segments.) [b]p12.[/b] Parabola $P$, $y = ax^2 + c$ has $a > 0$ and $c < 0$. Circle $C$, which is centered at the origin and lies tangent to $P$ at $P$’s vertex, intersects $P$ at only the vertex. What is the maximum value of a, possibly in terms of $c$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Stanford Mathematics Tournament, R9

[b]p33.[/b] Lines $\ell_1$ and $\ell_2$ have slopes $m_1$ and $m_2$ such that $0 < m_2 < m_1$. $\ell'_1$ and $\ell'_2$ are the reflections of $\ell_1$ and $\ell_2$ about the line $\ell_3$ defined by $y = x$. Let $A = \ell_1 \cap \ell_2 = (5, 4)$, $B = \ell_1 \cap \ell_3$, $C = \ell'_1 \cap \ell'_2$ and $D = \ell_2 \cap \ell_3$. If $\frac{4-5m_1}{-5-4m_1} = m_2$ and $\frac{(1+m^2_1)(1+m^2_2)}{(1-m_1)^2(1-m_2)^2} = 41$, compute the area of quadrilateral $ABCD$. [b]p34.[/b] Suppose $S(m, n) = \sum^m_{i=1}(-1)^ii^n$. Compute the remainder when $S(2020, 4)$ is divided by $S(1010, 2)$. [b]p35.[/b] Let $N$ be the number of ways to place the numbers $1, 2, ..., 12$ on a circle such that every pair of adjacent numbers has greatest common divisor $1$. What is $N/144$? (Arrangements that can be rotated to yield each other are the same). [b]p36.[/b] Compute the series $\sum_{n=1}^{\infty} \frac{(-1)^{n-1}}{{2n \choose 2}} =\frac{1}{{2 \choose 2}} - \frac{1}{{4 \choose 2}} +\frac{1}{{6 \choose 2}} -\frac{1}{{8 \choose 2}} -\frac{1}{{10 \choose 2}}+\frac{1}{{12 \choose 2}} +...$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].