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

1980 All Soviet Union Mathematical Olympiad, 295

Some squares of the infinite sheet of cross-lined paper are red. Each $2\times 3$ rectangle (of $6$ squares) contains exactly two red squares. How many red squares can be in the $9\times 11$ rectangle of $99$ squares?

2021 Sharygin Geometry Olympiad, 22

A convex polyhedron and a point $K$ outside it are given. For each point $M$ of a polyhedron construct a ball with diameter $MK$. Prove that there exists a unique point on a polyhedron which belongs to all such balls.

1999 Singapore Team Selection Test, 2

Find all possible values of $$ \lfloor \frac{x - p}{p} \rfloor + \lfloor \frac{-x-1}{p} \rfloor $$ where $x$ is a real number and $p$ is a nonzero integer. Here $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$.

2014 India PRMO, 14

Tags: inequality
One morning, each member of Manjul’s family drank an $8$-ounce mixture of coffee and milk. The amounts of coffee and milk varied from cup to cup, but were never zero. Manjul drank $1/7$-th of the total amount of milk and $2/17$-th of the total amount of coffee. How many people are there in Manjul’s family?

2011 Today's Calculation Of Integral, 719

Compute $\int_0^x \sin t\cos t\sin (2\pi\cos t)\ dt$.

2012 CHMMC Spring, 8

A special kind of chess knight is in the origin of an infinite grid. It can make one of twelve different moves: it can move directly up, down, left, or right one unit square, or it can move $1$ units in one direction and $3$ units in an orthogonal direction. How many different squares can it be on after $2$ moves?

2000 Manhattan Mathematical Olympiad, 1

Tags:
Jane and Josh wish to buy a candy. However Jane needs seven more cents to buy the candy, while John needs one more cent. They decide to buy only one candy together, but discover that they do not have enough money. How much does the candy cost?

2016 Balkan MO Shortlist, G3

Given that $ABC$ is a triangle where $AB < AC$. On the half-lines $BA$ and $CA$ we take points $F$ and $E$ respectively such that $BF = CE = BC$. Let $M,N$ and $H$ be the mid-points of the segments $BF,CE$ and $BC$ respectively and $K$ and $O$ be the circumcenters of the triangles $ABC$ and $MNH$ respectively. We assume that $OK$ cuts $BE$ and $HN$ at the points $A_1$ and $B_1$ respectively and that $C_1$ is the point of intersection of $HN$ and $FE$. If the parallel line from $A_1$ to $OC_1$ cuts the line $FE$ at $D$ and the perpendicular from $A_1$ to the line $DB_1$ cuts $FE$ at the point $M_1$, prove that $E$ is the orthocenter of the triangle $A_1OM_1$.

2013 Argentina National Olympiad, 5

Given several nonnegative integers (repetitions allowed), the allowed operation is to choose a positive integer $a$ and replace each number $b$ greater than or equal to $a$ by $b-a$ (the numbers $a$ , if any, are replaced by $0$). Initially, the integers from $1$ are written on the blackboard until $2013$ inclusive. After a few operations the numbers on the board have a sum equal to $10$. Determine what the numbers that remained on the board could be. Find all the possibilities.

2000 Poland - Second Round, 5

Decide whether exists function $f: \mathbb{N} \rightarrow \mathbb{N}$, such that for each $n \in \mathbb{N}$ is $f(f(n) )= 2n$.

2014 Saint Petersburg Mathematical Olympiad, 4

$a_1\geq a_2\geq... \geq a_{100n}>0$ If we take from $(a_1,a_2,...,a_{100n})$ some $2n+1$ numbers $b_1\geq b_2 \geq ... \geq b_{2n+1}$ then $b_1+...+b_n > b_{n+1}+...b_{2n+1}$ Prove, that $$(n+1)(a_1+...+a_n)>a_{n+1}+a_{n+2}+...+a_{100n}$$

2022 JHMT HS, 5

Consider an array of white unit squares arranged in a rectangular grid with $59$ rows of unit squares and $c$ columns of unit squares, for some positive integer $c$. What is the smallest possible value of $c$ such that, if we shade exactly $25$ unit squares in each column black, then there must necessarily be some row with at least $18$ black unit squares?

2019 Malaysia National Olympiad, B1

Tags: algebra
Given three nonzero real numbers $a,b,c,$ such that $a>b>c$, prove the equation has at least one real root. $$\frac{1}{x+a}+\frac{1}{x+b}+\frac{1}{x+c}-\frac{3}{x}=0$$ @below sorry, I believe I fixed it with the added constraint.

2017 NIMO Summer Contest, 11

