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

On the three distinct lines $a, b$, and $c$ three points $A, B$, and $C$ are given, respectively. Construct three collinear points $X, Y,Z$ on lines $a, b, c$, respectively, such that $\frac{BY}{AX} = 2$ and $ \frac{CZ}{AX} = 3$.
A $5 \times 5$ table is called regular f each of its cells contains one of four pairwise distinct real numbers,such that each of them occurs exactly one in every $2 \times 2$ subtable.The sum of all numbers of a regular table is called the total sum of the table.With any four numbers,one constructs all possible regular tables,computes their total sums and counts the distinct outcomes.Determine the maximum possible count.
Let $ABCD$ be a unit square. Construct point $E$ outside $ABCD$ such that $\overline{AE} = \sqrt{2} \cdot \overline{BE}$ and $\angle{AEB} = 135^{\circ}$. Also, let $F$ be the foot of the perpendicular from $A$ to line $BE$. Find the area of $\triangle{BDF}$.
Consider a sequence of eleven squares that have side lengths $3, 6, 9, 12,\ldots, 33$. Eleven copies of a single square each with area $A$ have the same total area as the total area of the eleven squares of the sequence. Find $A$.
A point is picked uniformly at random inside of a square. Four segments are then drawn in connecting the point to each of the vertices of the square, cutting the square into four triangles. What is the probability that at least two of the resulting triangles are obtuse?
[b]p1.[/b] There is a string of numbers $1234567891023...910134 ...91012...$ that concatenates the numbers $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, then $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $1$, then $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $1$, $2$, and so on. After $10$, $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, the string will be concatenated with $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$ again. What is the $2021$st digit? [b]p2.[/b] Bob really likes eating rice. Bob starts eating at the rate of $1$ bowl of rice per minute. Every minute, the number of bowls of rice Bob eats per minute increases by $1$. Given there are $78$ bowls of rice, find number of minutes Bob needs to finish all the rice. [b]p3.[/b] Suppose John has $4$ fair coins, one red, one blue, one yellow, one green. If John flips all $4$ coins at once, the probability he will land exactly $3$ heads and land heads on both the blue and red coins can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$, Find $a + b$. [b]p4.[/b] Three of the sides of an isosceles trapezoid have lengths $1$, $10$, $20$ Find the sum of all possible values of the fourth side. [b]p5.[/b] An number two-three-delightful if and only if it can be expressed as the product of $2$ consecutive integers larger than $1$ and as the product of $3$ consecutive integers larger than $1$. What is the smallest two-three-delightful number? [b]p6.[/b] There are $3$ students total in Justin's online chemistry class. On a $100$ point test, Justin's two classmates scored $4$ and $7$ points. The teacher notices that the class median score is equal to $gcd(x, 42)$, where the positive integer $x$ is Justin's score. Find the sum of all possible values of Justin's score. [b]p7.[/b] Eddie's gym class of $10$ students decides to play ping pong. However, there are only $4$ tables and only $2$ people can play at a table. If $8$ students are randomly selected to play and randomly assigned a partner to play against at a table, the probability that Eddie plays against Allen is $\frac{a}{b}$ for relatively prime positive integers $a$, $b$, Find $a + b$. [b]p8.[/b] Let $S$ be the set of integers $k$ consisting of nonzero digits, such that $300 < k < 400$ and $k - 300$ is not divisible by $11$. For each $k$ in $S$, let $A(k)$ denote the set of integers in $S$ not equal to $k$ that can be formed by permuting the digits of $k$. Find the number of integers $k$ in $S$ such that $k$ is relatively prime to all elements of $A(k)$. [b]p9.[/b] In $\vartriangle ABC$, $AB = 6$ and $BC = 5$. Point $D$ is on side $AC$ such that $BD$ bisects angle $\angle ABC$. Let $E$ be the foot of the altitude from $D$ to $AB$. Given $BE = 4$, find $AC^2$. [b]p10.[/b] For each integer $1 \le n \le 10$, Abe writes the number $2^n + 1$ on a blackboard. Each minute, he takes two numbers $a$ and $b$, erases them, and writes $\frac{ab-1}{a+b-2}$ instead. After $9$ minutes, there is one number $C$ left on the board. The minimum possible value of $C$ can be expressed as $\frac{p}{q}$ for relatively prime positive integers $p, q$. Find $p + q$. [b]p11.[/b] Estimation (Tiebreaker) Let $A$ and $B$ be the proportions of contestants that correctly answered Questions $9$ and $10$ of this round, respectively. Estimate $\left \lfloor \dfrac{1}{(AB)^2} \right \rfloor$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
A rectangle $\mathcal R$ is divided into a set $\mathcal S$ of finitely many smaller rectangles with sides parallel to the sides of $\mathcal R$ such that no three rectangles in $\mathcal S$ share a common corner. An ant is initially located at the bottom-left corner of $\mathcal R$. In one operation, we can choose a rectangle $r$ in $\mathcal S$ such that the ant is currently located at one of the corners of $r$, say $c$, and move the ant to one of the two corners of $r$ adjacent to $c$. Suppose that after a finite number of operations, the ant ends up at the top-right corner of $\mathcal R$. Prove that some rectangle $r$ in $\mathcal S$ was chosen in at least two operations.
Suppose that $m>2$, and let $P$ be the product of the positive integers less than $m$ that are relatively prime to $m$. Show that $P \equiv -1 \pmod{m}$ if $m=4$, $p^n$, or $2p^{n}$, where $p$ is an odd prime, and $P \equiv 1 \pmod{m}$ otherwise.
Let $p$ be a prime. Prove that any complete graph with $1000p$ vertices, whose edges are labelled with integers, has a cycle whose sum of labels is divisible by $p$.
Let $\omega$ be a circle with center $O$ and let $A$ be a point outside $\omega$. The tangents from $A$ touch $\omega$ at points $B$, and $C$. Let $D$ be the point at which the line $AO$ intersects the circle such that $O$ is between $A$ and $D$. Denote by $X$ the orthogonal projection of $B$ onto $CD$, by $Y$ the midpoint of the segment $BX$ and by $Z$ the second point of intersection of the line $DY$ with $\omega$. Prove that $ZA$ and $ZC$ are perpendicular to each other.
In a triangle $ABC, AC = BC$ and $D$ is the midpoint of $AB$. Let $E$ be an arbitrary point on line $AB$ which is not $B$ or $D$. Let $O$ be the circumcenter of $\vartriangle ACE$ and $F$ the intersection of the perpendicular from $E$ to $BC$ and the perpendicular to $DO$ at $D$. Prove that the acute angle between $BC$ and $BF$ does not depend on the choice of point $E$.
Show that, in a chessboard, it is possible to traverse to any given square from another given square using a knight. (A knight can move in a chessboard by going two steps in one direction and one step in a perpendicular direction as shown in the given figure)
Determine all real constants $t$ such that whenever $a$, $b$ and $c$ are the lengths of sides of a triangle, then so are $a^2+bct$, $b^2+cat$, $c^2+abt$.
Let $a,b,c$ be positive real numbers with $a+b+c=3$. Prove that \[ \sqrt{\frac{b}{a^2+3}}+ \sqrt{\frac{c}{b^2+3}}+ \sqrt{\frac{a}{c^2+3}} ~\le~ \frac32\sqrt[4]{\frac{1}{abc}}\]
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that $$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$ for all positive integers $n$. Show that $a_{2022}\leq 1$.
What maximal number of the men in checkers game can be put on the chess-board $8\times 8$ so, that every man can be taken by at least one other man ?
Compute the sum of all positive integers $x$ such that $(x-17)\sqrt{x-1}+(x-1)\sqrt{x+15}$ is an integer.
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(yf(x))+f(x-1)=f(x)f(y)$ and $|f(x)|<2022$ for all $0<x<1$.
Given an $ a \times b$ rectangle with $ a > b > 0,$ determine the minimum side of a square that covers the rectangle. (A square covers the rectangle if each point in the rectangle lies inside the square.)
For a given natural number $n$, consider those sets $A\subseteq \mathbb{Z}_n$ for which the equation $xy=uv$ has no other solution in the residual classes $x,y,u,v\in A$ than the trivial solutions $x=u$, $y=v$ and $x=v$, $y=u$. Let $g(n)$ be the maximum of the size of such sets $A$. Prove that $$\limsup_{n\to\infty}\frac{g(n)}{\sqrt{n}}=1$$
Prove that for all real numbers $x,y,z \in [1,2]$ the following inequality always holds: \[ (x+y+z)(\frac{1}{x}+\frac{1}{y}+\frac{1}{z})\geq 6(\frac{x}{y+z}+\frac{y}{z+x}+\frac{z}{x+y}). \] When does the equality occur?
Given real $a$. Find the least possible area of the rectangle with the sides parallel to the coordinate axes and containing the figure determined by the system of inequalities $$y \le -x^2 \,\,\, and \,\,\, y \ge x^2 - 2x + a$$
The set of quadruples $(a,b,c,d)$ where each of $a,b,c,d$ is either $0$ or $1$ is [i]called vertices of the four dimensional unit cube[/i] or [i]4-cube[/i] for short. Two vertices are called [i]adjacent[/i], if their respective quadruples differ by one variable only. Each two adjacent vertices are connected by an edge. A robot is moving through the edges of the 4-cube starting from $(0,0,0,0)$ and each turn consists of passing an edge and moving to adjacent vertex. In how many ways can the robot go back to $(0,0,0,0)$ after $4042$ turns? Note that it is [u]NOT[/u] forbidden for the robot to pass through $(0,0,0,0)$ before the $4042$-nd turn.
What is the smallest possible perimeter of a triangle with integer coordinate vertices, area $\frac12$, and no side parallel to an axis?
In triangle $ABC, \angle A$ is smaller than $\angle C$. Point $D$ lies on the (extended) line $BC$ (with $B$ between $C$ and $D$) such that $|BD| = |AB|$. Point $E$ lies on the bisector of $\angle ABC$ such that $\angle BAE = \angle ACB$. Line segment $BE$ intersects line segment $AC$ in point $F$. Point $G$ lies on line segment $AD$ such that $EG$ and $BC$ are parallel. Prove that $|AG| =|BF|$. [asy] unitsize (1.5 cm); real angleindegrees(pair A, pair B, pair C) { real a, b, c; a = abs(B - C); b = abs(C - A); c = abs(A - B); return(aCos((a^2 + c^2 - b^2)/(2*a*c))); }; pair A, B, C, D, E, F, G; B = (0,0); A = 2*dir(190); D = 2*dir(310); C = 1.5*dir(310 - 180); E = extension(B, incenter(A,B,C), A, rotate(angleindegrees(A,C,B),A)*(B)); F = extension(B,E,A,C); G = extension(E, E + D - B, A, D); filldraw(anglemark(A,C,B,8),gray(0.8)); filldraw(anglemark(B,A,E,8),gray(0.8)); draw(C--A--B); draw(E--A--D); draw(interp(C,D,-0.1)--interp(C,D,1.1)); draw(interp(E,B,-0.2)--interp(E,B,1.2)); draw(E--G); dot("$A$", A, SW); dot("$B$", B, NE); dot("$C$", C, NE); dot("$D$", D, NE); dot("$E$", E, N); dot("$F$", F, N); dot("$G$", G, SW); [/asy]