Found problems: 85335
2020 Korea Junior Math Olympiad, 2
Let $ABC$ be an acute triangle with circumcircle $\Omega$ and $\overline{AB} < \overline{AC}$. The angle bisector of $A$ meets $\Omega$ again at $D$, and the line through $D$, perpendicular to $BC$ meets $\Omega$ again at $E$. The circle centered at $A$, passing through $E$ meets the line $DE$ again at $F$. Let $K$ be the circumcircle of triangle $ADF$. Prove that $AK$ is perpendicular to $BC$.
2024 Brazil Team Selection Test, 5
Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$.
Determine the smallest number of pieces Paul needs to make in order to accomplish this.
2013 AMC 8, 21
Samantha lives 2 blocks west and 1 block south of the southwest corner of City Park. Her school is 2 blocks east and 2 blocks north of the northeast corner of City Park. On school days she bikes on streets to the southwest corner of City Park, then takes a diagonal path through the park to the northeast corner, and then bikes on streets to school. If her route is as short as possible, how many different routes can she take?
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 18$
1999 Baltic Way, 20
Let $a,b,c$ and $d$ be prime numbers such that $a>3b>6c>12d$ and $a^2-b^2+c^2-d^2=1749$. Determine all possible values of $a^2+b^2+c^2+d^2$ .
2018 BMT Spring, 7
Let $$h_n := \sum_{k=0}^n \binom{n}{k} \frac{2^{k+1}}{(k+1)}.$$ Find $$\sum_{n=0}^\infty \frac{h_n}{n!}.$$
2013 Sharygin Geometry Olympiad, 4
Given a square cardboard of area $\frac{1}{4}$, and a paper triangle of area $\frac{1}{2}$ such that the square of its sidelength is a positive integer. Prove that the triangle can be folded in some ways such that the squace can be placed inside the folded figure so that both of its faces are completely covered with paper.
[i]Proposed by N.Beluhov, Bulgaria[/i]
1987 IMO Shortlist, 8
(a) Let $\gcd(m, k) = 1$. Prove that there exist integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ such that each product $a_ib_j$ ($i = 1, 2, \cdots ,m; \ j = 1, 2, \cdots, k$) gives a different residue when divided by $mk.$
(b) Let $\gcd(m, k) > 1$. Prove that for any integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ there must be two products $a_ib_j$ and $a_sb_t$ ($(i, j) \neq (s, t)$) that give the same residue when divided by $mk.$
[i]Proposed by Hungary.[/i]
1949 Putnam, B3
Let $K$ be a closed plane curve such that the distance between any two points of $K$ is always less than $1.$ Show that $K$ lies in a circle of radius $\frac{1}{\sqrt{3}}.$
2018 Pan African, 3
For any positive integer $x$, we set
$$
g(x) = \text{ largest odd divisor of } x,
$$
$$
f(x) = \begin{cases}
\frac{x}{2} + \frac{x}{g(x)} & \text{ if } x \text{ is even;} \\
2^{\frac{x+1}{2}} & \text{ if } x \text{ is odd.}
\end{cases}
$$
Consider the sequence $(x_n)_{n \in \mathbb{N}}$ defined by $x_1 = 1$, $x_{n + 1} = f(x_n)$. Show that the integer $2018$ appears in this sequence, determine the least integer $n$ such that $x_n = 2018$, and determine whether $n$ is unique or not.
2009 Saint Petersburg Mathematical Olympiad, 2
$ABCD$ is convex quadrilateral with $AB=CD$. $AC$ and $BD$ intersect in $O$. $X,Y,Z,T$ are midpoints of $BC,AD,AC,BD$. Prove, that circumcenter of $OZT$ lies on $XY$.
2002 Bundeswettbewerb Mathematik, 1
A pile of cards, numbered with $1$, $2$, ..., $n$, is being shuffled. Afterwards, the following operation is repeatedly performed: If the uppermost card of the pile has the number $k$, then we reverse the order of the $k$ uppermost cards.
Prove that, after finitely many executions of this operation, the card with the number $1$ will become the uppermost card of the pile.
2017 ASDAN Math Tournament, 5
Regular hexagon $ABCDEF$ has side length $2$. Line segment $BD$ is drawn, and circle $O$ is inscribed inside the pentagon $ABDEF$ such that $O$ is tangent to $AF$, $BD$, and $EF$. Compute the radius of $O$.
2018 Czech and Slovak Olympiad III A, 3
In triangle $ABC$ let be $D$ an intersection of $BC$ and the $A$-angle bisector. Denote $E,F$ the circumcenters of $ABD$ and $ACD$ respectively. Assuming that the circumcenter of $AEF$ lies on the line $BC$ what is the possible size of the angle $BAC$ ?
1992 AIME Problems, 9
Trapezoid $ABCD$ has sides $AB=92$, $BC=50$, $CD=19$, and $AD=70$, with $AB$ parallel to $CD$. A circle with center $P$ on $AB$ is drawn tangent to $BC$ and $AD$. Given that $AP=\frac mn$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.
1981 Czech and Slovak Olympiad III A, 2
Let $n$ be a positive integer. Consider $n^2+1$ (closed, i.e. including endpoints) segments on a single line. Show that at least one of the following statements holds:
a) there are $n+1$ segments with non-empty intersection,
b) there are $n+1$ segments among which two of them are disjoint.
1988 Brazil National Olympiad, 5
A figure on a computer screen shows $n$ points on a sphere, no four coplanar. Some pairs of points are joined by segments. Each segment is colored red or blue. For each point there is a key that switches the colors of all segments with that point as endpoint. For every three points there is a sequence of key presses that makes the three segments between them red. Show that it is possible to make all the segments on the screen red. Find the smallest number of key presses that can turn all the segments red, starting from the worst case.
2023 Dutch BxMO TST, 4
In a triangle $\triangle ABC$ with $\angle ABC < \angle BCA$, we define $K$ as the excenter with respect to $A$. The lines $AK$ and $BC$ intersect in a point $D$. Let $E$ be the circumcenter of $\triangle BKC$. Prove that
\[\frac{1}{|KA|} = \frac{1}{|KD|} + \frac{1}{|KE|}.\]
1984 Miklós Schweitzer, 10
[b]10.[/b] Let $X_1, X_2, \dots $ be independent random variables with the same distribution
$P(X_i = 1) = P(X_i = -1)=\frac{1}{2}\qquad (i= 1, 2, \dots )$
Define
$S_0=0, Sn=X_1 +X_2+\dots +X_n \qquad (n=1, 2, \dots$ ),
$\xi (x,n) = \left | \{k : 0 \leq k \leq n, S_k= x \} \right |\qquad (x=0, \pm 1, \pm 2, \dots $),
and
$\alpha(n)= \left | \{ x: \xi(x,n)=a \} \right |\qquad (n=0,1,\dots$).
Prove that
$P(\lim \inf \alpha(n)=0) =1$
and that there is a number $0<c<\infty$ such that $P(\lim \inf \alpha(n)/\log n=c) =1$
([b]P.24[/b])
[P. Révész]
2020 Indonesia MO, 5
A set $A$ contains exactly $n$ integers, each of which is greater than $1$ and every of their prime factors is less than $10$. Determine the smallest $n$ such that $A$ must contain at least two distinct elements $a$ and $b$ such that $ab$ is the square of an integer.
2006 AMC 12/AHSME, 17
For a particular peculiar pair of dice, the probabilities of rolling 1, 2, 3, 4, 5 and 6 on each die are in the ratio $ 1: 2: 3: 4: 5: 6$. What is the probability of rolling a total of 7 on the two dice?
$ \textbf{(A) } \frac 4{63} \qquad \textbf{(B) } \frac 18 \qquad \textbf{(C) } \frac 8{63} \qquad \textbf{(D) } \frac 16 \qquad \textbf{(E) } \frac 27$
2018 VJIMC, 1
Every point of the rectangle $R=[0,4] \times [0,40]$ is coloured using one of four colours. Show that there exist four points in $R$ with the same colour that form a rectangle having integer side lengths.
2011 Iran MO (2nd Round), 1
find the smallest natural number $n$ such that there exists $n$ real numbers in the interval $(-1,1)$ such that their sum equals zero and the sum of their squares equals $20$.
2005 Kurschak Competition, 2
A and B play tennis. The player to first win at least four points and at least two more than the other player wins. We know that A gets a point each time with probability $p\le \frac12$, independent of the game so far. Prove that the probability that A wins is at most $2p^2$.
2021 Indonesia TST, N
For every positive integer $n$, let $p(n)$ denote the number of sets $\{x_1, x_2, \dots, x_k\}$ of integers with $x_1 > x_2 > \dots > x_k > 0$ and $n = x_1 + x_3 + x_5 + \dots$ (the right hand side here means the sum of all odd-indexed elements). As an example, $p(6) = 11$ because all satisfying sets are as follows: $$\{6\}, \{6, 5\}, \{6, 4\}, \{6, 3\}, \{6, 2\}, \{6, 1\}, \{5, 4, 1\}, \{5, 3, 1\}, \{5, 2, 1\}, \{4, 3, 2\}, \{4, 3, 2, 1\}.$$ Show that $p(n)$ equals to the number of partitions of $n$ for every positive integer $n$.
2001 AMC 8, 22
On a twenty-question test, each correct answer is worth 5 points, each unanswered question is worth 1 point and each incorrect answer is worth 0 points. Which of the following scores is NOT possible?
$ \text{(A)}\ 90\qquad\text{(B)}\ 91\qquad\text{(C)}\ 92\qquad\text{(D)}\ 95\qquad\text{(E)}\ 97 $