Tags: geometry
Let $a, b, c, p, q, r > 0$ such that $(a,b,c)$ is a geometric progression and $(p, q, r)$ is an arithmetic progression. If \[a^p b^q c^r = 6 \quad \text{and} \quad a^q b^r c^p = 29\] then compute $\lfloor a^r b^p c^q \rfloor$. [i]Proposed by Michael Tang[/i]

1969 Putnam, B2

Tags: group theory
Show that a finite group can not be the union of two of its proper subgroups. Does the statement remain true if "two' is replaced by "three'?

2024 Harvard-MIT Mathematics Tournament, 5

Tags: algebra
Compute the unique ordered pair $(x, y)$ of real numbers satisfying the system of equations $$\frac{x}{\sqrt{x^2 + y^2}}-\frac{1}{x}= 7 \,\,\, \text{and} \,\,\, \frac{y}{\sqrt{x^2 + y^2}}+\frac{1}{y}=4 $$

2021 Peru PAGMO TST, P6

Tags: algebra , function
Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for any real numbers $x$ and $y$ the following is true: $$x^2+y^2+2f(xy)=f(x+y)(f(x)+f(y))$$

Kyiv City MO Seniors 2003+ geometry, 2022.11.3

Let $H$ and $O$ be the orthocenter and the circumcenter of the triangle $ABC$. Line $OH$ intersects the sides $AB, AC$ at points $X, Y$ correspondingly, so that $H$ belongs to the segment $OX$. It turned out that $XH = HO = OY$. Find $\angle BAC$. [i](Proposed by Oleksii Masalitin)[/i]

2017 China Northern MO, 6

Define $S_r(n)$: digit sum of $n$ in base $r$. For example, $38=(1102)_3,S_3(38)=1+1+0+2=4$. Prove: [b](a)[/b] For any $r>2$, there exists prime $p$, for any positive intenger $n$, $S_{r}(n)\equiv n\mod p$. [b](b)[/b] For any $r>1$ and prime $p$, there exists infinitely many $n$, $S_{r}(n)\equiv n\mod p$.

1991 Polish MO Finals, 1

Tags: geometry
Prove or disprove that there exist two tetrahedra $T_1$ and $T_2$ such that: (i) the volume of $T_1$ is greater than that of $T_2$; (ii) the area of any face of $T_1$ does not exceed the area of any face of $T_2$.

1993 Dutch Mathematical Olympiad, 5

Tags: geometry
Eleven distinct points $ P_1,P_2,...,P_{11}$ are given on a line so that $ P_i P_j \le 1$ for every $ i,j$. Prove that the sum of all distances $ P_i P_j, 1 \le i <j \le 11$, is smaller than $ 30$.

2015 ELMO Problems, 3

Let $\omega$ be a circle and $C$ a point outside it; distinct points $A$ and $B$ are selected on $\omega$ so that $\overline{CA}$ and $\overline{CB}$ are tangent to $\omega$. Let $X$ be the reflection of $A$ across the point $B$, and denote by $\gamma$ the circumcircle of triangle $BXC$. Suppose $\gamma$ and $\omega$ meet at $D \neq B$ and line $CD$ intersects $\omega$ at $E \neq D$. Prove that line $EX$ is tangent to the circle $\gamma$. [i]Proposed by David Stoner[/i]

1999 South africa National Olympiad, 5

Let $S$ be the set of all rational numbers whose denominators are powers of 3. Let $a$, $b$ and $c$ be given non-zero real numbers. Determine all real-valued functions $f$ that are defined for $x \in S$, satisfy \[ f(x) = af(3x) + bf(3x - 1) + cf(3x - 2) \textrm{ if }0 \leq x \leq 1, \] and are zero elsewhere.

2021 Bosnia and Herzegovina Junior BMO TST, 4

Let $n$ be a nonzero natural number and let $S = \{1, 2, . . . , n\}$. A $3 \times n$ board is called [i]beautiful [/i] if it can be completed with numbers from the set $S$ like this as long as the following conditions are met: $\bullet$ on each line, each number from the set S appears exactly once, $\bullet$ on each column the sum of the products of two numbers on that column is divisible by $n$ (that is, if the numbers $a, b, c$ are written on a column, it must be $ab + bc + ca$ be divisible by $n$). For which values ​​of the natural number $n$ are there beautiful tables ¸and for which values ​​do not exist? Justify your answer.

2011 India Regional Mathematical Olympiad, 4

Tags:
Consider a $20$-sided convex polygon $K$, with vertices $A_1, A_2,...,A_{20}$ in that order. Find the number of ways in which three sides of $K$ can be chosen so that every pair among them has at least two sides of $K$ between them. (For example $(A_1A_2, A_4A_5, A_{11}A_{12})$ is an admissible triple while $(A_1A_2, A_4A_5, A_{19}A_{20})$ is not.