Found problems: 85335
2008 China Second Round Olympiad, 2
Let $f(x)$ be a periodic function with periods $T$ and $1$($0<T<1$).Prove that:
(1)If $T$ is rational,then there exists a prime $p$ such that $\frac{1}{p}$ is also a period of $f$;
(2)If $T$ is irrational,then there exists a strictly decreasing infinite sequence {$a_n$},with $1>a_n>0$ for all positive integer $n$,such that all $a_n$ are periods of $f$.
2018 IMO Shortlist, C1
Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.
Mathematical Minds 2024, P1
Find all positive integers $n\geqslant 2$ such that $d_{i+1}/d_i$ is an integer for all $1\leqslant i < k$, where $1=d_1<d_2<\dots <d_k=n$ are all the positive divisors of $n$.
[i]Proposed by Pavel Ciurea[/i]
2000 Singapore Team Selection Test, 3
There are $n$ blue points and $n$ red points on a straight line. Prove that the sum of all distances between pairs of points of the same colour is less than or equal to the sum of all distances between pairs of points of different colours
2015 Middle European Mathematical Olympiad, 4
Find all pairs of positive integers $(m,n)$ for which there exist relatively prime integers $a$ and $b$ greater than $1$ such that
$$\frac{a^m+b^m}{a^n+b^n}$$
is an integer.
1989 Iran MO (2nd round), 2
Let $n$ be a positive integer. Prove that the polynomial
\[P(x)= \frac{x^n}{n!}+\frac{x^{n-1}}{(n-1)!}+...+x+1 \]
Does not have any rational root.
1999 AMC 12/AHSME, 27
In triangle $ ABC$, $ 3\sin A \plus{} 4\cos B \equal{} 6$ and $ 4\sin B \plus{} 3\cos A \equal{} 1$. Then $ \angle C$ in degrees is
$ \textbf{(A)}\ 30\qquad
\textbf{(B)}\ 60\qquad
\textbf{(C)}\ 90\qquad
\textbf{(D)}\ 120\qquad
\textbf{(E)}\ 150$
2000 AMC 8, 2
Which of these numbers is less than its reciprocal?
$\textbf{(A)}\ -2\qquad
\textbf{(B)}\ -1\qquad
\textbf{(C)}\ 0\qquad
\textbf{(D)}\ 1\qquad
\textbf{(E)}\ 2$
2003 CentroAmerican, 5
A square board with $8\text{cm}$ sides is divided into $64$ squares square with each side $1\text{cm}$. Each box can be painted white or black. Find the total number of ways to colour the board so that each square of side $2\text{cm}$ formed by four squares with a common vertex contains two white and two black squares.
2000 Harvard-MIT Mathematics Tournament, 3
Five students take a test on which any integer score from $0$ to $100$ inclusive is possible. What is the largest possible difference between the median and the mean of the scores?
2023 CMIMC Integration Bee, 12
\[\lim_{n\to\infty} n^2 \int_0^1 x^n e^{-x}\log(x)\,\mathrm dx\]
[i]Proposed by Connor Gordon and Vlad Oleksenko[/i]
2019 AMC 12/AHSME, 24
Let $\omega=-\tfrac{1}{2}+\tfrac{1}{2}i\sqrt3.$ Let $S$ denote all points in the complex plane of the form $a+b\omega+c\omega^2,$ where $0\leq a \leq 1,0\leq b\leq 1,$ and $0\leq c\leq 1.$ What is the area of $S$?
$\textbf{(A) } \frac{1}{2}\sqrt3 \qquad\textbf{(B) } \frac{3}{4}\sqrt3 \qquad\textbf{(C) } \frac{3}{2}\sqrt3\qquad\textbf{(D) } \frac{1}{2}\pi\sqrt3 \qquad\textbf{(E) } \pi$
2018 Peru Iberoamerican Team Selection Test, P7
There is a finite set of points in the plane, where each point is painted in any of $ n $ different colors $ (n \ge 4) $. It is known that there is at least one point of each color and that the distance between any pair of different colored points is less than or equal a 1. Prove that it is possible to choose 3 colors so that, by removing all points of those colors, the remaining set of points can be covered with a radius circle $ \frac {1} {\sqrt {3}} $.
2006 Korea National Olympiad, 5
Find all positive integers $n$ such that $\phi(n)$ is the fourth power of some prime.
2002 Czech and Slovak Olympiad III A, 2
Consider an arbitrary equilateral triangle $KLM$, whose vertices $K, L$ and $M$ lie on the sides $AB, BC$ and $CD$, respectively, of a given square $ABCD$. Find the locus of the midpoints of the sides $KL$ of all such triangles $KLM$.
2005 Greece Team Selection Test, 3
Let the polynomial $P(x)=x^3+19x^2+94x+a$ where $a\in\mathbb{N}$. If $p$ a prime number, prove that no more than three numbers of the numbers $P(0), P(1),\ldots, P(p-1)$ are divisible by $p$.
TNO 2023 Senior, 2
Find all integers \( n > 1 \) such that all prime divisors of \( n^6 - 1 \) divide \( (n^2 - 1)(n^3 - 1) \).
2014 Harvard-MIT Mathematics Tournament, 17
Let $f:\mathbb{N}\to\mathbb{N}$ be a function satisfying the following conditions:
(a) $f(1)=1$.
(b) $f(a)\leq f(b)$ whenever $a$ and $b$ are positive integers with $a\leq b$.
(c) $f(2a)=f(a)+1$ for all positive integers $a$.
How many possible values can the $2014$-tuple $(f(1),f(2),\ldots,f(2014))$ take?
2007 Germany Team Selection Test, 3
Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$.
Find all local champions and determine their number.
[i]Proposed by Zoran Sunic, USA[/i]
1956 Poland - Second Round, 1
For what value of $ m $ is the polynomial $ x^3 + y^3 + z^3 + mxyz $ divisible by $ x + y + z $?
2016 Peru IMO TST, 14
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
2016 Argentina National Olympiad Level 2, 4
There is a board with $n$ rows and $12$ columns. Each cell of the board contains a $1$ or a $0$. The board has the following properties:
[list=i]
[*]All rows are distinct.
[*]Each row contains exactly $4$ cells with $1$.
[*]For every $3$ rows, there is a column that intersects them in $3$ cells with $0$.
[/list]
Find the largest $n$ for which a board with these properties exists.
2005 Peru MO (ONEM), 3
Let $A,B,C,D$, be four different points on a line $\ell$, so that $AB=BC=CD$. In one of the semiplanes determined by the line $\ell$, the points $P$ and $Q$ are chosen in such a way that the triangle $CPQ$ is equilateral with its vertices named clockwise. Let $M$ and $N$ be two points of the plane be such that the triangles $MAP$ and $NQD$ are equilateral (the vertices are also named clockwise). Find the angle $\angle MBN$.
2008 India National Olympiad, 3
Let $ A$ be a set of real numbers such that $ A$ has at least four elements. Suppose $ A$ has the property that $ a^2 \plus{} bc$ is a rational number for all distinct numbers $ a,b,c$ in $ A$. Prove that there exists a positive integer $ M$ such that $ a\sqrt{M}$ is a rational number for every $ a$ in $ A$.
2014 Iran MO (3rd Round), 4
A [b][u]word[/u][/b] is formed by a number of letters of the alphabet. We show words with capital letters. A [b][u]sentence[/u][/b] is formed by a number of words. For example if $A=aa$ and $B=ab$ then the sentence $AB$ is equivalent to $aaab$. In this language, $A^n$ indicates $\underbrace{AA \cdots A}_{n}$. We have an equation when two sentences are equal. For example $XYX=YZ^2$ and it means that if we write the alphabetic letters forming the words of each sentence, we get two equivalent sequences of alphabetic letters. An equation is [b][u]simplified[/u][/b], if the words of the left and the right side of the sentences of the both sides of the equation are different. Note that every word contains one alphabetic letter at least.
$\text{a})$We have a simplified equation in terms of $X$ and $Y$. Prove that both $X$ and $Y$ can be written in form of a power of a word like $Z$.($Z$ can contain only one alphabetic letter).
$\text{b})$ Words $W_1,W_2,\cdots , W_n$ are the answers of a simplified equation. Prove that we can produce these $n$ words with fewer words.
$\text{c})$ $n$ words $W_1,W_2,\cdots , W_n$ are the answers of a simplified system of equations. Define graph $G$ with vertices ${1,2 \cdots ,n}$ such that $i$ and $j$ are connected if in one of the equations, $W_i$ and $W_j$ be the two words appearing in the right side of each side of the equation.($\cdots W_i = \cdots W_j$). If we denote by $c$ the number of connected components of $G$, prove that these $n$ words can be produced with at most $c$ words.
[i]Proposed by Mostafa Einollah Zadeh Samadi[/i]