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: 85335

[b]p1.[/b] Minseo writes all of the divisors of $1,000,000$ on the whiteboard. She then erases all of the numbers which have the digit $0$ in their decimal representation. How many numbers are left? [b]p2.[/b] $n < 100$ is an odd integer and can be expressed as $3k - 2$ and $5m + 1$ for positive integers $k$ and $m$. Find the sum of all possible values of $n$. [b]p3.[/b] Mr. Pascal is a math teacher who has the license plate $SQUARE$. However, at night, a naughty student scrambles Mr. Pascal’s license plate to $UQRSEA$. The math teacher luckily has an unscrambler that is able to move license plate letters. The unscrambler swaps the positions of any two adjacent letters. What is the minimum number of times Mr. Pascal must use the unscrambler to restore his original license plate? [b]p4.[/b] Find the number of distinct real numbers $x$ which satisfy $x^2 + 4 \lfloor x \rfloor + 4 = 0$. [b]p5.[/b] All four faces of tetrahedron $ABCD$ are acute. The distances from point $D$ to $\overline{BC}$, $\overline{CA}$ and $\overline{AB}$ are all $7$, and the distance from point $D$ to face $ABC$ is $5$. Given that the volume of tetrahedron $ABCD$ is $60$, find the surface area of tetrahedron $ABCD$. [b]p6.[/b] Forrest has a rectangular piece of paper with a width of $5$ inches and a height of $3$ inches. He wants to cut the paper into five rectangular pieces, each of which has a width of $1$ inch and a distinct integer height between $1$ and $5$ inches, inclusive. How many ways can he do so? (One possible way is shown below.) [img]https://cdn.artofproblemsolving.com/attachments/7/3/205afe28276f9df1c6bcb45fff6313c6c7250f.png[/img] [b]p7.[/b] In convex quadrilateral $ABCD$, $AB = CD = 5$, $BC = 4$ and $AD = 8$. If diagonal $\overline{AC}$ bisects $\angle DAB$, find the area of quadrilateral $ABCD$. [b]p8.[/b] Let $x$ and $y$ be real numbers such that $$x + y = x^3 + y^3 + \frac34 = \frac{1}{8xy}.$$ Find the value of $x + y$. [b]p9.[/b] Four blue squares and four red parallelograms are joined edge-to-edge alternately to form a ring of quadrilateral as shown. The areas of three of the red parallelograms are shown. Find the area of the fourth red parallelogram. [img]https://cdn.artofproblemsolving.com/attachments/9/c/911a8d53604f639e2f9bd72b59c7f50e43e258.png[/img] [b]p10.[/b] Define $f(x, n) =\sum_{d|n}\frac{x^n-1}{x^d-1}$ . For how many integers $n$ between $1$ and $2023$ inclusive is $f(3, n)$ an odd integer? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $O$ be the circumcenter of an acute triangle $ABC$. Line $OA$ intersects the altitudes of $ABC$ through $B$ and $C$ at $P$ and $Q$, respectively. The altitudes meet at $H$. Prove that the circumcenter of triangle $PQH$ lies on a median of triangle $ABC$.
Find all triplets of nonnegative integers $(x, y, z)$ that satisfy: $x^2-3y^2=y^2-3z^2=22$.
Prove that a finite point set cannot have more than one center of symmetry.
Let $ABC$ be a triangle with $AB<AC$ and $\omega$ be its circumcircle. The tangent line to $\omega$ at $A$ intersects line $BC$ at $D$ and let $E$ be a point on $\omega$ such that $BE$ is parallel to $AD$. $DE$ intersects segment $AB$ and $\omega$ at $F$ and $G$, respectively. The circumcircle of $BGF$ intersects $BE$ at $N$. The line $NF$ intersects lines $AD$ and $EA$ at $S$ and $T$, respectively. Prove that $DGST$ is cyclic.
Let $a$ be a real number such that $\left(a + \frac{1}{a}\right)^2=11$. What possible values can $a^3 + \frac{1}{a^3}$ and $a^5 + \frac{1}{a^5}$ take?
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
Let us consider one variable polynomials with the senior coefficient equal to one. We shall say that two polynomials $P(x)$ and $Q(x)$ commute, if $P(Q(x))=Q(P(x))$ (i.e. we obtain the same polynomial, having collected the similar terms). a) For every a find all $Q$ such that the $Q$ degree is not greater than three, and $Q$ commutes with $(x^2 - a)$. b) Let $P$ be a square polynomial, and $k$ is a natural number. Prove that there is not more than one commuting with $P$ $k$-degree polynomial. c) Find the $4$-degree and $8$-degree polynomials commuting with the given square polynomial $P$. d) $R$ and $Q$ commute with the same square polynomial $P$. Prove that $Q$ and $R$ commute. e) Prove that there exists a sequence $P_2, P_3, ... , P_n, ...$ ($P_k$ is $k$-degree polynomial), such that $P_2(x) = x^2 - 2$, and all the polynomials in this infinite sequence pairwise commute.
Find the number of sequences $(a_n)_{n=1}^\infty$ of integers satisfying $a_n \ne -1$ and \[a_{n+2} =\frac{a_n + 2006}{a_{n+1} + 1}\] for each $n \in \mathbb{N}$.
$n$ children want to divide $m$ identical pieces of chocolate into equal amounts, each piece being broken not more than once. (a) For what $n$ is it possible, if $m = 9$? (b) For what $n$ and $m$ is it possible? (Y. Tschekanov, Moscow)
Let $x_1,\dots ,x_n$ be real numbers. We look at all the $2^{n-1}$ possible sums between some of the numbers. If the number of different sums is at least $1.8^n$, prove that the number of sums equal to $2022$ is no more than $1.67^n$.
Two cubes with edge length $3$ and two cubes with edge length $4$ sit on plane $P$ so that the four cubes share a vertex, and the two larger cubes share no faces with each other as shown below. The cube vertices that do not touch $P$ or any of the other cubes are labeled $A$, $B$, $C$, $D$, $E$, $F$, $G$, and $H$. The four cubes lie inside a right rectangular pyramid whose base is on $P$ and whose triangular sides touch the labeled vertices with one side containing vertices $A$, $B$, and $C$, another side containing vertices $D$, $E$, and $F$, and the two other sides each contain one of $G$ and $H$. Find the volume of the pyramid.
Let $d(n)$ be the number of divisors of a nonnegative integer $n$ (we set $d(0)=0$). Find all positive integers $d$ such that there exists a two-variable polynomial $P(x,y)$ of degree $d$ with integer coefficients such that: [list] [*] for any positive integer $y$, there are infinitely many positive integers $x$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid x$, and [*] for any positive integer $x$, there are infinitely many positive integers $y$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid y$. [/list] [i]Allen Wang[/i]
Let $n>2$ be an integer. A deck contains $\frac{n(n-1)}{2}$ cards,numbered \[1,2,3,\cdots , \frac{n(n-1)}{2}\] Two cards form a [i]magic pair[/i] if their numbers are consecutive , or if their numbers are $1$ and $\frac{n(n+1)}{2}$. For which $n$ is it possible to distribute the cards into $n$ stacks in such a manner that, among the cards in any two stacks , there is exactly one [i]magic pair[/i]?
Consider $n$ children in a playground, where $n\ge 2$. Every child has a coloured hat, and every pair of children is joined by a coloured ribbon. For every child, the colour of each ribbon held is different, and also different from the colour of that child’s hat. What is the minimum number of colours that needs to be used?
If $x, y, z \in \mathbb{R}$ are solutions to the system of equations $$\begin{cases} x - y + z - 1 = 0\\ xy + 2z^2 - 6z + 1 = 0\\ \end{cases}$$ what is the greatest value of $(x - 1)^2 + (y + 1)^2$?
Let $F$ be the correspondence associating with every point $P = (x, y)$ the point $P' = (x', y')$ such that \[ x'= ax + b,\qquad y'= ay + 2b. \qquad (1)\] Show that if $a \neq 1$, all lines $PP'$ are concurrent. Find the equation of the set of points corresponding to $P = (1, 1)$ for $b = a^2$. Show that the composition of two mappings of type $(1)$ is of the same type.
The seven-digit integer numbers are different in pairs and this number is divided by each of its own numbers. a) Find all possibilities for the three numbers that are not included in this number. b) Give an example of such a number.
Joe makes two cubes of sidelengths $9$ and $10$ from $1729$ randomly oriented and randomly arranged unit cubes, which are initially unpainted. These cubes are dipped into white paint. Then two cubes of sidelengths $1$ and $12$ are formed from the same unit cubes, again randomly oriented and randomly arranged, and these cubes are dipped into paint remover. Joe continues to alternately dip cubes of sides $9$ and $10$ into paint and cubes of sides $1$ and $12$ into paint remover ad nauseam. What is the limit of the expected number of painted unit cube faces immediately after dipping in paint remover?
How many pairs of real numbers $(x,y)$ are there such that $x^4+y^4 + 2x^2y + 2xy^2+ 2 = x^2 + y^2 + 2x + 2y$? $ \textbf{(A)}\ 6 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 2 $
A cubic trinomial $x^3 + px + q$ with integer coefficients $p$ and $q$ is said to be [i]irrational [/i] if it has three pairwise distinct real irrational roots $a_1,a_2, a_3$ Find all irrational cubic trinomials for which the value of $|a_1| + [a_2| + |a_3|$ is the minimal possible. (E. Barabanov)
A trapezoid $ABCD$ with perpendicular diagonals $AC$ and $BD$ is inscribed in a circle $k$. Let $k_a$ and $k_c$ respectively be the circles with diameters $AB$ and $CD$. Compute the area of the region which is inside the circle $k$, but outside the circles $k_a$ and $k_c$.
Is it possible to split all straight lines in a plane into the pairs of perpendicular lines, so that every line belongs to a single pair?
All the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ are written in a $3\times3$ array of squares, one number in each square, in such a way that if two numbers are consecutive then they occupy squares that share an edge. The numbers in the four corners add up to $18$. What is the number in the center? $\textbf{(A)}\ 5\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 7\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 9$
If $p=2^{16}+1$ is a prime, find the maximum possible number of elements in a set $S$ of positive integers less than $p$ so no two distinct $a,b$ in $S$ satisfy $$a^2\equiv b\pmod{p}.$$