Found problems: 85335
2008 National Chemistry Olympiad, 1
Which element is a liquid at $25^\circ\text{C}$ and $1.0 \text{ atm}$?
$\textbf{(A)}\hspace{.05in}\text{bromine} \qquad\textbf{(B)}\hspace{.05in}\text{krypton} \qquad\textbf{(C)}\hspace{.05in}\text{phosphorus} \qquad\textbf{(D)}\hspace{.05in}\text{xenon} \qquad$
2007 All-Russian Olympiad Regional Round, 8.6
A number $ B$ is obtained from a positive integer number $ A$ by permuting its decimal digits. The number $ A\minus{}B\equal{}11...1$ ($ n$ of $ 1's$). Find the smallest possible positive value of $ n$.
2007 Miklós Schweitzer, 8
For an $A=\{ a_i\}^{\infty}_{i=0}$ sequence let $SA=\{ a_0, a_0+a_1, a_0+a_1+a_2, \ldots\}$ be the sequence of partial sums of the $a_0+a_1+\ldots$ series. Does there exist a non-identically zero sequence $A$ such that all of the sequences $A, SA, SSA, SSSA, \ldots$ are convergent?
(translated by Miklós Maróti)
2013 Israel National Olympiad, 2
Let $A=\{n\in\mathbb{Z}\mid 0<n<2013\}$. A subset $B\subseteq A$ is called [b]reduced[/b] if for any two numbers $x,y\in B$, we must have $x\cdot y \notin B$. For example, any subset containing the numbers $3,5,15$ cannot be reduced, and same for a subset containing $4,16$.
[list=a]
[*] Find the maximal size of a reduced subset of $A$.
[*] How many reduced subsets are there with that maximal size?
[/list]
2007 Bundeswettbewerb Mathematik, 1
For which numbers $ n$ is there a positive integer $ k$ with the following property: The sum of digits for $ k$ is $ n$ and the number $ k^2$ has sum of digits $ n^2.$
TNO 2024 Senior, 5
Nine people have attended four different meetings sitting around a circular table. Could they have done so in a way that no two people sat next to each other more than once? Justify your answer.
2016 Saint Petersburg Mathematical Olympiad, 7
A sequence of $N$ consecutive positive integers is called [i]good [/i] if it is possible to choose two of these numbers so that their product is divisible by the sum of the other $N-2$ numbers. For which $N$ do there exist infinitely many [i]good [/i] sequences?
1982 IMO, 3
Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$.
[b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \]
[b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]
2012 China Team Selection Test, 1
Given an integer $n\ge 4$. $S=\{1,2,\ldots,n\}$. $A,B$ are two subsets of $S$ such that for every pair of $(a,b),a\in A,b\in B, ab+1$ is a perfect square. Prove that
\[\min \{|A|,|B|\}\le\log _2n.\]
1981 Austrian-Polish Competition, 2
The sequence $a_0, a_1, a_2, ...$ is defined by $a_{n+1} = a^2_n + (a_n - 1)^2$ for $n \ge 0$. Find all rational numbers $a_0$ for which there exist four distinct indices $k, m, p, q$ such that $a_q - a_p = a_m - a_k$.
2019 Bosnia and Herzegovina Junior BMO TST, 4
$4.$ Let there be a variable positive integer whose last two digits are $3's$. Prove that this number is divisible by a prime greater than $7$.
2014 Czech-Polish-Slovak Match, 6
Let $n \ge 6$ be an integer and $F$ be the system of the $3$-element subsets of the set $\{1, 2,...,n \}$ satisfying the following condition:
for every $1 \le i < j \le n$ there is at least $ \lfloor \frac{1}{3} n \rfloor -1$ subsets $A\in F$ such that $i, j \in A$.
Prove that for some integer $m \ge 1$ exist the mutually disjoint subsets $A_1, A_2 , ... , A_m \in F $ also, that $|A_1\cup A_2 \cup ... \cup A_m |\ge n-5 $
(Poland)
PS. just in case my translation does not make sense,
I leave the original in Slovak, in case someone understands something else
2021 SYMO, Q5
Simon draws some line segments on the face of a regular polygon, dissecting it into exactly $2021$ triangles, such that no two drawn line segments are collinear, and no two triangles share a pair of vertices. Simon then assigns each drawn line segment and each side of the polygon with one of three colours. Prove that there is some triangle in the dissection with a pair of identically-coloured sides.
2022 CCA Math Bonanza, I4
Burrito Bear has a white unit square. She inscribes a circle inside of the square and paints it black. She then inscribes a square inside the black circle and paints it white. Burrito repeats this process indefinitely. The total black area can be expressed as $\frac{a\pi+b}{c}$. Find $a+b+c$.
[i]2022 CCA Math Bonanza Individual Round #4[/i]
2007 Baltic Way, 7
A [i]squiggle[/i] is composed of six equilateral triangles with side length $1$ as shown in the figure below. Determine all possible integers $n$ such that an equilateral triangle with side length $n$ can be fully covered with [i]squiggle[/i]s (rotations and reflections of [i]squiggle[/i]s are allowed, overlappings are not).
[asy]
import graph; size(100); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black;
draw((0,0)--(0.5,1),linewidth(2pt)); draw((0.5,1)--(1,0),linewidth(2pt)); draw((0,0)--(3,0),linewidth(2pt)); draw((1.5,1)--(2,0),linewidth(2pt)); draw((2,0)--(2.5,1),linewidth(2pt)); draw((0.5,1)--(2.5,1),linewidth(2pt)); draw((1,0)--(2,2),linewidth(2pt)); draw((2,2)--(3,0),linewidth(2pt));
dot((0,0),ds); dot((1,0),ds); dot((0.5,1),ds); dot((2,0),ds); dot((1.5,1),ds); dot((3,0),ds); dot((2.5,1),ds); dot((2,2),ds); clip((-4.28,-10.96)--(-4.28,6.28)--(16.2,6.28)--(16.2,-10.96)--cycle);[/asy]
2020-IMOC, A4
One day, before his work time at Jane Street, Sunny decided to have some fun. He saw that there are some real numbers $a_{-1},\ldots,a_{-k}$ on a blackboard, so he decided to do the following process just for fun: if there are real numbers $a_{-k},\ldots,a_{n-1}$ on the blackboard, then he computes the polynomial
$$P_n(t)=(1-a_{-k}t)\cdots(1-a_{n-1}t).$$
He then writes a real number $a_n$, where
$$a_n=\frac{iP_n(i)-iP_n(-i)}{P_n(i)+P_n(-i)}.$$
If $a_n$ is undefined (that is, $P_n(i)+P_n(-i)=0$), then he would stop and go to work. Show that if Sunny writes some real number on the blackboard twice (or equivalently, there exists $m>n\ge0$ such that $am=an$), then the process never stops. Moreover, show that in this case, all the numbers Sunny writes afterwards will already be written before.
(usjl)
2016 Novosibirsk Oral Olympiad in Geometry, 4
The two angles of the squares are adjacent, and the extension of the diagonals of one square intersect the diagonal of another square at point $O$ (see figure). Prove that $O$ is the midpoint of $AB$.
[img]https://cdn.artofproblemsolving.com/attachments/7/8/8daaaa55c38e15c4a8ac7492c38707f05475cc.png[/img]
2008 ITAMO, 2
Let $ ABC$ be a triangle, all of whose angles are greater than $ 45^{\circ}$ and smaller than $ 90^{\circ}$.
(a) Prove that one can fit three squares inside $ ABC$ in such a way that: (i) the three squares are equal (ii) the three squares have common vertex $ K$ inside the triangle (iii) any two squares have no common point but $ K$ (iv) each square has two opposite vertices onthe boundary of $ ABC$, while all the other points of the square are inside $ ABC$.
(b) Let $ P$ be the center of the square which has $ AB$ as a side and is outside $ ABC$. Let $ r_{C}$ be the line symmetric to $ CK$ with respect to the bisector of $ \angle BCA$. Prove that $ P$ lies on $ r_{C}$.
2018 Hong Kong TST, 1
The altitudes $AD$ and $BE$ of acute triangle $ABC$ intersect at $H$. Let $F$ be the intersection of $AB$ and a line that is parallel to the side $BC$ and goes through the circumcentre of $ABC$. Let $M$ be the midpoint of $AH$. Prove that $\angle CMF=90^\circ$
2013 Cuba MO, 3
Find all the natural numbers that are $300$ times the sum of its digits.
1952 AMC 12/AHSME, 8
Two equal circles in the same plane cannot have the following number of common tangents:
$ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{none of these}$
2019 Iran Team Selection Test, 1
A table consisting of $5$ columns and $32$ rows, which are filled with zero and one numbers, are "varied", if no two lines are filled in the same way.\\
On the exterior of a cylinder, a table with $32$ rows and $16$ columns is constructed. Is it possible to fill the numbers cells of the table with numbers zero and one, such that any five consecutive columns, table $32\times5$ created by these columns, is a varied one?
[i]Proposed by Morteza Saghafian[/i]
2025 6th Memorial "Aleksandar Blazhevski-Cane", P3
A sequence of real numbers $(a_k)_{k \ge 0}$ is called [i]log-concave[/i] if for every $k \ge 1$, the inequality $a_{k - 1}a_{k + 1} \le a_k^2$ holds. Let $n, l \in \mathbb{N}$. Prove that the sequence $(a_k)_{k \ge 0}$ with general term \[a_k = \sum_{i = k}^{k + l} {n \choose i}\]
is log-concave.
Proposed by [i]Svetlana Poznanovikj[/i]
2013 Math Hour Olympiad, 6-7
[u]Round 1[/u]
[b]p1.[/b] Goldilocks enters the home of the three bears – Papa Bear, Mama Bear, and Baby Bear. Each bear is wearing a different-colored shirt – red, green, or blue. All the bears look the same to Goldilocks, so she cannot otherwise tell them apart.
The bears in the red and blue shirts each make one true statement and one false statement.
The bear in the red shirt says: “I'm Blue's dad. I'm Green's daughter.”
The bear in the blue shirt says: “Red and Green are of opposite gender. Red and Green are my parents.”
Help Goldilocks find out which bear is wearing which shirt.
[b]p2.[/b] The University of Washington is holding a talent competition. The competition has five contests: math, physics, chemistry, biology, and ballroom dancing. Any student can enter into any number of the contests but only once for each one. For example, a student may participate in math, biology, and ballroom.
It turned out that each student participated in an odd number of contests. Also, each contest had an odd number of participants. Was the total number of contestants odd or even?
[b]p3.[/b] The $99$ greatest scientists of Mars and Venus are seated evenly around a circular table. If any scientist sees two colleagues from her own planet sitting an equal number of seats to her left and right, she waves to them. For example, if you are from Mars and the scientists sitting two seats to your left and right are also from Mars, you will wave to them. Prove that at least one of the $99$ scientists will be waving, no matter how they are seated around the table.
[b]p4.[/b] One hundred boys participated in a tennis tournament in which every player played each other player exactly once and there were no ties. Prove that after the tournament, it is possible for the boys to line up for pizza so that each boy defeated the boy standing right behind him in line.
[b]p5.[/b] To celebrate space exploration, the Science Fiction Museum is going to read Star Wars and Star Trek stories for $24$ hours straight. A different story will be read each hour for a total of $12$ Star Wars stories and $12$ Star Trek stories. George and Gene want to listen to exactly $6$ Star Wars and $6$ Star Trek stories. Show that no matter how the readings are scheduled, the friends can find a block of $12$ consecutive hours to listen to the stories together.
[u]Round 2[/u]
[b]p6.[/b] $2013$ people attended Cinderella's ball. Some of the guests were friends with each other. At midnight, the guests started turning into mice. After the first minute, everyone who had no friends at the ball turned into a mouse. After the second minute, everyone who had exactly one friend among the remaining people turned into a mouse. After the third minute, everyone who had two human friends left in the room turned into a mouse, and so on. What is the maximal number of people that could have been left at the ball after $2013$ minutes?
[b]p7.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2003 Tuymaada Olympiad, 3
In a convex quadrilateral $ABCD$ we have $AB\cdot CD=BC\cdot DA$ and $2\angle A+\angle C=180^\circ$. Point $P$ lies on the circumcircle of triangle $ABD$ and is the midpoint of the arc $BD$ not containing $A$. It is known that the point $P$ lies inside the quadrilateral $ABCD$. Prove that $\angle BCA=\angle DCP$
[i]Proposed by S. Berlov[/i]