Found problems: 4275
[b]p1.[/b] How many two-digit primes have a units digit of $3$?
[b]p2.[/b] How many ways can you arrange the letters $A$, $R$, and $T$ such that it makes a three letter combination? Each letter is used once.
[b]p3.[/b] Hanna and Kevin are running a $100$ meter race. If Hanna takes $20$ seconds to finish the race and Kevin runs $15$ meters per second faster than Hanna, by how many seconds does Kevin finish before Hanna?
[b]p4.[/b] It takes an ant $3$ minutes to travel a $120^o$ arc of a circle with radius $2$. How long (in minutes) would it take the ant to travel the entirety of a circle with radius $2022$?
[b]p5.[/b] Let $\vartriangle ABC$ be a triangle with angle bisector $AD$. Given $AB = 4$, $AD = 2\sqrt2$, $AC = 4$, find the area of $\vartriangle ABC$.
[b]p6.[/b] What is the coefficient of $x^5y^2$ in the expansion of $(x + 2y + 4)^8$?
[b]p7.[/b] Find the least positive integer $x$ such that $\sqrt{20475x}$ is an integer.
[b]p8.[/b] What is the value of $k^2$ if $\frac{x^5 + 3x^4 + 10x^2 + 8x + k}{x^3 + 2x + 4}$ has a remainder of $2$?
[b]p9.[/b] Let $ABCD$ be a square with side length $4$. Let $M$, $N$, and $P$ be the midpoints of $\overline{AB}$, $\overline{BC}$ and $\overline{CD}$, respectively. The area of the intersection between $\vartriangle DMN$ and $\vartriangle ANP$ can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$.
[b]p10.[/b] Let $x$ be all the powers of two from $2^1$ to $2^{2023}$ concatenated, or attached, end to end ($x = 2481632...$). Let y be the product of all the powers of two from $2^1$ to $2^{2023}$ ($y = 2 \cdot 4 \cdot 8 \cdot 16 \cdot 32... $ ). Let 2a be the largest power of two that divides $x$ and $2^b$ be the largest power of two that divides $y$. Compute $\frac{b}{a}$ .
[b]p11.[/b] Larry is making a s’more. He has to have one graham cracker on the top and one on the bottom, with eight layers in between. Each layer can made out of chocolate, more graham crackers, or marshmallows. If graham crackers cannot be placed next to each other, how many ways can he make this s’more?
[b]p12.[/b] Let $ABC$ be a triangle with $AB = 3$, $BC = 4$, $AC = 5$. Circle $O$ is centered at $B$ and has radius $\frac{8\sqrt{3}}{5}$ . The area inside the triangle but not inside the circle can be written as $\frac{a-b\sqrt{c}-d\pi}{e}$ , where $gcd(a, b, d, e) =1$ and $c$ is squarefree. Find $a + b + c + d + e$.
[b]p13.[/b] Let $F(x)$ be a quadratic polynomial. Given that $F(x^2 - x) = F (2F(x) - 1)$ for all $x$, the sum of all possible values of $F(2022)$ can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$.
[b]p14.[/b] Find the sum of all positive integers $n$ such that $6\phi (n) = \phi (5n)+8$, where $\phi$ is Euler’s totient function.
Note: Euler’s totient $(\phi)$ is a function where $\phi (n)$ is the number of positive integers less than and relatively prime to $n$. For example, $\phi (4) = 2$ since only $1$, $3$ are the numbers less than and relatively prime to $4$.
[b]p15.[/b] Three numbers $x$, $y$, and $z$ are chosen at random from the interval $[0, 1]$. The probability that there exists an obtuse triangle with side lengths $x$, $y$, and $z$ can be written in the form $\frac{a\pi-b}{c}$ , where $a$, $b$, $c$ are positive integers with $gcd(a, b, c) = 1$. Find $a + b + c$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all polynomials $P,Q \in Z[x]$ such that every positive integer is a divisor of a certain nonzero term of the sequence $(x_n)_{n=0}^{\infty}$ given by the conditions:
$x_0 = 2016$, $x_{2n+1} = P(x_{2n})$, $x_{2n+2} = Q(x_{2n+1})$ for all $n \ge 0$
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
Kelvin has a set of eight vertices. For each pair of distinct vertices, Kelvin independently draws an edge between them with probability $p \in (0,1).$ A set $S$ of four distinct vertices is called [i]good[/i] if there exists an edge between $v$ and $w$ for all $v,w \in S$ with $v \neq w.$ The variance of the number of good sets can be expressed as a polynomial $f(p)$ in the variable $p.$ Find the sum of the absolute values of the coefficients of $f(p).$
(The [i]variance[/i] of a random variable $X$ is defined as $\mathbb{E}[X^2]-\mathbb{E}[X]^2.$)
Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that
\[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]
Let $f(z)=\frac{z+a}{z+b}$ and $g(z)=f(f(z))$, where $a$ and $b$ are complex numbers. Suppose that $|a|=1$ and $g(g(z))=z$ for all $z$ for which $g(g(z))$ is defined. What is the difference between the largest and smallest possible values of $|b|$?
$\textbf{(A)}\ 0 \qquad
\textbf{(B)}\ \sqrt{2}-1 \qquad
\textbf{(C)}\ \sqrt{3}-1 \qquad
\textbf{(D)}\ 1 \qquad
\textbf{(E)}\ 2$
Two numbers are written on each vertex of a convex $100$-gon. Prove that it is possible to remove a number from each vertex so that the remaining numbers on any two adjacent vertices are different.
[i]F. Petrov [/i]
Let $a$ be the sum and $b$ the product of the real roots of the equation $x^4-x^3-1=0$
Prove that $b < -\frac{11}{10}$ and $a > \frac{6}{11}$.
Prove that for any quadratic polynomial $f(x)=x^2+px+q$ with integer coefficients, it is possible to find another polynomial $q(x)=2x^2+rx+s$ with integer coefficients so that \[\{f(x)|x \in \mathbb{Z} \} \cap \{g(x)|x \in \mathbb{Z} \} = \emptyset .\]
Let $\mathcal{M}=\mathbb{Q}[x,y,z]$ be the set of three-variable polynomials with rational coefficients. Prove that for any non-zero polynomial $P\in \mathcal{M}$ there exists non-zero polynomials $Q,R\in \mathcal{M}$ such that \[ R(x^2y,y^2z,z^2x) = P(x,y,z)Q(x,y,z). \]
Let $n$ be a positive integer. Prove that there exist polynomials $P$ and $Q$ with real coefficients such that for every real number $x$, we have $P(x) \ge 0$, $Q(x) \ge 0$, and
\[
1 - x^n = (1 - x)P(x) + (1 + x)Q(x).
\]
Let $k$ and $n$ be positive integers with $n\geq k^2-3k+4$, and let
$$f(z)=z^{n-1}+c_{n-2}z^{n-2}+\dots+c_0$$
be a polynomial with complex coefficients such that
$$c_0c_{n-2}=c_1c_{n-3}=\dots=c_{n-2}c_0=0$$
Prove that $f(z)$ and $z^n-1$ have at most $n-k$ common roots.
Let $P(x)=x^4-x^3-3x^2-x+1.$ Prove that there are infinitely many positive integers $n$ such that $P(3^n)$ is not a prime.
Karl likes the number $17$ his favorite polynomials are monic quadratics with integer coefficients such that $17$ is a root of the quadratic and the roots differ by no more than $17$. Compute the sum of the coefficients of all of Karl's favorite polynomials. (A monic quadratic is a quadratic polynomial whose $x^2$ term has a coefficient of $1$.)
Suppose $p(x) \in \mathbb{Z}[x]$ and $P(a)P(b)=-(a-b)^2$ for some distinct $a, b \in \mathbb{Z}$. Prove that $P(a)+P(b)=0$.
We choose random a unitary polynomial of degree $n$ and coefficients in the set $1,2,...,n!$. Prove that the probability for this polynomial to be special is between $0.71$ and $0.75$, where a polynomial $g$ is called special if for every $k>1$ in the sequence $f(1), f(2), f(3),...$ there are infinitely many numbers relatively prime with $k$.
[b]p1.[/b] Twelve tables are set up in a row for a Millenium party. You want to put $2000$ cupcakes on the tables so that the numbers of cupcakes on adjacent tables always differ by one (for example, if the $5$th table has $20$ cupcakes, then the $4$th table has either $19$ or $21$ cupcakes, and the $6$th table has either $19$ or $21$ cupcakes).
a) Find a way to do this.
b) Suppose a Y2K bug eats one of the cupcakes, so you have only $1999$ cupcakes. Show that it is impossible to arrange the cupcakes on the tables according to the above conditions.
[b]p2.[/b] Let $P$ and $Q$ lie on the hypotenuse $AB$ of the right triangle $CAB$ so that $|AP|=|PQ|=|QB|=|AB|/3$. Suppose that $|CP|^2+|CQ|^2=5$. Prove that $|AB|$ has the same value for all such triangles, and find that value. Note: $|XY|$ denotes the length of the segment $XY$.
[b]p3.[/b] Let $P$ be a polynomial with integer coefficients and let $a, b, c$ be integers. Suppose $P(a)=b$, $P(b)=c$, and $P(c)=a$. Prove that $a=b=c$.
[b]p4.[/b] A lattice point is a point $(x,y)$ in the plane for which both $x$ and $y$ are integers. Each lattice point is painted with one of $1999$ available colors. Prove that there is a rectangle (of nonzero height and width) whose corners are lattice points of the same color.
[b]p5.[/b] A $1999$-by-$1999$ chocolate bar has vertical and horizontal grooves which divide it into $1999^2$ one-by-one squares. Caesar and Brutus are playing the following game with the chocolate bar: A move consists of a player picking up one chocolate rectangle; breaking it along a groove into two smaller rectangles; and then either putting both rectangles down or eating one piece and putting the other piece down. The players move alternately. The one who cannot make a move at his turn (because there are only one-by-one squares left) loses. Caesar starts. Which player has a winning strategy? Describe a winning strategy for that player.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let
$$P(x)=a_0x^n+a_1x^{n-1}+\ldots+a_n$$
where $a_0,\ldots,a_n$ are integers. Show that if $P$ takes the value $2020$ for four distinct integral values of $x$, then $P$ cannot take the value $2001$ for any integral value of $x$.
[i]Proposed by Ángel Plaza[/i]
If the polynomials $f(x)$ and $g(x)$ are written on a blackboard then we can also write down the polynomials $f(x)\pm g(x)$, $f(x)g(x)$, $f(g(x))$ and $cf(x)$, where $c$ is an arbitrary real constant. The polynomials $x^3-3x^2+5$ and $x^2-4x$ are written on the blackboard. Can we write a nonzero polynomial of form $x^n-1$ after a finite number of steps?
Let $a$ be a positive integer, but not a perfect square; $r$ is a real root of the equation $x^3-2ax+1=0$. Prove that $ r+\sqrt{a}$ is an irrational number.
Let $f(x)= x^2-C$ where $C$ is a rational constant.
Show that exists only finitely many rationals $x$ such that $\{x,f(x),f(f(x)),\ldots\}$ is finite
Prove that any polynomial of the form $1+a_nx^n + a_{n+1}x^{n+1} + \cdots + a_kx^k$ ($k\ge n$) has at least $n-2$ non-real roots (counting multiplicity), where the $a_i$ ($n\le i\le k$) are real and $a_k\ne 0$.
[i]David Yang.[/i]
Let $P(X)=X^n+a_1X^{n-1}+\ldots+a_n$ be a plynomial with real roots $x_1. x_2,\ldots,x_n$. Denote $E_k=x_1^k+x_2^k+\ldots+x_n^k, \forall k\in\mathbb{N}$. There exists an $m\in\mathbb{N}$ such that $E_m=E_{m+1}=E_{m+2}=1$. Find $\max\{P(-2),P(2)\}$.
If $f$ is a monic cubic polynomial with $f(0)=-64$, and all roots of $f$ are non-negative real numbers, what is the largest possible value of $f(-1)$? (A polynomial is monic if it has a leading coefficient of $1$.)
[b]p1.[/b] There are $4$ mirrors facing the inside of a $5\times 7$ rectangle as shown in the figure. A ray of light comes into the inside of a rectangle through $A$ with an angle of $45^o$. When it hits the sides of the rectangle, it bounces off at the same angle, as shown in the diagram. How many times will the ray of light bounce before it reaches any one of the corners $A$, $B$, $C$, $D$? A bounce is a time when the ray hit a mirror and reflects off it.
[img]https://cdn.artofproblemsolving.com/attachments/1/e/d6ea83941cdb4b2dab187d09a0c45782af1691.png[/img]
[b]p2.[/b] Jerry cuts $4$ unit squares out from the corners of a $45\times 45$ square and folds it into a $43\times 43\times 1$ tray. He then divides the bottom of the tray into a $43\times 43$ grid and drops a unit cube, which lands in precisely one of the squares on the grid with uniform probability. Suppose that the average number of sides of the cube that are in contact with the tray is given by $\frac{m}{n}$ where $m, n$ are positive integers that are relatively prime. Find $m + n$.
[b]p3.[/b] Compute $2021^4 - 4 \cdot 2023^4 + 6 \cdot 2025^4 - 4 \cdot 2027^4 + 2029^4$.
[b]p4.[/b] Find the number of distinct subsets $S \subseteq \{1, 2,..., 20\}$, such that the sum of elements in $S$ leaves a remainder of $10$ when divided by $32$.
[b]p5.[/b] Some $k$ consecutive integers have the sum $45$. What is the maximum value of $k$?
[b]p6.[/b] Jerry picks $4$ distinct diagonals from a regular nonagon (a regular polygon with $9$-sides). A diagonal is a segment connecting two vertices of the nonagon that is not a side. Let the probability that no two of these diagonals are parallel be $\frac{m}{n}$ where $m, n$ are positive integers that are relatively prime. Find $m + n$.
[b]p7.[/b] The Olympic logo is made of $5$ circles of radius $1$, as shown in the figure [img]https://cdn.artofproblemsolving.com/attachments/1/7/9dafe6b72aa8471234afbaf4c51e3e97c49ee5.png[/img]
Suppose that the total area covered by these $5$ circles is $a+b\pi$ where $a, b$ are rational numbers. Find $10a + 20b$.
[b]p8.[/b] Let $P(x)$ be an integer polynomial (polynomial with integer coefficients) with $P(-5) = 3$ and $P(5) = 23$. Find the minimum possible value of $|P(-2) + P(2)|$.
[b]p9. [/b]There exists a unique tuple of rational numbers $(a, b, c)$ such that the equation $$a \log 10 + b \log 12 + c \log 90 = \log 2025.$$ What is the value of $a + b + c$?
[b]p10.[/b] Each grid of a board $7\times 7$ is filled with a natural number smaller than $7$ such that the number in the grid at the $i$th row and $j$th column is congruent to $i + j$ modulo $7$. Now, we can choose any two different columns or two different rows, and swap them. How many different boards can we obtain from a finite number of swaps?
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].