Found problems: 85335
2025 Kyiv City MO Round 1, Problem 2
Prove that the number
\[
3 \underbrace{99\ldots9}_{2025} \underbrace{60\ldots01}_{2025}
\]
is a square of a positive integer.
2021 CIIM, 3
Let $m,n$ and $N$ be positive integers and $\mathbb{Z}_{N}=\{0,1,\dots,N-1\}$ a set of residues modulo $N$. Consider a table $m\times n$ such that each one of the $mn$ cells has an element of $\mathbb{Z}_{N}$. A [i]move[/i] is choose an element $g\in \mathbb{Z}_{N}$, a cell in the table and add $+g$ to the elements in the same row/column of the chosen cell(the sum is modulo $N$). Prove that if $N$ is coprime with $m-1,n-1,m+n-1$ then any initial arrangement of your elements in the table cells can become any other arrangement using an finite quantity of moves.
2010 Dutch IMO TST, 2
Find all functions $f : R \to R$ which satisfy $f(x) = max_{y\in R} (2xy - f(y))$ for all $x \in R$.
2013 National Olympiad First Round, 14
Let $d(n)$ be the number of positive integers that divide the integer $n$. For all positive integral divisors $k$ of $64800$, what is the sum of numbers $d(k)$?
$
\textbf{(A)}\ 1440
\qquad\textbf{(B)}\ 1650
\qquad\textbf{(C)}\ 1890
\qquad\textbf{(D)}\ 2010
\qquad\textbf{(E)}\ \text{None of above}
$
2021 SAFEST Olympiad, 6
Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions:
[list]
[*] $(i)$ $f(n) \neq 0$ for at least one $n$;
[*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$;
[*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$.
[/list]
2009 IMO Shortlist, 5
Let $P(x)$ be a non-constant polynomial with integer coefficients. Prove that there is no function $T$ from the set of integers into the set of integers such that the number of integers $x$ with $T^n(x)=x$ is equal to $P(n)$ for every $n\geq 1$, where $T^n$ denotes the $n$-fold application of $T$.
[i]Proposed by Jozsef Pelikan, Hungary[/i]
2017 China Team Selection Test, 1
Given $n\ge 3$. consider a sequence $a_1,a_2,...,a_n$, if $(a_i,a_j,a_k)$ with i+k=2j (i<j<k) and $a_i+a_k\ne 2a_j$, we call such a triple a $NOT-AP$ triple. If a sequence has at least one $NOT-AP$ triple, find the least possible number of the $NOT-AP$ triple it contains.
2004 Junior Tuymaada Olympiad, 6
We call a positive integer [i] good[/i] if the sum of the reciprocals of all its natural divisors are integers. Prove that if
$ m $ is a [i]good [/i] number, and $ p> m $ is a prime number, then $ pm $ is not [i]good[/i].
1978 Bundeswettbewerb Mathematik, 3
Sunn and Tacks play a game alternately choosing a word among the following (German) words: ”bad”, ”binse”, ”kafig”, ”kosewort”, ”maitag”, ”name”, ”pol”, ”parade”, ”wolf”. Two words are said to compatible if they have exactly one consonant in common. In the first round, Sunn selects a word for herself and one for Tacks. In every consequent round, each player selects a word that is compatible with the one they chose in the previous round. Tacks wins the game if the two players successively select the same word.
(a) Prove that Tacks can always win. How many rounds are necessary for that?
(b) Upon Sunn’s desire, the word ”kafig” was replaced with the word ”feige”.
Prove that Sunn can prevent Tacks from winning.
2010 Indonesia TST, 1
find all pairs of relatively prime natural numbers $ (m,n) $ in such a way that there exists non constant polynomial f satisfying \[ gcd(a+b+1, mf(a)+nf(b) > 1 \]
for every natural numbers $ a $ and $ b $
2021 Kyiv Mathematical Festival, 3
Let $\omega$ be the circumcircle of a triangle $ABC$ ($AB>AC$), $E$ be the midpoint of the arc $AC$ which does not contain point $B,$ аnd $F$ the midpoint of the arc $AB$ which does not contain point $C.$ Lines $AF$ and $BE$ meet at point $P,$ line $CF$ and $AE$ meet at point $R,$ and the tangent to $\omega$ at point $A$ meets line $BC$ at point $Q.$ Prove that points $P,Q,R$ are collinear. (M. Kurskiy)
2000 Estonia National Olympiad, 4
Let $E$ be the midpoint of the side $AB$ of the parallelogram $ABCD$. Let $F$ be the projection of $B$ on $AC$. Prove that the triangle $ABF$ is isosceles
2024 Oral Moscow Geometry Olympiad, 4
Given a triangle $ABC$ in which the angle $B$ is equal to $60^\circ$. A circle inscribed in a triangle with a center $I$ touches the side $AC$ at point $K$. A line passing through the points of touching of this circle with the other sides of the triangle intersects the its circumcircle at points $M$ and $N$. Prove that the ray $KI$ divides the arc $MN$ in half.
1991 National High School Mathematics League, 2
Area of convex quadrilateral $ABCD$ is $1$. Prove that we can find four points on its side (vertex included) or inside, satisfying: area of triangles comprised of any three points of the four points is larger than $\frac{1}{4}$.
1982 IMO Longlists, 35
If the inradius of a triangle is half of its circumradius, prove that the triangle is equilateral.
2017-IMOC, G2
Given two acute triangles $\vartriangle ABC, \vartriangle DEF$. If $AB \ge DE, BC \ge EF$ and $CA \ge FD$, show that the area of $\vartriangle ABC$ is not less than the area of $\vartriangle DEF$
2003 Moldova Team Selection Test, 1
Let $ n\in N^*$. A permutation $ (a_1,a_2,...,a_n)$ of the numbers $ (1,2,...,n)$ is called [i]quadratic [/i] iff at least one of the numbers $ a_1,a_1\plus{}a_2,...,a_1\plus{}a_2\plus{}a\plus{}...\plus{}a_n$ is a perfect square. Find the greatest natural number $ n\leq 2003$, such that every permutation of $ (1,2,...,n)$ is quadratic.
ABMC Team Rounds, 2021
[u]Round 5[/u]
[b]5.1.[/b] Julia baked a pie for herself to celebrate pi day this year. If Julia bakes anyone pie on pi day, the following year on pi day she bakes a pie for herself with $1/3$ probability, she bakes her friend a pie with $1/6$ probability, and she doesn't bake anyone a pie with $1/2$ probability. However, if Julia doesn't make pie on pi day, the following year on pi day she bakes a pie for herself with $1/2$ probability, she bakes her friend a pie with $1/3$ probability, and she doesn't bake anyone a pie with $1/6$ probability. The probability that Julia bakes at least $2$ pies on pi day in the next $5$ years can be expressed as $p/q$, for relatively prime positive integers $p$ and $q$. Compute $p + q$.
[b]5.2.[/b] Steven is flipping a coin but doesn't want to appear too lucky. If he ips the coin $8$ times, the probability he only gets sequences of consecutive heads or consecutive tails that are of length $4$ or less can be expressed as $p/q$, for relatively prime positive integers $p$ and $q$. Compute $p + q$.
[b]5.3.[/b] Let $ABCD$ be a square with side length $3$. Further, let $E$ be a point on side$ AD$, such that $AE = 2$ and $DE = 1$, and let $F$ be the point on side $AB$ such that triangle $CEF$ is right with hypotenuse $CF$. The value $CF^2$ can be expressed as $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[u]Round 6[/u]
[b]6.1.[/b] Let $P$ be a point outside circle $\omega$ with center $O$. Let $A,B$ be points on circle $\omega$ such that $PB$ is a tangent to $\omega$ and $PA = AB$. Let $M$ be the midpoint of $AB$. Given $OM = 1$, $PB = 3$, the value of $AB^2$ can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$.
[b]6.2.[/b] Let $a_0, a_1, a_2,...$with each term defined as $a_n = 3a_{n-1} + 5a_{n-2}$ and $a_0 = 0$, $a_1 = 1$. Find the remainder when $a_{2020}$ is divided by $360$.
[b]6.3.[/b] James and Charles each randomly pick two points on distinct sides of a square, and they each connect their chosen pair of points with a line segment. The probability that the two line segments intersect can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$.
[u]Round 7[/u]
[b]7.1.[/b] For some positive integers $x, y$ let $g = gcd (x, y)$ and $\ell = lcm (2x, y)$: Given that the equation $xy+3g+7\ell = 168$ holds, find the largest possible value of $2x + y$.
[b]7.2.[/b] Marco writes the polynomials $$f(x) = nx^4 +2x^3 +3x^2 +4x+5$$ and $$g(x) = a(x-1)^4 +b(x-1)^3 +6(x-1)^2 + d(x - 1) + e,$$ where $n, a, b, d, e$ are real numbers. He notices that $g(i) = f(i) - |i|$ for each integer $i$ satisfying $-5 \le i \le -1$. Then $n^2$ can be expressed as $p/q$ for relatively prime positive integers $p, q$. Find $p + q$.
[b]7.3. [/b]Equilateral $\vartriangle ABC$ is inscribed in a circle with center $O$. Points $D$ and $E$ are chosen on minor arcs $AB$ and $BC$, respectively. Segment $\overline{CD}$ intersects $\overline{AB}$ and $\overline{AE}$ at $Y$ and $X$, respectively. Given that $\vartriangle DXE$ and $\vartriangle AXC$ have equal area, $\vartriangle AXY$ has area $ 1$, and $\vartriangle ABC$ has area $52$, find the area of $\vartriangle BXC$.
[u]Round 8[/u]
[b]8.[/b] Let $A$ be the number of total webpage visits our website received last month. Let $B$ be the number photos in our photo collection from ABMC onsite 2017. Let $M$ be the mean speed round score. Further, let $C$ be the number of times the letter c appears in our problem bank. Estimate
$$A \cdot B + M \cdot C.$$Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input.
$$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$
PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2766251p24226451]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2015 USAMTS Problems, 1
Fill in the spaces of the grid below with positive integers so that in each $2\times 2$ square with top left number $a$, top right number $b$, bottom left number $c$, and bottom right number $d$, either $a + d = b + c$ or $ad = bc$. You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.)
[asy]
size(3.85cm);
for (int i=0; i<=5; ++i)
draw((i,0)--(i,5), linewidth(.5));
for (int j=0; j<=5; ++j)
draw((0,j)--(5,j), linewidth(.5));
void draw_num(pair ll_corner, int num)
{
label(string(num), ll_corner + (0.5, 0.5), p = fontsize(19pt));
}
draw_num((0,0), 20);
draw_num((1, 0), 36);
draw_num((1,4), 9);
draw_num((4, 0), 32);
draw_num((0, 1), 15);
draw_num((0, 2), 10);
draw_num((0, 4), 3);
draw_num((1,3), 11);
draw_num((3,3), 7);
draw_num((4,3), 2);
draw_num((4,2), 16);
void foo(int x, int y, string n)
{
label(n, (x+0.5,y+0.5), p = fontsize(19pt));
}
foo(2, 4, " ");
foo(3, 4, " ");
foo(4, 4, " ");
foo(0, 3, " ");
foo(2, 3, " ");
foo(1, 2, " ");
foo(2, 2, " ");
foo(3, 2, " ");
foo(1, 1, " ");
foo(2, 1, " ");
foo(3, 1, " ");
foo(4, 1, " ");
foo(2, 0, " ");
foo(3, 0, " ");
[/asy]
2005 Iran Team Selection Test, 3
Suppose there are 18 lighthouses on the Persian Gulf. Each of the lighthouses lightens an angle with size 20 degrees. Prove that we can choose the directions of the lighthouses such that whole of the blue Persian (always Persian) Gulf is lightened.
2011 NIMO Summer Contest, 7
Let $P(x) = x^2 - 20x - 11$. If $a$ and $b$ are natural numbers such that $a$ is composite, $\gcd(a, b) = 1$, and $P(a) = P(b)$, compute $ab$.
Note: $\gcd(m, n)$ denotes the greatest common divisor of $m$ and $n$.
[i]Proposed by Aaron Lin
[/i]
2024 Harvard-MIT Mathematics Tournament, 3
Let $ABC$ be a scalene triangle and $M$ be the midpoint of $BC$. Let $X$ be the point such that $CX \parallel AB$ and $\angle AMX = 90^{\circ}.$ Prove that $AM$ bisects $\angle BAX$.
JOM 2025, 1
Given a positive real $t$, a set $S$ of nonnegative reals is called $t$-good if for any two distinct elements $a,b$ in $S$, $\frac{a+b}2\ge\sqrt{ab}+t$. For all positive reals $N$, find the maximum number of elements a $t$-good set can have, if all elements are at most $N$.
[i](Proposed by Ho Janson)[/i]
2003 France Team Selection Test, 2
$10$ cities are connected by one-way air routes in a way so that each city can be reached from any other by several connected flights. Let $n$ be the smallest number of flights needed for a tourist to visit every city and return to the starting city. Clearly $n$ depends on the flight schedule. Find the largest $n$ and the corresponding flight schedule.
2016 Turkey Team Selection Test, 5
Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that for all $m,n \in \mathbb{N}$ holds $f(mn)=f(m)f(n)$ and $m+n \mid f(m)+f(n)$ .