Found problems: 85335
[b]p1.[/b] What is the largest number of five dollar footlongs Jimmy can buy with 88 dollars?
[b]p2.[/b] Austin, Derwin, and Sylvia are deciding on roles for BMT $2021$. There must be a single Tournament Director and a single Head Problem Writer, but one person cannot take on both roles. In how many ways can the roles be assigned to Austin, Derwin, and Sylvia?
[b]p3.[/b] Sofia has$ 7$ unique shirts. How many ways can she place $2$ shirts into a suitcase, where the order in which Sofia places the shirts into the suitcase does not matter?
[b]p4.[/b] Compute the sum of the prime factors of $2021$.
[b]p5.[/b] A sphere has volume $36\pi$ cubic feet. If its radius increases by $100\%$, then its volume increases by $a\pi$ cubic feet. Compute $a$.
[b]p6.[/b] The full price of a movie ticket is $\$10$, but a matinee ticket to the same movie costs only $70\%$ of the full price. If $30\%$ of the tickets sold for the movie are matinee tickets, and the total revenue from movie tickets is $\$1001$, compute the total number of tickets sold.
[b]p7.[/b] Anisa rolls a fair six-sided die twice. The probability that the value Anisa rolls the second time is greater than or equal to the value Anisa rolls the first time can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[b]p8.[/b] Square $ABCD$ has side length $AB = 6$. Let point $E$ be the midpoint of $\overline{BC}$. Line segments $\overline{AC}$ and $\overline{DE}$ intersect at point $F$. Compute the area of quadrilateral ABEF.
[b]p9.[/b] Justine has a large bag of candy. She splits the candy equally between herself and her $4$ friends, but she needs to discard three candies before dividing so that everyone gets an equal number of candies. Justine then splits her share of the candy between herself and her two siblings, but she needs to discard one candy before dividing so that she and her siblings get an equal number of candies. If Justine had instead split all of the candy that was originally in the large bag between herself and $14$ of her classmates, what is the fewest number of candies that she would need to discard before dividing so that Justine and her $14$ classmates get an equal number of candies?
[b]p10.[/b] For some positive integers $a$ and $b$, $a^2 - b^2 = 400$. If $a$ is even, compute $a$.
[b]p11.[/b] Let $ABCDEFGHIJKL$ be the equilateral dodecagon shown below, and each angle is either $90^o$ or $270^o$. Let $M$ be the midpoint of $\overline{CD}$, and suppose $\overline{HM}$ splits the dodecagon into two regions. The ratio of the area of the larger region to the area of the smaller region can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[img]https://cdn.artofproblemsolving.com/attachments/3/e/387bcdf2a6c39fcada4f21f24ceebd18a7f887.png[/img]
[b]p12.[/b] Nelson, who never studies for tests, takes several tests in his math class. Each test has a passing score of $60/100$. Since Nelson's test average is at least $60/100$, he manages to pass the class. If only nonnegative integer scores are attainable on each test, and Nelson gets a dierent score on every test, compute the largest possible ratio of tests failed to tests passed. Assume that for each test, Nelson either passes it or fails it, and the maximum possible score for each test is 100.
[b]p13.[/b] For each positive integer $n$, let $f(n) = \frac{n}{n+1} + \frac{n+1}{n}$ . Then $f(1)+f(2)+f(3)+...+f(10)$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[b]p14.[/b] Triangle $\vartriangle ABC$ has point $D$ lying on line segment $\overline{BC}$ between $B$ and $C$ such that triangle $\vartriangle ABD$ is equilateral. If the area of triangle $\vartriangle ADC$ is $\frac14$ the area of triangle $\vartriangle ABC$, then $\left( \frac{AC}{AB}\right)^2$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[b]p15.[/b] In hexagon $ABCDEF$, $AB = 60$, $AF = 40$, $EF = 20$, $DE = 20$, and each pair of adjacent edges are perpendicular to each other, as shown in the below diagram. The probability that a random point inside hexagon $ABCDEF$ is at least $20\sqrt2$ units away from point $D$ can be expressed in the form $\frac{a-b\pi}{c}$ , where $a$, $b$, $c$ are positive integers such that gcd$(a, b, c) = 1$. Compute $a + b + c$.
[img]https://cdn.artofproblemsolving.com/attachments/3/c/1b45470265d10a73de7b83eff1d3e3087d6456.png[/img]
[b]p16.[/b] The equation $\sqrt{x} +\sqrt{20-x} =\sqrt{20 + 20x - x^2}$ has $4$ distinct real solutions, $x_1$, $x_2$, $x_3$, and $x_4$. Compute $x_1 + x_2 + x_3 + x_4$.
[b]p17.[/b] How many distinct words with letters chosen from $B, M, T$ have exactly $12$ distinct permutations, given that the words can be of any length, and not all the letters need to be used? For example, the word $BMMT$ has $12$ permutations. Two words are still distinct even if one is a permutation of the other. For example, $BMMT$ is distinct from $TMMB$.
[b]p18.[/b] We call a positive integer binary-okay if at least half of the digits in its binary (base $2$) representation are $1$'s, but no two $1$s are consecutive. For example, $10_{10} = 1010_2$ and $5_{10} = 101_2$ are both binary-okay, but $16_{10} = 10000_2$ and $11_{10} = 1011_2$ are not. Compute the number of binary-okay positive integers less than or equal to $2020$ (in base $10$).
[b]p19.[/b] A regular octahedron (a polyhedron with $8$ equilateral triangles) has side length $2$. An ant starts on the center of one face, and walks on the surface of the octahedron to the center of the opposite face in as short a path as possible. The square of the distance the ant travels can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[img]https://cdn.artofproblemsolving.com/attachments/f/8/3aa6abe02e813095e6991f63fbcf22f2e0431a.png[/img]
[b]p20.[/b] The sum of $\frac{1}{a}$ over all positive factors $a$ of the number $360$ can be expressed in the form $\frac{m}{n}$ ,where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
A planar country has an odd number of cities separated by pairwise distinct distances. Some of these cities are connected by direct two-way flights. Each city is directly connected to exactly two ther cities, and the latter are located farthest from it. Prove that, using these flights, one may go from any city to any other city
Let $ABC$ be an acute, scalene triangle with orthocentre $H$. Let $\ell_a$ be the line through the reflection of $B$ with respect to $CH$ and the reflection of $C$ with respect to $BH$. Lines $\ell_b$ and $\ell_c$ are defined similarly. Suppose lines $\ell_a$, $\ell_b$, and $\ell_c$ determine a triangle $\mathcal T$.
Prove that the orthocentre of $\mathcal T$, the circumcentre of $\mathcal T$, and $H$ are collinear.
[i]Fedir Yudin, Ukraine[/i]
Is the set of positive integers $n$ such that $n!+1$ divides $(2012n)!$ finite or infinite?
[i]Proposed by Fedor Petrov, St. Petersburg State University.[/i]
$ \sum_{cyc}\frac{1}{\left(\text{tg} y+\text{tg} z\right) \text{cos}^2 x} \ge 3, $ for any $ x,y,z\in (0,\pi/2) $
[i]Carmen[/i] and [i]Viorel Botea[/i]
Each lattice point with nonnegative coordinates is labeled with a nonnegative integer in such away that the point $(0, 0)$ is labeled by $0$, and for every $x, y \geq 0$, the set of numbers labeled on thepoints $(x, y), (x, y + 1),$ and $(x + 1, y)$ is $\{n, n + 1, n + 2\}$ for some nonnegative integer $n$. Determine,with proof, all possible labels for the point $(2000, 2024)$.
Let $ A,B,S $ be three $ 3\times 3 $ complex matrices with $ B=S^{-1}AS , $ and $ S $ nonsingular. Show:
$$ \text{tr} \left( B^2\right) +2\text{tr}(C(B)) = \left(\text{tr} (A)\right)^2 , $$
where $ C(B) $ is the cofactor of $ B. $
[i]Mihai Haivas[/i]
Let $A$ be a ring with $2^n+1$ elements, where $n$ is a positive integer and let
\[ M = \{ k \in\mathbb{Z} \mid k \geq 2, \ x^k =x , \ \forall \ x\in A \} . \]
Prove that the following statements are equivalent:
a) $A$ is a field;
b) $M$ is not empty and the smallest element in $M$ is $2^n+1$.
[i]Marian Andronache[/i]
Prove that \[ \gcd{\left({n \choose 1},{n \choose 2},\dots,{n \choose {n - 1}}\right)} \] is a prime if $n$ is a power of a prime, and 1 otherwise.
Let $ n > 1$ be an integer, and $ n$ can divide $ 2^{\phi(n)} \plus{} 3^{\phi(n)} \plus{} \cdots \plus{} n^{\phi(n)},$ let $ p_{1},p_{2},\cdots,p_{k}$ be all distinct prime divisors of $ n$. Show that $ \frac {1}{p_{1}} \plus{} \frac {1}{p_{2}} \plus{} \cdots \plus{} \frac {1}{p_{k}} \plus{} \frac {1}{p_{1}p_{2}\cdots p_{k}}$ is an integer. ( where $ \phi(n)$ is defined as the number of positive integers $ \leq n$ that are relatively prime to $ n$.)
Amy has a $2 \times 10$ puzzle grid which she can use $1 \times 1$ and $1 \times 2$ (1 vertical, 2 horizontal) tiles to cover. How many ways can she exactly cover the grid without any tiles overlapping and without rotating the tiles?
For a positive integer $n$, let $d(n)$ be the number of positive divisors of $n$, and let $\varphi(n)$ be the number of positive integers not exceeding $n$ which are coprime to $n$. Does there exist a constant $C$ such that
$$ \frac {\varphi ( d(n))}{d(\varphi(n))}\le C$$
for all $n\ge 1$
[i]Cyprus[/i]
The integers $1, 2, \dots, n$ are written in order on a long slip of paper. The slip is then cut into five pieces, so that each piece consists of some (nonempty) consecutive set of integers. The averages of the numbers on the five slips are $1234$, $345$, $128$, $19$, and $9.5$ in some order. Compute $n$.
[i]Proposed by Evan Chen[/i]
Prove that if in the following fraction we have $n$ radicals in the numerator and $n - 1$ in the denominator, then
$$\frac{2-\sqrt{2+\sqrt{2+...+\sqrt{2}}}}{2-\sqrt{2+\sqrt{2+...+\sqrt{2}}}}>\frac14$$
Six chairs sit in a row. Six people randomly seat themselves in the chairs. Each person randomly chooses either to set their feet on the floor, to cross their legs to the right, or to cross their legs to the left. There is only a problem if two people sitting next to each other have the person on the right crossing their legs to the left and the person on the left crossing their legs to the right. The probability that this will [b]not[/b] happen is given by $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
In the acute-angled triangle $ABC$ all angles are greater than $45^o$. Let $AM$ and $BN$ be the heights of this triangle and let $X$ and $Y$ be the points on $MA$ and $NB$, respecively, such that $|MX| =|MB|$ and $|NY| =|NA|$. Prove that $MN$ and $XY$ are parallel.
[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$
($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits).
[b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table:
the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game.
a) The player who makes the first move can win the game. What is the winning first move?
b) How can he win? (Describe his strategy.)
[b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover?
[b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back.
[b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line.
(b) Do the same with $6$ points.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
[b]Problem 3[/b] : Let $x_1,x_2,\cdots,x_{2022}$ be non-negative real numbers such that $$x_k + x_{k+1}+x_{k+2} \leq 2$$ for all $k = 1,2,\cdots,2020$. Prove that $$\sum_{k=1}^{2020}x_kx_{k+2}\leq 1010$$
The following diagram shows a grid of $36$ cells. Find the number of rectangles pictured in the diagram that contain at least three cells of the grid.
[img]https://cdn.artofproblemsolving.com/attachments/a/4/e9ba3a35204ec68c17a364ebf92cc107eb4d7a.png[/img]
Triangle $ABC$ is given in a plane. Draw the bisectors of all three of its angles. Then draw the line that connects the points where the bisectors of angles $ABC$ and $ACB$ meet the opposite sides of the triangle. Through the point of intersection of this line and the bisector of angle $BAC$, draw another line parallel to $BC$. Let this line intersect $AB$ in $M$ and $AC$ in $N$. Prove that $2MN = BM+CN$.
Let \(\mathcal{F}\) be a family of functions from \(\mathbb{R}^+ \to \mathbb{R}^+\). It is known that for all \( f, g \in \mathcal{F} \), there exists \( h \in \mathcal{F} \) such that for all \( x, y \in \mathbb{R}^+ \), the following equation holds:
\[
y^2 \cdot f\left(\frac{g(x)}{y}\right) = h(xy)
\]
Prove that for all \( f \in \mathcal{F} \) and all \( x \in \mathbb{R}^+ \), the following identity is satisfied:
\[
f\left(\frac{x}{f(x)}\right) = 1.
\]
Joe has a triangle with area $\sqrt{3}.$ What's the smallest perimeter it could have?
We have a square of side $1$ and a number $\ell$ such that $0 <\ell <\sqrt2$. Two players $A$ and $B$, in turn, draw in the square an open segment (without its two ends) of length $\ell $, starts A. Each segment after the first cannot have points in common with the previously drawn segments. He loses the player who cannot make his play. Determine if either player has a winning strategy.
Colin has a peculiar $12$-sided dice: it is made up of two regular hexagonal pyramids. Colin wants to paint each face one of three colors so that no two adjacent faces on the same pyramid have the same color. How many ways can he do this? Two paintings are considered identical if there is a way to rotate or flip the dice to go from one to the other. Faces are adjacent if they share an edge.
[center][img]https://cdn.artofproblemsolving.com/attachments/b/2/074e9a4bc404d45546661a5ae269248d20ed5a.png[/img][/center]
At noon on a certain day, Minneapolis is $N$ degrees warmer than St. Louis. At $4{:}00$ the temperature in Minneapolis has fallen by $5$ degrees while the temperature in St. Louis has risen by $3$ degrees, at which time the temperatures in the two cities differ by $2$ degrees. What is the product of all possible values of $N?$
$(\textbf{A})\: 10\qquad(\textbf{B}) \: 30\qquad(\textbf{C}) \: 60\qquad(\textbf{D}) \: 100\qquad(\textbf{E}) \: 120$