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

An alarm clock runs 4 minutes slow every hour. It was set right $ 3 \frac{1}{2}$ hours ago. Now another clock which is correct shows noon. In how many minutes, to the nearest minute, will the alarm clock show noon?
Let $a,b,c,d$ be real numbers such that $a^2+b^2=1,c^2+d^2=1$ and $ac+bd=0$. Determine all possible values of $ab+cd$.
$3n-1$ points are given in the plane, no three are collinear. Prove that one can select $2n$ of them whose convex hull is not a triangle.
Let $O$ be the circumcenter,$R$ be the circumradius, and $k$ be the circumcircle of a triangle $ABC$ . Let $k_1$ be a circle tangent to the rays $AB$ and $AC$, and also internally tangent to $k$. Let $k_2$ be a circle tangent to the rays $AB$ and $AC$ , and also externally tangent to $k$. Let $A_1$ and $A_2$ denote the respective centers of $k_1$ and $k_2$. Prove that: $(OA_1+OA_2)^2-A_1A_2^2 = 4R^2.$
A lattice point in an $xy$-coordinate system is any point $(x,y)$ where both $x$ and $y$ are integers. The graph of $y=mx+2$ passes through no lattice point with $0<x \le 100$ for all $m$ such that $\frac{1}{2}<m<a$. What is the maximum possible value of $a$? $ \textbf{(A)}\ \frac{51}{101} \qquad \textbf{(B)}\ \frac{50}{99} \qquad \textbf{(C)}\ \frac{51}{100} \qquad \textbf{(D)}\ \frac{52}{101} \qquad \textbf{(E)}\ \frac{13}{25} $
Find the function $\displaystyle{f : \mathbb{R}-\left\{ 0\,\right\} \rightarrow \mathbb{R} }$ such that $$f(x)+f(1-\frac{1}{x}) = \frac{1}{x},\,\,\, \forall x \in \mathbb{R}- \{ 0, 1\,\}$$ [i](-InnoXenT-)[/i]
Let $m$ and $n$ be positive integers satisfying the conditions [list] [*] $\gcd(m+n,210) = 1,$ [*] $m^m$ is a multiple of $n^n,$ and [*] $m$ is not a multiple of $n$. [/list] Find the least possible value of $m+n$.
Consider functions $f$ that satisfy $|f(x)-f(y)|\leq \frac{1}{2}|x-y|$ for all real numbers $x$ and $y$. Of all such functions that also satisfy the equation $f(300) = f(900)$, what is the greatest possible value of $$f(f(800))-f(f(400))?$$ $ \textbf{(A)}\ 25 \qquad \textbf{(B)}\ 50 \qquad \textbf{(C)}\ 100 \qquad \textbf{(D)}\ 150 \qquad \textbf{(E)}\ 200$
A furniture store set the sticker price of a table $40$ percent higher than the wholesale price that the store paid for the table. During a special sale, the table sold for $35$ percent less than this sticker price. Find the percent the final sale price was of the original wholesale price of the table.
Squares $ABB_{1}A_{2}$ and $BCC_{1}B_{2}$ are externally drawn on the hypotenuse $AB$ and on the leg $BC$ of a right triangle $ABC$ . Show that the lines $CA_{2}$ and $AB_{2}$ meet on the perimeter of a square with the vertices on the perimeter of triangle $ABC .$
Let $n>k>1$ be positive integers. Determine all positive real numbers $a_1, a_2, \ldots, a_n$ which satisfy $$ \sum_{i=1}^n \sqrt{\frac{k a_i^k}{(k-1) a_i^k+1}}=\sum_{i=1}^n a_i=n . $$
Consider a trapezium $AB \Gamma \Delta$, where $A\Delta \parallel B\Gamma$ and $\measuredangle A = 120^{\circ}$. Let $E$ be the midpoint of $AB$ and let $O_1$ and $O_2$ be the circumcenters of triangles $AE \Delta$ and $BE\Gamma$, respectively. Prove that the area of the trapezium is equal to six time the area of the triangle $O_1 E O_2$.
After school, Maya and Naomi headed to the beach, $6$ miles away. Maya decided to bike while Naomi took a bus. The graph below shows their journeys, indicating the time and distance traveled. What was the difference, in miles per hour, between Naomi's and Maya's average speeds? [asy] unitsize(1.25cm); dotfactor = 10; pen shortdashed=linetype(new real[] {2.7,2.7}); for (int i = 0; i < 6; ++i) { for (int j = 0; j < 6; ++j) { draw((i,0)--(i,6), grey); draw((0,j)--(6,j), grey); } } for (int i = 1; i <= 6; ++i) { draw((-0.1,i)--(0.1,i),linewidth(1.25)); draw((i,-0.1)--(i,0.1),linewidth(1.25)); label(string(5*i), (i,0), 2*S); label(string(i), (0, i), 2*W); } draw((0,0)--(0,6)--(6,6)--(6,0)--(0,0)--cycle,linewidth(1.25)); label(rotate(90) * "Distance (miles)", (-0.5,3), W); label("Time (minutes)", (3,-0.5), S); dot("Naomi", (2,6), 3*dir(305)); dot((6,6)); label("Maya", (4.45,3.5)); draw((0,0)--(1.15,1.3)--(1.55,1.3)--(3.15,3.2)--(3.65,3.2)--(5.2,5.2)--(5.4,5.2)--(6,6),linewidth(1.35)); draw((0,0)--(0.4,0.1)--(1.15,3.7)--(1.6,3.7)--(2,6),linewidth(1.35)+shortdashed); [/asy] $\textbf{(A) }6 \qquad \textbf{(B) }12 \qquad \textbf{(C) }18 \qquad \textbf{(D) }20 \qquad \textbf{(E) }24$
Let $(v_1, ..., v_{2^n})$ be the vertices of an $n$-dimensional hypercube. Label each vertex $v_i$ with a real number $x_i$. Label each edge of the hypercube with the product of labels of the two vertices it connects. Let $S$ be the sum of the labels of all the edges. Over all possible labelings, find the minimum possible value of $\frac{S}{x^2_1+ x^2_2+ ...+ x^2_n}$ in terms of $ n$. Note: an $n$ dimensional hypercube is a graph on $2^n$ vertices labeled labeled with the binary strings of length $n$, where two vertices have an edge between them if and only if their labels differ in exactly one place. For instance, the vertices $100$ and $101$ on the $3$ dimensional hypercube are connected, but the vertices $100$ and $111$ are not.
The real number $x$ satisfies the equation $x+\frac{1}{x}=\sqrt{5}$. What is the value of $x^{11}-7x^7+x^3$? $\textbf{(A)}\ -1 \qquad\textbf{(B)}\ 0 \qquad\textbf{(C)}\ 1 \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ 8$
For any $\triangle ABC$, its girth is$l$, its circumradius is$R$, its inscribed radius is $r$.Which one is true? $\text{(A)}l>R+r\qquad\text{(B)}l\leq R+r\qquad\text{(C)}\frac{l}{6}<R+r<6l\qquad\text{(D)}$None above
We are given a polyhedron with at least $5$ vertices, such that exactly $3$ edges meet in each of the vertices. Prove that we can assign a rational number to every vertex of the given polyhedron such that the following conditions are met: $(i)$ At least one of the numbers assigned to the vertices is equal to $2020$. $(ii)$ For every polygonal face, the product of the numbers assigned to the vertices of that face is equal to $1$.
We have \( n \) chips that are initially placed on the number line at position 0. On each move, we select a position \( x \in \mathbb{Z} \) where there are at least two chips; we take two of these chips, then place one at \( x-1 \) and the other at \( x+1 \). a) Prove that after a finite number of moves, regardless of how the moves are chosen, we will reach a final position where no two chips occupy the same number on the number line. b) For every possible final position, let \( \Delta \) represent the difference between the numbers where the rightmost and the leftmost chips are located. Find all possible values of \( \Delta \) in terms of \( n \).
There exist primes $p$ and $q$ such that \[ pq = 1208925819614629174706176 \times 2^{4404} - 4503599560261633 \times 134217730 \times 2^{2202} + 1. \] Find the remainder when $p+q$ is divided by $1000$. [i]Proposed by Evan Chen[/i]
Given is the positive integer $n > 2$. Real numbers $\mid x_i \mid \leq 1$ ($i = 1, 2, ..., n$) satisfying $\mid \sum_{i=1}^{n}x_i \mid > 1$. Prove that there exists positive integer $k$ such that $\mid \sum_{i=1}^{k}x_i - \sum_{i=k+1}^{n}x_i \mid \leq 1$.
A convex figure $F$ is such that any equilateral triangle with side $1$ has a parallel translation that takes all its vertices to the boundary of $F$. Is $F$ necessarily a circle?
A game is played in three moves. The first player picks any real number, then the second player makes it the coefficient of a cubic, except that the coefficient of $x^3$ is already fixed at $1$. Can the first player make his choices so that the final cubic has three distinct integer roots?
Let angle bisectors of angles $\angle BAC$ and $\angle ABC$ of triangle $ABC$ intersect sides $BC$ and $AC$ in points $D$ and $E$, respectively. Let points $F$ and $G$ be foots of perpendiculars from point $C$ on lines $AD$ and $BE$, respectively. Prove that $FG \mid \mid AB$
On the sides $AB$ and $BC$ of triangle $ABC$, points $M$ and $K$ are taken, respectively, so that $S_{KMC} + S_{KAC}=S_{ABC}$. Prove that all such lines $MK$ pass through one point.
If positive real numbers $x,y,z$ satisfy the following system of equations, compute $x+y+z$. $$xy+yz = 30$$ $$yz+zx = 36$$ $$zx+xy = 42$$ [i]Proposed by Nathan Xiong[/i]