Found problems: 85335
2012 Irish Math Olympiad, 1
Let $$C=\{1,22,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20\}$$ and let
$$S=\{4,5,9,14,23,37\}$$ Find two sets $A$ and $B$ with the properties
(a) $A\cap B=\emptyset$.
(b) $A\cup B=C$.
(c) The sum of two distinct elements of $A$ is not in $S$.
(d) The sum of two distinct elements of $B$ is not in $S$.
2008 AMC 8, 9
In $2005$ Tycoon Tammy invested $\$100$ for two years. During the the first year
her investment suffered a $15\%$ loss, but during the second year the remaining
investment showed a $20\%$ gain. Over the two-year period, what was the change
in Tammy's investment?
$\textbf{(A)}\ 5\%\text{ loss}\qquad
\textbf{(B)}\ 2\%\text{ loss}\qquad
\textbf{(C)}\ 1\%\text{ gain}\qquad
\textbf{(D)}\ 2\% \text{ gain} \qquad
\textbf{(E)}\ 5\%\text{ gain}$
2014 Junior Balkan Team Selection Tests - Romania, 3
Let $n \ge 5$ be an integer. Prove that $n$ is prime if and only if for any representation of $n$ as a sum of four positive integers $n = a + b + c + d$, it is true that $ab \ne cd$.
1987 IMO Shortlist, 18
For any integer $r \geq 1$, determine the smallest integer $h(r) \geq 1$ such that for any partition of the set $\{1, 2, \cdots, h(r)\}$ into $r$ classes, there are integers $a \geq 0 \ ; 1 \leq x \leq y$, such that $a + x, a + y, a + x + y$ belong to the same class.
[i]Proposed by Romania[/i]
2009 Sharygin Geometry Olympiad, 9
Given $ n$ points on the plane, which are the vertices of a convex polygon, $ n > 3$. There exists $ k$ regular triangles with the side equal to $ 1$ and the vertices at the given points.
[list][*] Prove that $ k < \frac {2}{3}n$. [*] Construct the configuration with $ k > 0.666n$.[/list]
2019 China Team Selection Test, 1
Given complex numbers $x,y,z$, with $|x|^2+|y|^2+|z|^2=1$. Prove that: $$|x^3+y^3+z^3-3xyz| \le 1$$
2004 AMC 12/AHSME, 19
A truncated cone has horizontal bases with radii $ 18$ and $ 2$. A sphere is tangent to the top, bottom, and lateral surface of the truncated cone. What is the radius of the sphere?
$ \textbf{(A)}\ 6 \qquad
\textbf{(B)}\ 4\sqrt5 \qquad
\textbf{(C)}\ 9 \qquad
\textbf{(D)}\ 10 \qquad
\textbf{(E)}\ 6\sqrt3$
2018 Auckland Mathematical Olympiad, 3
Consider the pentagon below. Find its area.
[img]https://cdn.artofproblemsolving.com/attachments/7/b/02ad3852b72682513cf62a170ed4aa45c23785.png[/img]
2007 Harvard-MIT Mathematics Tournament, 9
$g$ is a twice differentiable function over the positive reals such that \begin{align}g(x)+2x^3g^\prime(x)+x^4g^{\prime\prime}(x)&= 0 \qquad\text{ for all positive reals } x\\\lim_{x\to\infty}xg(x)&=1\end{align}
Find the real number $\alpha>1$ such that $g(\alpha)=1/2$.
2025 USA IMO Team Selection Test, 1
Let $n$ be a positive integer. Ana and Banana play a game. Banana thinks of a function $f\colon\mathbb{Z}\to\mathbb{Z}$ and a prime number $p$. He tells Ana that $f$ is nonconstant, $p<100$, and $f(x+p)=f(x)$ for all integers $x$. Ana's goal is to determine the value of $p$. She writes down $n$ integers $x_1,\dots,x_n$. After seeing this list, Banana writes down $f(x_1),\dots,f(x_n)$ in order. Ana wins if she can determine the value of $p$ from this information. Find the smallest value of $n$ for which Ana has a winning strategy.
[i]Anthony Wang[/i]
2023 Paraguay Mathematical Olympiad, 4
We say that a positive integer is [i]Noble [/i] when: it is composite, it is not divisible by any prime number greater than $20$ and it is not divisible by any perfect cube greater than $1$. How many different Noble numbers are there?
1907 Eotvos Mathematical Competition, 1
If $p$ and $q$ are odd integers, prove that the equation
$$x^2 + 2px + 2q = 0$$
has no rational roots.
2010 LMT, 25-27
$25.$ Let $C$ be the answer to Problem $27.$ What is the $C$-th smallest positive integer with exactly four positive factors?
$26.$ Let $A$ be the answer to Problem $25.$ Determine the absolute value of the difference between the two positive integer roots of the quadratic equation $x^2-Ax+48=0$
$27.$ Let $B$ be the answer to Problem $26.$ Compute the smallest integer greater than $\frac{B}{\pi}$
2011 Brazil Team Selection Test, 2
Find the least positive integer $n$ for which there exists a set $\{s_1, s_2, \ldots , s_n\}$ consisting of $n$ distinct positive integers such that
\[ \left( 1 - \frac{1}{s_1} \right) \left( 1 - \frac{1}{s_2} \right) \cdots \left( 1 - \frac{1}{s_n} \right) = \frac{51}{2010}.\]
[i]Proposed by Daniel Brown, Canada[/i]
2002 Estonia National Olympiad, 3
The teacher writes a $2002$-digit number consisting only of digits $9$ on the blackboard.
The first student factors this number as $ab$ with $a > 1$ and $b > 1$ and replaces it on the blackboard by two numbers $a'$ and $b'$ with $|a-a'| = |b-b'| = 2$. The second student chooses one of the numbers on the blackboard, factors it as $cd$ with $c > 1$ and $d > 1$ and replaces the chosen number by two numbers $c'$ and $d'$ with $|c-c'| = |d-d'| = 2$, etc. Is it possible that after a certain number of students have been to the blackboard all numbers written there are equal to $9$?
2009 National Olympiad First Round, 13
In trapezoid $ ABCD$, $ AB \parallel CD$, $ \angle CAB < 90^\circ$, $ AB \equal{} 5$, $ CD \equal{} 3$, $ AC \equal{} 15$. What are the sum of different integer values of possible $ BD$?
$\textbf{(A)}\ 101 \qquad\textbf{(B)}\ 108 \qquad\textbf{(C)}\ 115 \qquad\textbf{(D)}\ 125 \qquad\textbf{(E)}\ \text{None}$
1972 IMO Shortlist, 4
Let $n_1, n_2$ be positive integers. Consider in a plane $E$ two disjoint sets of points $M_1$ and $M_2$ consisting of $2n_1$ and $2n_2$ points, respectively, and such that no three points of the union $M_1 \cup M_2$ are collinear. Prove that there exists a straightline $g$ with the following property: Each of the two half-planes determined by $g$ on $E$ ($g$ not being included in either) contains exactly half of the points of $M_1$ and exactly half of the points of $M_2.$
2013 Kazakhstan National Olympiad, 1
Find maximum value of
$|a^2-bc+1|+|b^2-ac+1|+|c^2-ba+1|$ when $a,b,c$ are reals in $[-2;2]$.
2005 Postal Coaching, 26
Let $a_1,a_2,\ldots a_n$ be real numbers such that their sum is equal to zero. Find the value of \[ \sum_{j=1}^{n} \frac{1}{a_j (a_j +a _{j+1}) (a_j + a_{j+1} + a_{j+2}) \ldots (a_j + \ldots a_{j+n-2})}. \]
where the subscripts are taken modulo $n$ assuming none of the denominators is zero.
1962 Bulgaria National Olympiad, Problem 2
It is given a circle with center $O$ and radius $r$. $AB$ and $MN$ are two diameters. The lines $MB$ and $NB$ are tangent to the circle at the points $M'$ and $N'$ and intersect at point $A$. $M''$ and $N''$ are the midpoints of the segments $AM'$ and $AN'$. Prove that:
(a) the points $M,N,N',M'$ are concyclic.
(b) the heights of the triangle $M''N''B$ intersect in the midpoint of the radius $OA$.
2014 Purple Comet Problems, 29
Consider the sequences of six positive integers $a_1,a_2,a_3,a_4,a_5,a_6$ with the properties that $a_1=1$, and if for some $j > 1$, $a_j = m > 1$, then $m-1$ appears in the sequence $a_1,a_2,\dots,a_{j-1}$. Such sequences include $1,1,2,1,3,2$ and $1,2,3,1,4,1$ but not $1,2,2,4,3,2$. How many such sequences of six positive integers are there?
2008 ITest, 98
Convex quadrilateral $ABCD$ has side-lengths $AB=7$, $BC=9$, $CD=15$, and there exists a circle, lying inside the quadrilateral and having center $I$, that is tangent to all four sides of the quadrilateral. Points $M$ and $N$ are the midpoints of $AC$ and $BD$ respectively. It can be proven that point $I$ always lies on segment $MN$. Supposing further that $I$ is the midpoint of $MN$, the area of quadrilateral $ABCD$ may be expressed as $p\sqrt q$, where $p$ and $q$ are positive integers and $q$ is not divisible by the square of any prime. Compute $p\cdot q$.
1994 French Mathematical Olympiad, Problem 2
Let be given a semi-sphere $\Sigma$ whose base-circle lies on plane $p$. A variable plane $Q$, parallel to a fixed plane non-perpendicular to $P$, cuts $\Sigma$ at a circle $C$. We denote by $C'$ the orthogonal projection of $C$ onto $P$. Find the position of $Q$ for which the cylinder with bases $C$ and $C'$ has the maximum volume.
2020 DMO Stage 1, 4.
[b]Q[/b] Let $n\geq 2$ be a fixed positive integer and let $d_1,d_2,...,d_m$ be all positive divisors of $n$. Prove that:
$$\frac{d_1+d_2+...+d_m}{m}\geq \sqrt{n+\frac{1}{4}}$$Also find the value of $n$ for which the equality holds.
[i]Proposed by dangerousliri [/i]
1999 Turkey MO (2nd round), 6
We wish to find the sum of $40$ given numbers utilizing $40$ processors. Initially, we have the number $0$ on the screen of each processor. Each processor adds the number on its screen with a number entered directly (only the given numbers could be entered directly to the processors) or transferred from another processor in a unit time. Whenever a number is transferred from a processor to another, the former processor resets. Find the least time needed to find the desired sum.