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

1998 Bulgaria National Olympiad, 3

On the sides of a non-obtuse triangle $ABC$ a square, a regular $n$-gon and a regular $m$-gon ($m$,$n > 5$) are constructed externally, so that their centers are vertices of a regular triangle. Prove that $m = n = 6$ and find the angles of $\triangle ABC$.

2018 Polish MO Finals, 5

An acute triangle $ABC$ in which $AB<AC$ is given. Points $E$ and $F$ are feet of its heights from $B$ and $C$, respectively. The line tangent in point $A$ to the circle escribed on $ABC$ crosses $BC$ at $P$. The line parallel to $BC$ that goes through point $A$ crosses $EF$ at $Q$. Prove $PQ$ is perpendicular to the median from $A$ of triangle $ABC$.

2007 AMC 12/AHSME, 25

Tags:
Call a set of integers [i]spacy[/i] if it contains no more than one out of any three consecutive integers. How many subsets of $ \{1,2,3,\ldots,12\},$ including the empty set, are spacy? $ \textbf{(A)}\ 121 \qquad \textbf{(B)}\ 123 \qquad \textbf{(C)}\ 125 \qquad \textbf{(D)}\ 127 \qquad \textbf{(E)}\ 129$

2014 Contests, 2

Tags:
Let $x_1$, $x_2$, …, $x_{10}$ be 10 numbers. Suppose that $x_i + 2 x_{i + 1} = 1$ for each $i$ from 1 through 9. What is the value of $x_1 + 512 x_{10}$?

2009 Costa Rica - Final Round, 2

Prove that for that for every positive integer $ n$, the smallest integer that is greater than $ (\sqrt {3} \plus{} 1)^{2n}$ is divisible by $ 2^{n \plus{} 1}$.

2013 Argentina National Olympiad, 6

A positive integer $n$ is called [i]pretty[/i] if there exists two divisors $d_1,d_2$ of $n$ $(1\leq d_1,d_2\leq n)$ such that $d_2-d_1=d$ for each divisor $d$ of $n$ (where $1<d<n$). Find the smallest pretty number larger than $401$ that is a multiple of $401$.

2009 Romania National Olympiad, 3

Find all functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that verify the relation $$ f\left( x^3+y^3 \right) =xf\left( y^2 \right) + yf\left( x^2 \right) , $$ for all real numbers $ x,y. $

1966 IMO Longlists, 24

There are $n\geq 2$ people at a meeting. Show that there exist two people at the meeting who have the same number of friends among the persons at the meeting. (It is assumed that if $A$ is a friend of $B,$ then $B$ is a friend of $A;$ moreover, nobody is his own friend.)

2004 Greece Junior Math Olympiad, 1

The numbers $203$ and $298$ divided with the positive integer $x$ give both remainder $13$. Which are the possible values of $x$ ?

2003 Junior Balkan Team Selection Tests - Moldova, 4

Let $m$ and $n$ be arbitrary positive integers, and $a, b, c$ be different natural numbers of the form $2^m.5^n$. Determine the number of all equations of the form $ax^2-2bx+c=0$ if it is known that each equation has only one real solution.

2025 Vietnam Team Selection Test, 3

In a summer camp about Applied Maths, there are $8m+1$ boys (with $m > 5$) and some girls. Every girl is friend with exactly $3$ boys and for any $2$ boys, there is exactly $1$ girl who is their common friend. Let $n$ be the greatest number of girls that can be chosen from the camp to form a group such that every boy is friend with at most $1$ girl in the group. Prove that $n \geq 2m+1$.

1956 AMC 12/AHSME, 2

Tags:
Mr. Jones sold two pipes at $ \$ 1.20$ each. Based on the cost, his profit one was $ 20 \%$ and his loss on the other was $ 20 \%$. On the sale of the pipes, he: $ \textbf{(A)}\ \text{broke even} \qquad\textbf{(B)}\ \text{lost } 4\text{ cents} \qquad\textbf{(C)}\ \text{gained } 4\text{ cents} \qquad\textbf{(D)}\ \text{lost } 10 \text{ cents} \qquad\textbf{(E)}\ \text{gained } 10 \text{ cents}$

2003 Vietnam National Olympiad, 1

Let $f: \mathbb{R}\to\mathbb{R}$ is a function such that $f( \cot x ) = \cos 2x+\sin 2x$ for all $0 < x < \pi$. Define $g(x) = f(x) f(1-x)$ for $-1 \leq x \leq 1$. Find the maximum and minimum values of $g$ on the closed interval $[-1, 1].$

2021 Ukraine National Mathematical Olympiad, 6

