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

2009 Romania National Olympiad, 3

Let $A,B\in \mathcal{M}_n(\mathbb{C})$ such that $AB=BA$ and $\det B\neq 0$. a) If $|\det(A+zB)|=1$ for any $z\in \mathbb{C}$ such that $|z|=1$, then $A^n=O_n$. b) Is the question from a) still true if $AB\neq BA$ ?

2019 Durer Math Competition Finals, 6

Find the smallest multiple of $81$ that only contains the digit $1$. How many $ 1$’s does it contain?

2021 Bolivia Ibero TST, 2

Let $f: \mathbb Z^+ \to \mathbb Z$ be a function such that [b]a)[/b] $f(p)=1$ for every prime $p$. [b]b)[/b] $f(xy)=xf(y)+yf(x)$ for every pair of positive integers $x,y$ Find the least number $n \ge 2021$ such that $f(n)=n$

1979 Spain Mathematical Olympiad, 7

Prove that the volume of a tire (torus) is equal to the volume of a cylinder whose base is a meridian section of that and whose height is the length of the circumference formed by the centers of the meridian sections.

2010 Germany Team Selection Test, 3

Find all functions $f$ from the set of real numbers into the set of real numbers which satisfy for all $x$, $y$ the identity \[ f\left(xf(x+y)\right) = f\left(yf(x)\right) +x^2\] [i]Proposed by Japan[/i]

1965 IMO Shortlist, 6

In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.

2003 Moldova Team Selection Test, 1

Each side of an arbitrarly triangle is divided into $ 2002$ congruent segments. After that, each vertex is joined with all "division" points on the opposite side. Prove that the number of the regions formed, in which the triangle is divided, is divisible by $ 6$. [i]Proposer[/i]: [b]Dorian Croitoru[/b]

1999 Turkey Junior National Olympiad, 1

Tags:
The chord $[CD]$ is parallel to the diameter $[AB]$ of a circle with center $O$. The tangent line at $A$ meet $BC$ and $BD$ at $E$ and $F$. If $|AB|=10$, calculate $|AE|\cdot |AF|$.

2021 Saudi Arabia Training Tests, 29

Prove that it is impossible to fill the cells of an $8 \times 8$ table with the numbers from $ 1$ to $64$ (each number must be used once) so that for each $2\times 2$ square, the difference between products of the numbers on it’s diagonals will be equal to $ 1$.

2022 VN Math Olympiad For High School Students, Problem 3

Tags: geometry
Let $ABC$ be a triangle with $\angle A,\angle B,\angle C <120^{\circ}$, $T$ is its [i]Fermat-Torricelli[/i] point. Consider a point $P$ lying on the same plane with $\triangle ABC$. Prove that: a)$$\dfrac{\overrightarrow {TA}}{TA}+\dfrac{\overrightarrow {TB}}{TB}+\dfrac{\overrightarrow {TC}}{TC}=\overrightarrow {0}.$$ b)$$PA + PB + PC \ge \frac{{\overrightarrow {PA} \overrightarrow {.TA} }}{{TA}} + \frac{{\overrightarrow {PB} .\overrightarrow {TB} }}{{TB}} + \frac{{\overrightarrow {PC} \overrightarrow {.TC} }}{{TC}}.$$ c)$$PA + PB + PC \ge TA + TB + TC$$and the equality occurs iff $P\equiv T$.

1994 Turkey Team Selection Test, 3

Find all integer pairs $(a,b)$ such that $a\cdot b$ divides $a^2+b^2+3$.

2003 Tournament Of Towns, 6

The signs "$+$" or "$-$" are placed in all cells of a $4 \times 4$ square table. It is allowed to change a sign of any cell altogether with signs of all its adjacent cells (i.e. cells having a common side with it). Find the number of different tables that could be obtained by iterating this procedure.

2022 Sharygin Geometry Olympiad, 8.1

Let $ABCD$ be a convex quadrilateral with $\angle{BAD} = 2\angle{BCD}$ and $AB = AD$. Let $P$ be a point such that $ABCP$ is a parallelogram. Prove that $CP = DP$.

2016 IMO Shortlist, A6

