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

Let $N$ be the greatest integer multiple of $8,$ no two of whose digits are the same. What is the remainder when $N$ is divided by $1000?$
[b]p1.[/b] Find all integer solutions of the equation $a^2 - b^2 = 2002$. [b]p2.[/b] Prove that the disks drawn on the sides of a convex quadrilateral as on diameters cover this quadrilateral. [b]p3.[/b] $30$ students from one school came to Mathematical Olympiad. In how many different ways is it possible to place them in four rooms? [b]p4.[/b] A $12$ liter container is filled with gasoline. How to split it in two equal parts using two empty $5$ and $8$ liter containers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
The scores of this problem were: one time 17/20 (by the runner-up) one time 4/20 (by Andrei Negut) one time 1/20 (by the winner) the rest had zero... just to give an idea of the difficulty. Let $A_{i},B_{i},S_{i}$ ($i=1,2,3$) be invertible real $2\times 2$ matrices such that [list][*]not all $A_{i}$ have a common real eigenvector, [*]$A_{i}=S_{i}^{-1}B_{i}S_{i}$ for $i=1,2,3$, [*]$A_{1}A_{2}A_{3}=B_{1}B_{2}B_{3}=I$.[/list] Prove that there is an invertible $2\times 2$ matrix $S$ such that $A_{i}=S^{-1}B_{i}S$ for all $i=1,2,3$.
Prove that it is not possible to cover a $6\times 6$ square board with eighteen $2\times 1$ rectangles, in such a way that each of the lines going along the interior gridlines cuts at least one of the rectangles. Show also that it is possible to cover a $6\times 5$ rectangle with fifteen $2\times 1 $ rectangles so that the above condition is fulfilled.
Real numbers between 0 and 1, inclusive, are chosen in the following manner. A fair coin is flipped. If it lands heads, then it is flipped again and the chosen number is 0 if the second flip is heads and 1 if the second flip is tails. On the other hand, if the first coin flip is tails, then the number is chosen uniformly at random from the closed interval $[0,1]$. Two random numbers $x$ and $y$ are chosen independently in this manner. What is the probability that $|x-y| > \tfrac{1}{2}$? $\textbf{(A)} \frac{1}{3} \qquad \textbf{(B)} \frac{7}{16} \qquad \textbf{(C)} \frac{1}{2} \qquad \textbf{(D)} \frac{9}{16} \qquad \textbf{(E)} \frac{2}{3}$
There are $1,000,000$ piles of $1996$ coins in each of them, and in one pile there are only fake coins, and in all the others - only real ones. What is the smallest weighing number that can be used to determine a heap containing counterfeit coins if the scales used have one bowl and allow weighing as much weight as desired with an accuracy of one gram, and it is also known that each counterfeit coin weighs $9$ grams, and each real coin weighs $10$ grams?
The kid cut out of grid paper with the side of the cell $1$ rectangle along the grid lines and calculated its area and perimeter. Carlson snatched his scissors and cut out of this rectangle along the lines of the grid a square adjacent to the boundary of the rectangle. - My rectangle ... - kid sobbed. - There is something strange about this figure! - Nonsense, do not mention it - Carlson said - waving his hand carelessly. - Here you see, in this figure the perimeter is the same as the area of ​​the rectangle was, and the area is the same as was the perimeter! What size square did Carlson cut out?
Find all surjective functions $f: \mathbb R \to \mathbb R$ such that for every $x,y\in \mathbb R,$ we have \[f(x+f(x)+2f(y))=f(2x)+f(2y).\]
Let $ABCD$ be a convex quadrilateral, where $R$ and $S$ are points in $DC$ and $AB$, respectively, such that $AD=RC$ and $BC=SA$. Let $P$, $Q$ and $M$ be the midpoints of $RD$, $BS$ and $CA$, respectively. If $\angle MPC + \angle MQA = 90$, prove that $ABCD$ is cyclic.
$20.$ The circle $\omega$ touches the circle $\Omega$ internally at point $P.$ The centre $O$ of $\Omega$ is outside $\omega.$ Let $XY$ be a diameter of $\Omega$ which is also tangent to $\omega.$ Assume $PY>PX.$ Let $PY$ intersect $\omega$ at $z.$ If $YZ=2PZ,$ what is the magnitude of $\angle{PYX}$ in degrees $?$
In set $S$, there is an operation $'' \circ ''$ such that $\forall a,b \in S$, a unique $a \circ b \in S$ exists. And (i) $\forall a,b,c \in S$, $(a \circ b) \circ c = a \circ (b \circ c)$. (ii) $a \circ b \neq b \circ a$ when $a \neq b$. Prove that: a.) $\forall a,b,c \in S$, $(a \circ b) \circ c = a \circ c$. b.) If $S = \{1,2, \ldots, 1990\}$, try to define an operation $'' \circ ''$ in $S$ with the above properties.
We have $10$ points on a line $A_1,A_2\ldots A_{10}$ in that order. Initially there are $n$ chips on point $A_1$. Now we are allowed to perform two types of moves. Take two chips on $A_i$, remove them and place one chip on $A_{i+1}$, or take two chips on $A_{i+1}$, remove them, and place a chip on $A_{i+2}$ and $A_i$ . Find the minimum possible value of $n$ such that it is possible to get a chip on $A_{10}$ through a sequence of moves.
The incircle of a triangle $ABC$ touches its sides $BC$, $CA$, $AB$ at the points $X$, $Y$, $Z$, respectively. Let $X^{\prime}$, $Y^{\prime}$, $Z^{\prime}$ be the reflections of these points $X$, $Y$, $Z$ in the external angle bisectors of the angles $CAB$, $ABC$, $BCA$, respectively. Show that $Y^{\prime}Z^{\prime}\parallel BC$, $Z^{\prime}X^{\prime}\parallel CA$ and $X^{\prime}Y^{\prime}\parallel AB$.
For $ x \in (0, 1)$ let $ y \in (0, 1)$ be the number whose $ n$-th digit after the decimal point is the $ 2^{n}$-th digit after the decimal point of $ x$. Show that if $ x$ is rational then so is $ y$. [i]Proposed by J.P. Grossman, Canada[/i]
A positive number $ x$ has the property that $ x\%$ of $ x$ is $ 4$. What is $ x$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 20 \qquad \textbf{(E)}\ 40$
Let $f$ be a function from the set $X = \{1,2, \dots, 10\}$ to itself. Call a partition ($S$, $T$) of $X$ $f-balanced$ if for all $s \in S$ we have $f(s) \in T$ and for all $t \in T$ we have $f(t) \in S$. (A partition $(S, T)$ is a pair of subsets $S$ and $T$ of $X$ such that $S\cap T = \emptyset$ and $S \cup T = X$. Note that $(S, T)$ and $(T, S)$ are considered the same partition). Let $g(f)$ be the number of $f-balanced$ partitions, and let $m$ equal the maximum value of $g$ over all functions $f$ from $X$ to itself. If there are $k$ functions satisfying $g(f) = m$, determine $m+k$. [i]2016 CCA Math Bonanza Individual #12[/i]
Prove that the polynomial $P_n(x)=1+x+\frac{x^2}{2!}+\cdots +\frac{x^n}{n!}$ has no real zeros if $n$ is even and has exatly one real zero if $n$ is odd
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
Five unit squares are arranged in the coordinate plane as shown, with the lower left corner at the origin. The slanted line, extending from $ (a,0)$ to $ (3,3)$, divides the entire region into two regions of equal area. What is $ a$? [asy]size(200); defaultpen(linewidth(.8pt)+fontsize(8pt)); fill((2/3,0)--(3,3)--(3,1)--(2,1)--(2,0)--cycle,gray); xaxis("$x$",-0.5,4,EndArrow(HookHead,4)); yaxis("$y$",-0.5,4,EndArrow(4)); draw((0,1)--(3,1)--(3,3)--(2,3)--(2,0)); draw((1,0)--(1,2)--(3,2)); draw((2/3,0)--(3,3)); label("$(a,0)$",(2/3,0),S); label("$(3,3)$",(3,3),NE);[/asy]$ \textbf{(A)}\ \frac12\qquad \textbf{(B)}\ \frac35\qquad \textbf{(C)}\ \frac23\qquad \textbf{(D)}\ \frac34\qquad \textbf{(E)}\ \frac45$
For a natural number $n$, denote by $s(n)$ the sum of all positive divisors of n. Prove that for every $n > 1$ the product $s(n - 1)s(n)s(n + 1)$ is even.
Let $A = \{a_1, a_2, a_3, a_4, a_5\}$ be a set of $5$ positive integers. Show that for any rearrangement of $A$, $a_{i1}$, $a_{i2}$, $a_{i3}$, $a_{i4}$, $a_{i5}$, the product $$(a_{i1} -a_1) (a_{i2} -a_2) (a_{i3} -a_3) (a_{i4} -a_4) (a_{i5} -a_5)$$ is always even.
Alice and Bob are playing in the forest. They have six sticks of length 1, 2, 3, 4, 5, 6 inches. Somehow, they have managed to arrange these sticks, such that they form the sides of an equiangular hexagon. Compute the sum of all possible values of the area of the hexagon.
Let $ a_1, a_2, \ldots, a_{100}$ be nonnegative real numbers such that $ a^2_1 \plus{} a^2_2 \plus{} \ldots \plus{} a^2_{100} \equal{} 1.$ Prove that \[ a^2_1 \cdot a_2 \plus{} a^2_2 \cdot a_3 \plus{} \ldots \plus{} a^2_{100} \cdot a_1 < \frac {12}{25}. \] [i]Author: Marcin Kuzma, Poland[/i]
Solve the following system of equations $$\sin^2{x} + \cos^2{y} = y^4. $$ $$\sin^2{y} + \cos^2{x} = x^2. $$ [i]A. Khrabov[/i]
Let $n$ be a positive integer. Prove that $n^2 + n + 1$ cannot be written as the product of two positive integers of which the difference is smaller than $2\sqrt{n}$.