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

The times between $ 7$ and $ 8$ o'clock, correct to the nearest minute, when the hands of a clock will form an angle of $ 84$ degrees are: $ \textbf{(A)}\ \text{7: 23 and 7: 53} \qquad \textbf{(B)}\ \text{7: 20 and 7: 50} \qquad \textbf{(C)}\ \text{7: 22 and 7: 53} \\ \textbf{(D)}\ \text{7: 23 and 7: 52} \qquad \textbf{(E)}\ \text{7: 21 and 7: 49}$
For a positive integer $a$, define a sequence of integers $x_1,x_2,\ldots$ by letting $x_1=a$ and $x_{n+1}=2x_n+1$ for $n\geq 1$. Let $y_n=2^{x_n}-1$. Determine the largest possible $k$ such that, for some positive integer $a$, the numbers $y_1,\ldots,y_k$ are all prime.
Four drivers took part in the round-robin racing. Their cars started simultaneously from one point and moved at constant speeds. It is known that after the start of the race, for any three cars there was a moment when they met. Prove that after the start of the race there will be a moment when all 4 cars meet. (We consider races to be infinitely long in time.)
$(a)$ Prove that for every positive integer $n$, the number of ordered pairs $(x, y)$ of integers satisfying $x^2-xy+y^2 = n$ is divisible by $3.$ $(b)$ Find all ordered pairs of integers satisfying $x^2-xy+y^2=727.$
If $ 1 \le r \le n$ are integers, prove the identity: $ \displaystyle\sum_{d\equal{}1}^{\infty}\binom {n\minus{}r\plus{}1}{d} \binom {r\minus{}1} {d\minus{}1}\equal{}\binom {n}{r}.$
In the rectangle there is a broken line, the neighboring links of which are perpendicular and equal to the smaller side of the rectangle (see the figure). Find the ratio of the sides of the rectangle. [img]https://2.bp.blogspot.com/-QYj53KiPTJ8/XT_mVIw876I/AAAAAAAAKbE/gJ1roU4Bx-kfGVfJxYMAuLE0Ax0glRbegCK4BGAYYCw/s1600/oral%2Bmoscow%2B2016%2B8.9%2Bp2.png[/img]
Given a triangle $ABC$. Consider all the tetrahedrons $PABC$ with $PH$ -- the smallest of all tetrahedron's heights. Describe the set of all possible points $H$.
Let $ABC$ be triangle with $H$ is the orthocenter and $I$ is incenter. Denote $A_{1}, A_{2}, B_{1}, B_{2}, C_{1}, C_{2}$ be the points on the rays $AB, AC, BC, CA, CB$, respectively such that $$AA_{1} = AA_{2} = BC, BB_{1} = BB_{2} = CA, CC_{1} = CC_{2} = AB.$$ Suppose that $B_{1}B_{2}$ cuts $C_{1}C_{2}$ at $A'$, $C_{1}C_{2}$ cuts $A_{1}A_{2}$ at $B'$ and $A_{1}A_{2}$ cuts $B_{1}B_{2}$ at $C'$. a) Prove that area of triangle $A'B'C'$ is smaller than or equal to the area of triangle $ABC$. b) Let $J$ be circumcenter of triangle $A'B'C'$. $AJ$ cuts $BC$ at $R$, $BJ$ cuts $CA$ at $S$ and $CJ$ cuts $AB$ at $T$. Suppose that $(AST), (BTR), (CRS)$ intersect at $K$. Prove that if triangle $ABC$ is not isosceles then $HIJK$ is a parallelogram.
Suppose $x$ is a random real number between $1$ and $4$, and $y$ is a random real number between $1$ and $9$. If the expected value of \[ \left\lceil \log_2 x \right\rceil - \left\lfloor \log_3 y \right\rfloor \] can be expressed as $\frac mn$ where $m$ and $n$ are relatively prime positive integers, compute $100m + n$. [i]Proposed by Lewis Chen[/i]
There is a unique sequence of integers $a_1, a_2, \cdots a_{2023}$ such that $$ \tan2023x = \frac{a_1 \tan x + a_3 \tan^3 x + a_5 \tan^5 x + \cdots + a_{2023} \tan^{2023} x}{1 + a_2 \tan^2 x + a_4 \tan^4 x \cdots + a_{2022} \tan^{2022} x} $$ whenever $\tan 2023x$ is defined. What is $a_{2023}?$ $\textbf{(A) } -2023 \qquad\textbf{(B) } -2022 \qquad\textbf{(C) } -1 \qquad\textbf{(D) } 1 \qquad\textbf{(E) } 2023$
Find all values of $a$ such that absolute value of one of the roots of the equation $x^2 + (a - 2)x - 2a^2 + 5a - 3 = 0$ is twice of absolute value of the other root.
Let $D:=\{(x, y)\mid x,y\in\mathbb R_+,x \ne y,x^y=y^x\}$. (Obvious that $x\ne1$ and $y\ne1$). And let $\alpha\le\beta$ be positive real numbers. Find $$\inf_{(x,y)\in D}x^\alpha y^\beta.$$ [i]Proposed by Arkady Alt[/i]
Rectangle $ABCD$ has $AB=6$ and $BC=3$. Point $M$ is chosen on side $AB$ so that $\angle AMD = \angle CMD$. What is the degree measure of $\angle AMD$? $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 60 \qquad \textbf{(E)}\ 75 $
The game of [b]Hive [/b]is played on a regular hexagonal grid (as shown in the figure) by 3 players. The grid consists of $k$ layers (where $k$ is a natural number) surrounding a regular hexagon, with each layer constructed around the previous layer. The figure below shows a grid with 2 layers. The players, [i]Ali[/i], [i]Shayan[/i], and [i]Sajad[/i], take turns playing the game. In each turn, a player places a tile, similar to the one shown in the figure, on the empty cells of the grid (rotation of the tile is also allowed). The first player who is unable to place a tile on the grid loses the game. Prove that two players can collaborate in such a way that the third player always loses. Proposed by [size=110]Pouria Mahmoudkhan Shirazi[/size].
Find all pairs $(a,b)$ of different positive integers that satisfy the equation $W(a)=W(b)$, where $W(x)=x^{4}-3x^{3}+5x^{2}-9x$.
Andrew chooses three (not necessarily distinct) integers $a$, $b$, and $c$ independently and uniformly at random from $\{1,2,3,4,5,6,7\}$. Let $p$ be the probability that $abc(a+b+c)$ is divisible by $4$. If $p$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, then compute $m+n$. [i]Proposed by Andrew Wen[/i]
Find the number of nonnegative integers $n$ for which $(n^2 - 3n + 1)^2 + 1$ is a prime number
A game of coins is played as follows: You start with $1$ head and $1$ tail on a table. At each turn, you can perform any one of the following moves: [list=a] [*]You can turn over all the coins on the table. [*]You can triple the number of heads and tails at the table. [*]If there are at least $4$ tails on the table, you can turn over $4$ tails. [*]If there are at least $5$ tails on the table, you can turn over $3$ of the tails and discard $2$ of the tails. [/list] Knowing that at the end of the game you have $2024$ heads, what are all possible numbers of tails at the end of that game?
Let’s note the set of all integers $n>1$ which are not divisible by a square of a prime number. We define the number $f(n)$ as the greatest amount of divisors of $n$ which could be chosen in such way so that for each two chosen $a$ and $b$, not necessarily different, the number $a^2+ab+b^2+n$ is not a square. Find all $m$ for which there exists $n$ so that $f(n)=m$.
Determine all functions $f\colon\mathbb{Z}_{>0}\to\mathbb{Z}_{>0}$ such that, for all positive integers $a$ and $b$, \[ f^{bf(a)}(a+1)=(a+1)f(b). \]
Find all the intervals $I$ where any element of the interval $x \in I$ satisfies $$\cos x +\sin x >1.$$ Do the same computation when $x$ satisfies $$\cos x +\vert \sin x \vert>1.$$
Let $ABCD$ a convex quadrilateral with $AB=BC=CD$, with $AC$ not equal to $BD$ and $E$ be the intersection point of it's diagonals. Prove that $AE=DE$ if and only if $\angle BAD+\angle ADC = 120$.
Two cubes $A$ and $B$ have different side lengths, such that the volume of cube $A$ is numerically equal to the surface area of cube $B$. If the surface area of cube $A$ is numerically equal to six times the side length of cube $B$, what is the ratio of the surface area of cube $A$ to the volume of cube $B$?
A Gaussian prime is a Gaussian integer $ z\equal{}a\plus{}bi$ (where $ a$ and $ b$ are integers) with no Gaussian integer factors of smaller absolute value. Factor $ \minus{}4\plus{}7i$ into Gaussian primes with positive real parts. $ i$ is a symbol with the property that $ i^2\equal{}\minus{}1$.
Does there exist a bijective map $f:\mathbb{N} \rightarrow \mathbb{N}$ so that $\sum^{\infty}_{n=1}\frac{f(n)}{n^2}$ is finite?