The altitudes $AA_1, BB_1$ and $CC_1$ were drawn in the triangle $ABC$. Point $K$ is a projection of point $B$ on $A_1C_1$. Prove that the symmmedian $\vartriangle ABC$ from the vertex $B$ divides the segment $B_1K$ in half. (Anton Trygub)

2012 AIME Problems, 1

Find the number of ordered pairs of positive integer solutions $(m,n)$ to the equation $20m+12n=2012.$

2024 Kurschak Competition, 3

Let $p$ be a prime and $H\subseteq \{0,1,\ldots,p-1\}$ a nonempty set. Suppose that for each element $a\in H$ there exist elements $b$, $c\in H\setminus \{a\}$ such that $b+ c-2a$ is divisible by $p$. Prove that $p<4^k$, where $k$ denotes the cardinality of $H$.

2021 Thailand TSTST, 1

For each positive integer $n$, let $\rho(n)$ be the number of positive divisors of $n$ with exactly the same set of prime divisors as $n$. Show that, for any positive integer $m$, there exists a positive integer $n$ such that $\rho(202^n+1)\geq m.$

2024 AMC 10, 8

Tags: divisor
Let $N$ be the product of all the positive integer divisors of $42$. What is the units digit of $N$? $ \textbf{(A) }0 \qquad \textbf{(B) }2 \qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }8 \qquad $

2012 Math Prize For Girls Problems, 15

Kate has two bags $X$ and $Y$. Bag $X$ contains $5$ red marbles (and nothing else). Bag $Y$ contains $4$ red marbles and $1$ blue marble (and nothing else). Kate chooses one of her bags at random (each with probability $\frac{1}{2}$) and removes a random marble from that bag (each marble in that bag being equally likely). She repeats the previous step until one of the bags becomes empty. At that point, what is the probability that the blue marble is still in bag $Y$?

2014 Contests, 3

Let $ABC$ be a triangle and let $P$ be a point on $BC$. Points $M$ and $N$ lie on $AB$ and $AC$, respectively such that $MN$ is not parallel to $BC$ and $AMP N$ is a parallelogram. Line $MN$ meets the circumcircle of $ABC$ at $R$ and $S$. Prove that the circumcircle of triangle $RP S$ is tangent to $BC$.

1978 IMO Longlists, 46

We consider a fixed point $P$ in the interior of a fixed sphere$.$ We construct three segments $PA, PB,PC$, perpendicular two by two$,$ with the vertexes $A, B, C$ on the sphere$.$ We consider the vertex $Q$ which is opposite to $P$ in the parallelepiped (with right angles) with $PA, PB, PC$ as edges$.$ Find the locus of the point $Q$ when $A, B, C$ take all the positions compatible with our problem.

2004 Purple Comet Problems, 8

The number $2.5081081081081\ldots$ can be written as $\frac{m}{n}$ where $m$ and $n$ are natural numbers with no common factors. Find $m + n$.

2019 Mid-Michigan MO, 7-9

[b]p1.[/b] Prove that the equation $x^6 - 143x^5 - 917x^4 + 51x^3 + 77x^2 + 291x + 1575 = 0$ has no integer solutions. [b]p2.[/b] There are $81$ wheels in a storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that it can be detected with certainty after four measurements on a balance scale. [b]p3.[/b] Rob and Ann multiplied the numbers from $1$ to $100$ and calculated the sum of digits of this product. For this sum, Rob calculated the sum of its digits as well. Then Ann kept repeating this operation until he got a one-digit number. What was this number? [b]p4.[/b] Rui and Jui take turns placing bishops on the squares of the $ 8\times 8$ chessboard in such a way that bishops cannot attack one another. (In this game, the color of the rooks is irrelevant.) The player who cannot place a rook loses the game. Rui takes the first turn. Who has a winning strategy, and what is it? [b]p5.[/b] The following figure can be cut along sides of small squares into several (more than one) identical shapes. What is the smallest number of such identical shapes you can get? [img]https://cdn.artofproblemsolving.com/attachments/8/e/9cd09a04209774dab34bc7f989b79573453f35.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2001 Hungary-Israel Binational, 2

Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. If $n \geq 5$ and $e(G_{n}) \geq \frac{n^{2}}{4}+2$, prove that $G_{n}$ contains two triangles that share exactly one vertex.

2006 National Olympiad First Round, 14

Tags:
How many four digit perfect square numbers are there in the form $AABB$ where $A,B \in \{1,2,\dots, 9\}$? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 1 \qquad\textbf{(D)}\ 0 \qquad\textbf{(E)}\ \text{None of above} $