Found problems: 85335
2010 LMT, 6
Given a square $ABCD,$ with $AB=1$ mark the midpoints $M$ and $N$ of $AB$ and $BC,$ respectively. A lasar beam shot from $M$ to $N,$ and the beam reflects of $BC,CD,DA,$ and comes back to $M.$ This path encloses a smaller area inside square $ABCD.$ Find this area.
1959 AMC 12/AHSME, 6
Given the true statement: If a quadrilateral is a square, then it is a rectangle. It follows that, of the converse and the inverse of this true statement is:
$ \textbf{(A)}\ \text{only the converse is true} \qquad\textbf{(B)}\ \text{only the inverse is true }\qquad \textbf{(C)}\ \text{both are true} \qquad$ $\textbf{(D)}\ \text{neither is true} \qquad\textbf{(E)}\ \text{the inverse is true, but the converse is sometimes true} $
2007 Swedish Mathematical Competition, 2
A number of flowers are distributed between $n$ persons so that the first of them, Andreas, gets one flower, the other gets two flowers, the third gets three flowers, etc., to $n$-th person who gets $n$ flowers. Andreas then walks around shaking hands with each other of the others, in any order. In order to do so, he receives a flower from everyone which he hangs on to and which has more flowers than himself at the moment they shake hands. Which is the smallest number of flowers Andreas can have after shaking hands with everyone?
2022 JHMT HS, 10
In $\triangle JMT$, $JM=410$, $JT=49$, and $\angle{MJT}>90^\circ$. Let $I$ and $H$ be the incenter and orthocenter of $\triangle JMT$, respectively. The circumcircle of $\triangle JIH$ intersects $\overleftrightarrow{JT}$ at a point $P\neq J$, and $IH=HP$. Find $MT$.
2021 SAFEST Olympiad, 4
Let $ABC$ be a triangle with $AB > AC$. Let $D$ be a point on the side $AB$ such that $DB = DC$ and let $M$ be the midpoint of $AC$. The line parallel to $BC$ passing through $D$ intersects the line $BM$ in $K$. Show that $\angle KCD = \angle DAC.$
2015 Singapore Junior Math Olympiad, 1
Consider the integer $30x070y03$ where $x, y$ are unknown digits. Find all possible values of $x, y$ so that the given integer is a multiple of $37$.
2016 China Western Mathematical Olympiad, 3
Let $n$ and $k$ be integers with $k\leq n-2$. The absolute value of the sum of elements of any $k$-element subset of $\{a_1,a_2,\cdots,a_n\}$ is less than or equal to 1. Show that: If $|a_1|\geq1$, then for any $2\leq i \leq n$, we have:
$$|a_1|+|a_i|\leq2$$
1982 IMO Shortlist, 5
The diagonals $AC$ and $CE$ of the regular hexagon $ABCDEF$ are divided by inner points $M$ and $N$ respectively, so that \[ {AM\over AC}={CN\over CE}=r. \] Determine $r$ if $B,M$ and $N$ are collinear.
1924 Eotvos Mathematical Competition, 3
Let $A$, $B$, and $C$ be three given points in the plane; construct three cirdes, $k_1$, $k_2$, and $k_3$, such that $k_2$ and $k_3$ have a common tangent at $A$, $k_3$ and $k_1$ at $B$, and $k_1$ and $k_2$ at $C$.
2020 Cono Sur Olympiad, 5
There is a pile with $15$ coins on a table. At each step, Pedro choses one of the piles in the table with $a>1$ coins and divides it in two piles with $b\geq1$ and $c\geq1$ coins and writes in the board the product $abc$. He continues until there are $15$ piles with $1$ coin each. Determine all possible values that the final sum of the numbers in the board can have.
2021 Baltic Way, 8
We are given a collection of $2^{2^k}$ coins, where $k$ is a non-negative integer. Exactly one coin is fake.
We have an unlimited number of service dogs. One dog is sick but we do not know which one.
A test consists of three steps: select some coins from the collection of all coins; choose a service dog; the dog smells all of the selected coins at once.
A healthy dog will bark if and only if the fake coin is amongst them. Whether the sick dog will bark or not is random. \\
Devise a strategy to find the fake coin, using at most $2^k+k+2$ tests, and prove that it works.
2023 HMNT, 10
It is midnight on April $29$th, and Abigail is listening to a song by her favorite artist while staring at her clock, which has an hour, minute, and second hand. These hands move continuously. Between two consecutive midnights, compute the number of times the hour, minute, and second hands form two equal angles and no two hands overlap.
2007 Junior Balkan MO, 3
Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.
2007 Putnam, 5
Let $ k$ be a positive integer. Prove that there exist polynomials $ P_0(n),P_1(n),\dots,P_{k\minus{}1}(n)$ (which may depend on $ k$) such that for any integer $ n,$
\[ \left\lfloor\frac{n}{k}\right\rfloor^k\equal{}P_0(n)\plus{}P_1(n)\left\lfloor\frac{n}{k}\right\rfloor\plus{} \cdots\plus{}P_{k\minus{}1}(n)\left\lfloor\frac{n}{k}\right\rfloor^{k\minus{}1}.\]
($ \lfloor a\rfloor$ means the largest integer $ \le a.$)
2018 Saudi Arabia BMO TST, 4
Let $ABC$ be an acute, non isosceles with $I$ is its incenter. Denote $D, E$ as tangent points of $(I)$ on $AB,AC$, respectively. The median segments respect to vertex $A$ of triangles $ABE$ and $ACD$ meet$ (I)$ at$ P,Q,$ respectively. Take points $M, N$ on the line $DE$ such that $AM \parallel BE$ and $AN \parallel C D$ respectively.
a) Prove that $A$ lies on the radical axis of $(MIP)$ and $(NIQ)$.
b) Suppose that the orthocenter $H$ of triangle $ABC$ lies on $(I)$. Prove that there exists a line which is tangent to three circles of center $A, B, C$ and all pass through $H$.
2013 All-Russian Olympiad, 4
On each of the cards written in $2013$ by number, all of these $2013$ numbers are different. The cards are turned down by numbers. In a single move is allowed to point out the ten cards and in return will report one of the numbers written on them (do not know what). For what most $w$ guaranteed to be able to find $w$ cards for which we know what numbers are written on each of them?
2020 Thailand TSTST, 6
A nonempty set $S$ is called [i]Bally[/i] if for every $m\in S$, there are fewer than $\frac{1}{2}m$ elements of $S$ which are less than $m$. Determine the number of Bally subsets of $\{1, 2, . . . , 2020\}$.
1972 IMO Longlists, 37
On a chessboard ($8\times 8$ squares with sides of length $1$) two diagonally opposite corner squares are taken away. Can the board now be covered with nonoverlapping rectangles with sides of lengths $1$ and $2$?
2018 Costa Rica - Final Round, N4
Let $p$ be a prime number such that $p = 10^{d -1} + 10^{d-2} + ...+ 10 + 1$. Show that $d$ is a prime.
1960 Putnam, B2
Evaluate the double series
$$\sum_{j=0}^{\infty} \sum_{k=0}^{\infty} 2^{-3k -j -(k+j)^{2}}.$$
LMT Team Rounds 2021+, 7
A regular hexagon is split into $6$ congruent equilateral triangles by drawing in the $3$ main diagonals. Each triangle is colored $1$ of $4$ distinct colors. Rotations and reflections of the figure are considered nondistinct. Find the number of possible distinct colorings.
2022 May Olympiad, 5
Vero had an isosceles triangle made of paper. Using scissors, he divided it into three smaller triangles and painted them blue, red and green. Having done so, he observed that:
$\bullet$ with the blue triangle and the red triangle an isosceles triangle can be formed,
$\bullet$ with the blue triangle and the green triangle an isosceles triangle can be formed,
$\bullet$ with the red triangle and the green triangle an isosceles triangle can be formed.
Show what Vero's triangle looked like and how he might have made the cuts to make this situation be possible.
1979 Czech And Slovak Olympiad IIIA, 2
Given a cuboid $Q$ with dimensions $a, b, c$, $a < b < c$. Find the length of the edge of a cube $K$ , which has parallel faces and a common center with the given cuboid so that the volume of the difference of the sets $Q \cup K$ and $Q \cap K$ is minimal.
2015 AMC 8, 25
One-inch squares are cut from the corners of this 5 inch square. What is the area in square inches of the largest square that can be fitted into the remaining space?
$ \textbf{(A) } 9\qquad \textbf{(B) } 12\frac{1}{2}\qquad \textbf{(C) } 15\qquad \textbf{(D) } 15\frac{1}{2}\qquad \textbf{(E) } 17$
[asy]
draw((0,0)--(0,5)--(5,5)--(5,0)--cycle);
filldraw((0,4)--(1,4)--(1,5)--(0,5)--cycle, gray);
filldraw((0,0)--(1,0)--(1,1)--(0,1)--cycle, gray);
filldraw((4,0)--(4,1)--(5,1)--(5,0)--cycle, gray);
filldraw((4,4)--(4,5)--(5,5)--(5,4)--cycle, gray);
[/asy]
2024 Turkey Junior National Olympiad, 3
Let $n\geq 2$ be an integer and $a_1,a_2,\cdots,a_n$ be distinct positive real numbers. For any $(i,j)$ in a country consisting of cities $C_1,C_2,\cdots,C_n$, there is a two-way flight between $C_i$ and $C_j$ that costs $a_i+a_j$.A traveler travels between cities of this country such that every time they pay a strictly higher cost than their previous flight. Find the maximum number of flight this traveler could take.