Tags: algebra
The equation $$(x-1)(x-2)\cdots(x-2016)=(x-1)(x-2)\cdots (x-2016)$$ is written on the board, with $2016$ linear factors on each side. What is the least possible value of $k$ for which it is possible to erase exactly $k$ of these $4032$ linear factors so that at least one factor remains on each side and the resulting equation has no real solutions?

1997 Slovenia National Olympiad, Problem 2

Tags: geometry
Points $M,N,P,Q$ are taken on the sides $AB,BC,CD,DA$ respectively of a square $ABCD$ such that $AM=BN=CP=DQ=\frac1nAB$. Find the ratio of the area of the square determined by the lines $MN,NP,PQ,QM$ to the ratio of $ABCD$.

2023 CIIM, 4

For a positive integer $n$, $\sigma(n)$ denotes the sum of the positive divisors of $n$. Determine $$\limsup\limits_{n\rightarrow \infty} \frac{\sigma(n^{2023})}{(\sigma(n))^{2023}}$$ [b]Note:[/b] Given a sequence ($a_n$) of real numbers, we say that $\limsup\limits_{n\rightarrow \infty} a_n = +\infty$ if ($a_n$) is not upper bounded, and, otherwise, $\limsup\limits_{n\rightarrow \infty} a_n$ is the smallest constant $C$ such that, for every real $K > C$, there is a positive integer $N$ with $a_n < K$ for every $n > N$.

2001 Bundeswettbewerb Mathematik, 4

Prove: For each positive integer is the number of divisors whose decimal representations ends with a 1 or 9 not less than the number of divisors whose decimal representations ends with 3 or 7.

2015 Iran Team Selection Test, 5

Let $A$ be a subset of the edges of an $n\times n $ table. Let $V(A)$ be the set of vertices from the table which are connected to at least on edge from $A$ and $j(A)$ be the number of the connected components of graph $G$ which it's vertices are the set $V(A)$ and it's edges are the set $A$. Prove that for every natural number $l$: $$\frac{l}{2}\leq min_{|A|\geq l}(|V(A)|-j(A)) \leq \frac{l}{2}+\sqrt{\frac{l}{2}}+1$$

2009 USAMTS Problems, 5

Tags: probability
Tina and Paul are playing a game on a square $S$. First, Tina selects a point $T$ inside $S$. Next, Paul selects a point $P$ inside $S$. Paul then colors blue all the points inside $S$ that are closer to $P$ than $T$ . Tina wins if the blue region thus produced is the interior of a triangle. Assuming that Paul is lazy and simply selects his point at random (and that Tina knows this), find, with proof, a point Tina can select to maximize her probability of winning, and compute this probability.

2007 Flanders Math Olympiad, 2

Tags: geometry
Given is a half circle with midpoint $O$ and diameter $AB$. Let $Z$ be a random point inside the half circle, and let $X$ be the intersection of $OZ$ and the half circle, and $Y$ the intersection of $AZ$ and the half circle. If $P$ is the intersection of $BY$ with the tangent line in $X$ to the half circle, show that $PZ \perp BX$.

2021 South East Mathematical Olympiad, 8

Determine all the pairs of positive integers $(a,b),$ such that $$14\varphi^2(a)-\varphi(ab)+22\varphi^2(b)=a^2+b^2,$$ where $\varphi(n)$ is Euler's totient function.

2001 National Olympiad First Round, 12

Tags:
A circle with center $O$ and radius $15$ is given. Let $P$ be a point such that $|OP|=9$. How many of the chords of the circle pass through $P$ and have integer length? $ \textbf{(A)}\ 11 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 13 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 29 $

2023 Bundeswettbewerb Mathematik, 4

Exactly $n$ chords (i.e. diagonals and edges) of a regular $2n$-gon are coloured red, satisfying the following two conditions: (1) Each of the $2n$ vertices occurs exactly once as the endpoint of a red chord. (2) No two red chords have the same length. For which positive integers $n \ge 2$ is this possible?

1998 All-Russian Olympiad Regional Round, 10.1

Let $f(x) = x^2 + ax + b cos x$. Find all values of parameter$ a$ and $b$, for which the equations $f(x) = 0$ and $f(f(x)) = 0 $have the same non-empty sets of real roots.

2010 Contests, 2

Let $n$ be an integer, $n \ge 2$. Find the remainder of the division of the number $n(n + 1)(n + 2)$ by $n - 1$.