Found problems: 85335
1969 IMO Longlists, 26
$(GBR 3)$ A smooth solid consists of a right circular cylinder of height $h$ and base-radius $r$, surmounted by a hemisphere of radius $r$ and center $O.$ The solid stands on a horizontal table. One end of a string is attached to a point on the base. The string is stretched (initially being kept in the vertical plane) over the highest point of the solid and held down at the point $P$ on the hemisphere such that $OP$ makes an angle $\alpha$ with the horizontal. Show that if $\alpha$ is small enough, the string will slacken if slightly displaced and no longer remain in a vertical plane. If then pulled tight through $P$, show that it will cross the common circular section of the hemisphere and cylinder at a point $Q$ such that $\angle SOQ = \phi$, $S$ being where it initially crossed this section, and $\sin \phi = \frac{r \tan \alpha}{h}$.
2012 Bosnia And Herzegovina - Regional Olympiad, 2
On football toornament there were $4$ teams participating. Every team played exactly one match with every other team. For the win, winner gets $3$ points, while if draw both teams get $1$ point. If at the end of tournament every team had different number of points and first place team had $6$ points, find the points of other teams
2023 Estonia Team Selection Test, 5
We say that distinct positive integers $n, m$ are $friends$ if $\vert n-m \vert$ is a divisor of both ${}n$ and $m$. Prove that, for any positive integer $k{}$, there exist $k{}$ distinct positive integers such that any two of these integers are friends.
2017 NIMO Summer Contest, 4
The square $BCDE$ is inscribed in circle $\omega$ with center $O$. Point $A$ is the reflection of $O$ over $B$. A "hook" is drawn consisting of segment $AB$ and the major arc $\widehat{BE}$ of $\omega$ (passing through $C$ and $D$). Assume $BCDE$ has area $200$. To the nearest integer, what is the length of the hook?
[i]Proposed by Evan Chen[/i]
2010 CIIM, Problem 5
Let $n,d$ be integers with $n,k > 1$ such that $g.c.d(n,d!) = 1$. Prove that $n$ and $n+d$ are primes if and only if $$d!d((n-1)!+1) + n(d!-1) \equiv 0 \hspace{0.2cm} (\bmod n(n+d)).$$
2011 Princeton University Math Competition, A8
Let $1,\alpha_1,\alpha_2,...,\alpha_{10}$ be the roots of the polynomial $x^{11}-1$. It is a fact that there exists a unique polynomial of the form $f(x) = x^{10}+c_9x^9+ \dots + c_1x$ such that each $c_i$ is an integer, $f(0) = f(1) = 0$, and for any $1 \leq i \leq 10$ we have $(f(\alpha_i))^2 = -11$. Find $\left|c_1+2c_2c_9+3c_3c_8+4c_4c_7+5c_5c_6\right|$.
2015 AMC 12/AHSME, 20
Isosceles triangles $T$ and $T'$ are not congruent but have the same area and the same perimeter. The sides of $T$ have lengths $5$, $5$, and $8$, while those of $T'$ have lengths $a$, $a$, and $b$. Which of the following numbers is closest to $b$?
$\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }8$
2013 AIME Problems, 4
In the array of $13$ squares shown below, $8$ squares are colored red, and the remaining $5$ squares are colored blue. If one of all possible such colorings is chosen at random, the probability that the chosen colored array appears the same when rotated $90^{\circ}$ around the central square is $\tfrac{1}{n}$, where $n$ is a positive integer. Find $n$.
[asy]
draw((0,0)--(1,0)--(1,1)--(0,1)--(0,0));
draw((2,0)--(2,2)--(3,2)--(3,0)--(3,1)--(2,1)--(4,1)--(4,0)--(2,0));
draw((1,2)--(1,4)--(0,4)--(0,2)--(0,3)--(1,3)--(-1,3)--(-1,2)--(1,2));
draw((-1,1)--(-3,1)--(-3,0)--(-1,0)--(-2,0)--(-2,1)--(-2,-1)--(-1,-1)--(-1,1));
draw((0,-1)--(0,-3)--(1,-3)--(1,-1)--(1,-2)--(0,-2)--(2,-2)--(2,-1)--(0,-1));
size(100);
[/asy]
2023 Bulgarian Spring Mathematical Competition, 10.4
Find all positive integers $n$, such that there exists a positive integer $m$ and primes $1<p<q$ such that $q-p \mid m$ and $p, q \mid n^m+1$.
2011 Bosnia Herzegovina Team Selection Test, 1
In triangle $ABC$ it holds $|BC|= \frac{1}{2}(|AB|+|AC|)$. Let $M$ and $N$ be midpoints of $AB$ and $AC$, and let $I$ be the incenter of $ABC$. Prove that $A, M, I, N$ are concyclic.
2025 Euler Olympiad, Round 1, 3
Evaluate the following sum:
$$ \frac{1}{1} + \frac{1}{1 + 2} + \frac{1}{1 + 2 + 3} + \frac{1}{1 + 2 + 3 + 4} + \ldots + \frac{1}{1 + 2 + 3 + 4 + \dots + 2025} $$
[i]Proposed by Prudencio Guerrero Fernández[/i]
1997 Czech and Slovak Match, 5
The sum of several integers (not necessarily distinct) equals $1492$. Decide whether the sum of their seventh powers can equal (a) $1996$; (b) $1998$.
2014 Purple Comet Problems, 12
The first number in the following sequence is $1$. It is followed by two $1$'s and two $2$'s. This is followed by three $1$'s, three $2$'s, and three $3$'s. The sequence continues in this fashion.
\[1,1,1,2,2,1,1,1,2,2,2,3,3,3,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,\dots.\]
Find the $2014$th number in this sequence.
2019-IMOC, N5
Initially, Alice is given a positive integer $a_0$. At time $i$, Alice has two choices,
$$\begin{cases}a_i\mapsto\frac1{a_{i-1}}\\a_i\mapsto2a_{i-1}+1\end{cases}$$
Note that it is dangerous to perform the first operation, so Alice cannot choose this operation in two consecutive turns. However, if $x>8763$, then Alice could only perform the first operation. Determine all $a_0$ so that $\{i\in\mathbb N\mid a_i\in\mathbb N\}$ is an infinite set.
1999 Bulgaria National Olympiad, 2
Let $\{a_n\}$ be a sequence of integers satisfying $(n-1)a_{n+1}=(n+1)a_n-2(n-1) \forall n\ge 1$. If $2000|a_{1999}$, find the smallest $n\ge 2$ such that $2000|a_n$.
2024 China Girls Math Olympiad, 2
There are $8$ cards on which the numbers $1$, $2$, $\dots$, $8$ are written respectively. Alice and Bob play the following game: in each turn, Alice gives two cards to Bob, who must keep one card and discard the other. The game proceeds for four turns in total; in the first two turns, Bob cannot keep both of the cards with the larger numbers, and in the last two turns, Bob also cannot keep both of the cards with the larger numbers. Let $S$ be the sum of the numbers written on the cards that Bob keeps. Find the greatest positive integer $N$ for which Bob can guarantee that $S$ is at least $N$.
2007 Peru MO (ONEM), 2
Assuming that each point of a straight line is painted red or blue, arbitrarily, show that it is always possible to choose three points $A, B$ and $C$ in such a way straight, that are painted the same color and that: $$\frac{AB}{1}=\frac{BC}{2}=\frac{AC}{3}.$$
2016 ISI Entrance Examination, 3
If $P(x)=x^n+a_1x^{n-1}+...+a_{n-1}$ be a polynomial with real coefficients and $a_1^2<a_2$ then prove that not all roots of $P(x)$ are real.
2014 South africa National Olympiad, 1
Determine the last two digits of the product of the squares of all positive odd integers less than $2014$.
2019 Argentina National Olympiad, 5
There is an arithmetic progression of $7$ terms in which all the terms are different prime numbers. Determine the smallest possible value of the last term of such a progression.
Clarification: In an arithmetic progression of difference $d$ each term is equal to the previous one plus $d$.
1958 Miklós Schweitzer, 1
[b]1.[/b] Find the groups every generating system of which contains a basis. (A basis is a set of elements of the group such that the direct product of the cyclic groups generated by them is the group itself.) [b](A. 14)[/b]
2013 Purple Comet Problems, 3
In how many rearrangements of the numbers $1, \ 2, \ 3, \ 4, \ 5,\ 6, \ 7, \ 8,\ 9$ do the numbers form a $\textit{hill}$, that is, the numbers form an increasing sequence at the beginning up to a peak, and then form a decreasing sequence to the end such as in $129876543$ or $258976431$?
2015 Princeton University Math Competition, 16
Let $p, u, m, a, c$ be positive real numbers satisfying $5p^5+4u^5+3m^5+2a^5+c^5=91$. What is the
maximum possible value of:
\[18pumac + 2(2 + p)^2 + 23(1 + ua)^2 + 15(3 + mc)^2?\]
2016 NIMO Problems, 7
Let $A$ and $B$ be points with $AB=12$. A point $P$ in the plane of $A$ and $B$ is $\textit{special}$ if there exist points $X, Y$ such that
[list]
[*]$P$ lies on segment $XY$,
[*]$PX : PY = 4 : 7$, and
[*]the circumcircles of $AXY$ and $BXY$ are both tangent to line $AB$.
[/list]
A point $P$ that is not special is called $\textit{boring}$.
Compute the smallest integer $n$ such that any two boring points have distance less than $\sqrt{n/10}$ from each other.
[i]Proposed by Michael Ren[/i]
2024 HMNT, 8
Derek is bored in math class and is drawing a flower. He first draws $8$ points $A_1, A_2, \ldots, A_8$ equally spaced around an enormous circle. He then draws $8$ arcs outside the circle where the $i$th arc for $i = 1, 2, \ldots, 8$ has endpoints $A_i, A_{i+1}$ with $A_9 = A_1,$ such that all of the arcs have radius $1$ and any two consecutive arcs are tangent. Compute the perimeter of Derek’s $8$-petaled flower (not including the central circle).
[center]
[img]
https://cdn.artofproblemsolving.com/attachments/8/4/e8b23c587762c089adb77b29cae155209f5db5.png
[/img]
[/center]