Found problems: 85335
1982 IMO Longlists, 16
Let $p(x)$ be a cubic polynomial with integer coefficients with leading coefficient $1$ and with one of its roots equal to the product of the other two. Show that $2p(-1)$ is a multiple of $p(1)+p(-1)-2(1+p(0)).$
2010 Germany Team Selection Test, 3
A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$.
(a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced.
(b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$.
[i]Proposed by Jorge Tipe, Peru[/i]
2000 German National Olympiad, 2
For an integer $n \ge 2$, find all real numbers $x$ for which the polynomial $f(x) = (x-1)^4 +(x-2)^4 +...+(x-n)^4$ takes its minimum value.
2017 ASDAN Math Tournament, 4
How many $6$-digit positive integers have their digits in nondecreasing order from left to right? Note that $0$ cannot be a leading digit.
1998 Belarus Team Selection Test, 3
Let $1=d_1<d_2<d_3<...<d_k=n$ be all different divisors of positive integer $n$ written in ascending order. Determine all $n$ such that $$d_7^2+d_{10}^2=(n/d_{22})^2.$$
2021 Saudi Arabia IMO TST, 2
Find all positive integers $n$, such that $n$ is a perfect number and $\varphi (n)$ is power of $2$.
[i]Note:a positive integer $n$, is called perfect if the sum of all its positive divisors is equal to $2n$.[/i]
2017 Finnish National High School Mathematics Comp, 4
Let $m$ be a positive integer.
Two players, Axel and Elina play the game HAUKKU ($m$) proceeds as follows:
Axel starts and the players choose integers alternately. Initially, the set of integers is the set of positive divisors of a positive integer $m$ .The player in turn chooses one of the remaining numbers, and removes that number and all of its multiples from the list of selectable numbers. A player who has to choose number $1$, loses. Show that the beginner player, Axel, has a winning strategy in the HAUKKU ($m$) game for all $m \in Z_{+}$.
PS. As member Loppukilpailija noted, it should be written $m>1$, as the statement does not hold for $m = 1$.
2018 Iran MO (3rd Round), 2
Two intersecting circles $\omega_1$ and $\omega_2$ are given.Lines $AB,CD$ are common tangents of $\omega_1,\omega_2$($A,C \in \omega_1 ,B,D \in \omega_2$)
Let $M$ be the midpoint of $AB$.Tangents through $M$ to $\omega_1$ and $\omega_2$(other than $AB$) intersect $CD$ at $X,Y$.Let $I$ be the incenter of $MXY$.Prove that $IC=ID$.
2013 Math Prize For Girls Problems, 7
In the figure below, $\triangle ABC$ is an equilateral triangle.
[asy]
import graph;
unitsize(60);
axes("$x$", "$y$", (0, 0), (1.5, 1.5), EndArrow);
real w = sqrt(3) - 1;
pair A = (1, 1);
pair B = (0, w);
pair C = (w, 0);
draw(A -- B -- C -- cycle);
dot(Label("$A(1, 1)$", A, NE), A);
dot(Label("$B$", B, W), B);
dot(Label("$C$", C, S), C);
[/asy]
Point $A$ has coordinates $(1, 1)$, point $B$ is on the positive $y$-axis, and point $C$ is on the positive $x$-axis. What is the area of $\triangle ABC$?
1980 Miklós Schweitzer, 2
Let $ \mathcal{H}$ be the class of all graphs with at most $ 2^{\aleph_0}$ vertices not containing a complete subgraph of size $ \aleph_1$. Show that there is no graph $ H \in \mathcal{H}$ such that every graph in $ \mathcal{H}$ is a subgraph of $ H$.
[i]F. Galvin[/i]
1997 Canada National Olympiad, 2
The closed interval $A = [0, 50]$ is the union of a finite number of closed intervals, each of length $1$. Prove that some of the intervals can be removed so that those remaining are mutually disjoint and have total length greater than $25$.
Note: For reals $a\le b$, the closed interval $[a, b] := \{x\in \mathbb{R}:a\le x\le b\}$ has length $b-a$; disjoint intervals have [i]empty [/i]intersection.
2016 Turkey EGMO TST, 2
In a simple graph, there are two disjoint set of vertices $A$ and $B$ where $A$ has $k$ and $B$ has $2016$ vertices. Four numbers are written to each vertex using the colors red, green, blue and black. There is no any edge at the beginning. For each vertex in $A$, we first choose a color and then draw all edges from this vertex to the vertices in $B$ having a larger number with the chosen color. It is known that for each vertex in $B$, the set of vertices in $A$ connected to this vertex are different. Find the minimal possible value of $k$.
2022 Sharygin Geometry Olympiad, 10.8
Let $ABCA'B'C'$ be a centrosymmetric octahedron (vertices $A$ and $A'$, $B$ and $B'$, $C$ and $C'$ are opposite) such that the sums of four planar angles equal $240^o$ for each vertex. The Torricelli points $T_1$ and $T_2$ of triangles $ABC$ and $A'BC$ are marked. Prove that the distances from $T_1$ and $T_2$ to $BC$ are equal.
1976 Euclid, 5
Source: 1976 Euclid Part A Problem 5
-----
If $\log_8 m+\log_8 \frac{1}{6}=\frac{2}{3}$, then $m$ equals
$\textbf{(A) } \frac{1}{2} \qquad \textbf{(B) } \frac{2}{3} \qquad \textbf{(C) } \frac{23}{6} \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 24$
2001 India IMO Training Camp, 1
If on $ \triangle ABC$, trinagles $ AEB$ and $ AFC$ are constructed externally such that $ \angle AEB\equal{}2 \alpha$, $ \angle AFB\equal{} 2 \beta$.
$ AE\equal{}EB$, $ AF\equal{}FC$.
COnstructed externally on $ BC$ is triangle $ BDC$ with $ \angle DBC\equal{} \beta$ , $ \angle BCD\equal{} \alpha$.
Prove that 1. $ DA$ is perpendicular to $ EF$.
2. If $ T$ is the projection of $ D$ on $ BC$, then prove that $ \frac{DA}{EF}\equal{} 2 \frac{DT}{BC}$.
2023 VN Math Olympiad For High School Students, Problem 6
a) Given a triangle $ABC$ with $\angle BAC=90^{\circ}$ and the altitude $AH(H$ is on the side $BC).$
Prove that: the [i]Lemoine[/i] point of the triangle $ABC$ is the midpoint of $AH.$
b) If a triangle has its [i]Lemoine[/i] point is the midpoint of $1$ in $3$ symmedian segments, does that triangle need to be a right triangle? Explain why.
2009 IberoAmerican Olympiad For University Students, 7
Let $G$ be a group such that every subgroup of $G$ is subnormal. Suppose that there exists $N$ normal subgroup of $G$ such that $Z(N)$ is nontrivial and $G/N$ is cyclic. Prove that $Z(G)$ is nontrivial. ($Z(G)$ denotes the center of $G$).
[b]Note[/b]: A subgroup $H$ of $G$ is subnormal if there exist subgroups $H_1,H_2,\ldots,H_m=G$ of $G$ such that $H\lhd H_1\lhd H_2 \lhd \ldots \lhd H_m= G$ ($\lhd$ denotes normal subgroup).
2023 Rioplatense Mathematical Olympiad, 2
Let $ABCD$ be a convex quadrilateral with $AB>AD$ and $\angle B=\angle D=90^{\circ}$. Let $P$ be a point in the side $AB$ such that $AP=AD$. The lines $PD$ and $BC$ cut in the point $Q$. The perpendicular line to $AC$ passing by $Q$ cuts $AB$ in the point $R$. Let $S$ be the foot of perpendicular of $D$ to the line $AC$. Prove that $\angle PSQ=\angle RCP$.
2015 Belarus Team Selection Test, 3
Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively.
Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes.
[i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]
2011 ISI B.Stat Entrance Exam, 3
Let $\mathbb{R}$ denote the set of real numbers. Suppose a function $f: \mathbb{R} \to \mathbb{R}$ satisfies $f(f(f(x)))=x$ for all $x\in \mathbb{R}$. Show that
[b](i)[/b] $f$ is one-one,
[b](ii)[/b] $f$ cannot be strictly decreasing, and
[b](iii)[/b] if $f$ is strictly increasing, then $f(x)=x$ for all $x \in \mathbb{R}$.
PEN H Problems, 23
Find all $(x,y,z) \in {\mathbb{Z}}^3$ such that $x^{3}+y^{3}+z^{3}=x+y+z=3$.
2020 HK IMO Preliminary Selection Contest, 1
Let $n=(10^{2020}+2020)^2$. Find the sum of all the digits of $n$.
2018 PUMaC Number Theory A, 4
Let $n$ be a positive integer. Let $f(n)$ be the probability that, if divisors $a, b, c$ of $n$ are selected uniformly at random with replacement, then $\gcd(a, \text{lcm}(b, c)) = \text{lcm}(a, \gcd(b, c))$. Let $s(n)$ be the sum of the distinct prime divisors of $n$. If $f(n) < \frac{1}{2018}$, compute the smallest possible value of $s(n)$.
OIFMAT II 2012, 5
Let $ n \in N $. Let's define $ S_n = \{1, ..., n \} $. Let $ x_1 <x_2 <\cdots <x_n $ be any real. Determine the largest possible number of pairs $ (i, j) \in S_n \times S_n $ with $ i \not = j $, for which it is true that $ 1 <| x_i-x_j | <2 $ and justify why said value cannot be higher.
1986 Miklós Schweitzer, 8
Let $a_0=0$, $a_1, \ldots, a_k$ and $b_1, \ldots, b_k$ be arbitrary real numbers.
(i) Show that for all sufficiently large $n$ there exist polynomials $p_n$ of degree at most $n$ for which
$$p_n^{(i)} (-1)=a_i,\,\,\,\,\, p_n^{(i)} (1)=b_i,\,\,\,\,\, i=0, 1, \ldots, k$$
and
$$\max_{|x|\leq 1} |p_n (x)|\leq \frac{c}{n^2}\,\,\,\,\,\,\,\,\,\, (*)$$
where the constant $c$ depends only on the numbers $a_i, b_i$.
(ii) Prove that, in general, (*) cannot be replaced by the relation
$$\lim_{n\to\infty} n^2\cdot \max_{|x|\leq 1} |p_n (x)| = 0$$
[J. Szabados]