Found problems: 85335
2018 Argentina National Olympiad, 3
You have a $7\times 7$ board divided into $49$ boxes. Mateo places a coin in a box.
a) Prove that Mateo can place the coin so that it is impossible for Emi to completely cover the $48$ remaining squares, without gaps or overlaps, using $15$ $3\times1$ rectangles and a cubit of three squares, like those in the figure.
[img]https://cdn.artofproblemsolving.com/attachments/6/9/a467439094376cd95c6dfe3e2ad3e16fe9f124.png[/img]
b) Prove that no matter which square Mateo places the coin in, Emi will always be able to cover the 48 remaining squares using $14$ $3\times1$ rectangles and two cubits of three squares.
2014 IMC, 3
Let $n$ be a positive integer. Show that there are positive real numbers $a_0, a_1, \dots, a_n$ such that for each choice of signs the polynomial
$$\pm a_nx^n\pm a_{n-1}x^{n-1} \pm \dots \pm a_1x \pm a_0$$
has $n$ distinct real roots.
(Proposed by Stephan Neupert, TUM, München)
2004 Moldova Team Selection Test, 7
Let $ABC$ be a triangle, let $O$ be its circumcenter, and let $H$ be its orthocenter.
Let $P$ be a point on the segment $OH$.
Prove that
$6r\leq PA+PB+PC\leq 3R$,
where $r$ is the inradius and $R$ the circumradius of triangle $ABC$.
[b]Moderator edit:[/b] This is true only if the point $P$ lies inside the triangle $ABC$. (Of course, this is always fulfilled if triangle $ABC$ is acute-angled, since in this case the segment $OH$ completely lies inside the triangle $ABC$; but if triangle $ABC$ is obtuse-angled, then the condition about $P$ lying inside the triangle $ABC$ is really necessary.)
2020 LIMIT Category 2, 9
Three points are chosen randomly and independently on a circle. The probability that all three pairwise distance between the points are less than the radius of the circle is $\frac{1}{K}$, $K\in\mathbb{N}$. Find $K$.
2023 Iran Team Selection Test, 2
Suppose $\frac{1}{2} < s < 1$ . An insect flying on $[0,1]$ . If it is on point $a$ , it jump into point $ a\times s$ or $(a-1) \times s +1$ . For every real number $0 \le c \le 1$, Prove that insect can jump that after some jumps , it has a distance less than $\frac {1}{1402}$ from point $c$.
[i]Proposed by Navid Safaei [/i]
2000 German National Olympiad, 2
For an integer $n \ge 2$, find all real numbers $x$ for which the polynomial $f(x) = (x-1)^4 +(x-2)^4 +...+(x-n)^4$ takes its minimum value.
2005 Moldova National Olympiad, 10.2
Find all positive solution of system of equation:
$ \frac{xy}{2005y\plus{}2004x}\plus{}\frac{yz}{2004z\plus{}2003y}\plus{}\frac{zx}{2003x\plus{}2005z}\equal{}\frac{x^{2}\plus{}y^{2}\plus{}z^{2}}{2005^{2}\plus{}2004^{2}\plus{}2003^{2}}$
1970 All Soviet Union Mathematical Olympiad, 134
Given five segments. It is possible to construct a triangle of every subset of three of them. Prove that at least one of those triangles is acute-angled.
2021 Middle European Mathematical Olympiad, 4
Let $n$ be a positive integer. Prove that in a regular $6n$-gon, we can draw $3n$ diagonals with pairwise distinct ends and partition the drawn diagonals into $n$ triplets so that:
[list]
[*] the diagonals in each triplet intersect in one interior point of the polygon and
[*] all these $n$ intersection points are distinct.
[/list]
1996 Singapore Senior Math Olympiad, 2
Let $180^o < \theta_1 < \theta_2 <...< \theta_n = 360^o$. For $i = 1,2,..., n$, $P_i = (\cos \theta_i^o, \sin \theta_i^o)$ is a point on the circle $C$ with centre $(0,0)$ and radius $1$. Let $P$ be any point on the upper half of $C$. Find the coordinates of $P$ such that the sum of areas $[PP_1P_2] + [PP_2P_3] + ...+ [PP_{n-1}P_n]$ attains its maximum.
2023 LMT Fall, 13
Given that the base-$17$ integer $\overline{8323a02421_{17}}$ (where a is a base-$17$ digit) is divisible by $\overline{16_{10}}$, find $a$. Express your answer in base $10$.
[i]Proposed by Jonathan Liu[/i]
LMT Team Rounds 2021+, 15
There are $28$ students who have to be separated into two groups such that the number of students in each group
is a multiple of $4$. The number of ways to split them into the groups can be written as
$$\sum_{k \ge 0} 2^k a_k = a_0 +2a_1 +4a_2 +...$$
where each $a_i$ is either $0$ or $1$. Find the value of
$$\sum_{k \ge 0} ka_k = 0+ a_1 +2a_2 +3a3_ +....$$
2004 Czech and Slovak Olympiad III A, 5
Let $L$ be an arbitrary point on the minor arc $CD$ of the circumcircle of square $ABCD$. Let $K,M,N$ be the intersection points of $AL,CD$; $CL,AD$; and $MK,BC$ respectively. Prove that $B,M,L,N$ are concyclic.
2018 Hong Kong TST, 2
There are three piles of coins, with $a,b$ and $c$ coins respectively, where $a,b,c\geq2015$ are positive integers. The following operations are allowed:
(1) Choose a pile with an even number of coins and remove all coins from this pile. Add coins to each of the remaining two piles with amount equal to half of that removed; or
(2) Choose a pile with an odd number of coins and at least 2017 coins. Remove 2017 coins from this pile. Add 1009 coins to each of the remaining two piles.
Suppose there are sufficiently many spare coins. Find all ordered triples $(a,b,c)$ such that after some finite sequence of allowed operations. There exists a pile with at least $2017^{2017}$ coins.
2009 Brazil National Olympiad, 1
Emerald writes $ 2009^2$ integers in a $ 2009\times 2009$ table, one number in each entry of the table. She sums all the numbers in each row and in each column, obtaining $ 4018$ sums. She notices that all sums are distinct. Is it possible that all such sums are perfect squares?
2011 Romanian Master of Mathematics, 6
The cells of a square $2011 \times 2011$ array are labelled with the integers $1,2,\ldots, 2011^2$, in such a way that every label is used exactly once. We then identify the left-hand and right-hand edges, and then the top and bottom, in the normal way to form a torus (the surface of a doughnut).
Determine the largest positive integer $M$ such that, no matter which labelling we choose, there exist two neighbouring cells with the difference of their labels at least $M$.
(Cells with coordinates $(x,y)$ and $(x',y')$ are considered to be neighbours if $x=x'$ and $y-y'\equiv\pm1\pmod{2011}$, or if $y=y'$ and $x-x'\equiv\pm1\pmod{2011}$.)
[i](Romania) Dan Schwarz[/i]
2022 AIME Problems, 5
Twenty distinct points are marked on a circle and labeled $1$ through $20$ in clockwise order. A line segment is drawn between every pair of points whose labels differ by a prime number. Find the number of triangles formed whose vertices are among the original $20$ points.
2005 Baltic Way, 9
A rectangle is divided into $200\times 3$ unit squares. Prove that the number of ways of splitting this rectangle into rectangles of size $1\times 2$ is divisible by $3$.
2016 Saint Petersburg Mathematical Olympiad, 1
Given three quadratic trinomials $f, g, h$ without roots. Their elder coefficients are the same, and all their coefficients for x are different. Prove that there is a number $c$ such that the equations $f (x) + cg (x) = 0$ and $f (x) + ch (x) = 0$ have a common root.
2010 NZMOC Camp Selection Problems, 4
Find all positive integer solutions $(a, b)$ to the equation $$\frac{1}{a}+\frac{1}{b}+ \frac{n}{lcm(a,b)}=\frac{1}{gcd(a, b)}$$ for
(i) $n = 2007$;
(ii) $n = 2010$.
2019 Yasinsky Geometry Olympiad, p5
On the sides of the right triangle, outside are constructed regular nonagons, which are constructed on one of the catheti and on the hypotenuse, with areas equal to $1602$ $cm^2$ and $2019$ $cm^2$, respectively. What is the area of the nonagon that is constructed on the other cathetus of this triangle?
(Vladislav Kirilyuk)
STEMS 2024 Math Cat B, P2
In CMI, each person has atmost $3$ friends. A disease has infected exactly $2023$ peoplein CMI . Each day, a person gets infected if and only if atleast two of their friends were infected on the previous day. Once someone is infected, they can neither die nor be cured. Given that everyone in CMI eventually got infected, what is the maximum possible number of people in CMI?
2017 South East Mathematical Olympiad, 2
Let $x_i \in \{0,1\}(i=1,2,\cdots ,n)$,if the value of function $f=f(x_1,x_2, \cdots ,x_n)$ can only be $0$ or $1$,then we call $f$ a $n$-var Boole function,and we denote $D_n(f)=\{(x_1,x_2, \cdots ,x_n)|f(x_1,x_2, \cdots ,x_n)=0\}.$
$(1)$ Find the number of $n$-var Boole function;
$(2)$ Let $g$ be a $n$-var Boole function such that $g(x_1,x_2, \cdots ,x_n) \equiv 1+x_1+x_1x_2+x_1x_2x_3 +\cdots +x_1x_2 \cdots x_n \pmod 2$,
Find the number of elements of the set $D_n(g)$,and find the maximum of $n \in \mathbb{N}_+$ such that
$\sum_{(x_1,x_2, \cdots ,x_n) \in D_n(g)}(x_1+x_2+ \cdots +x_n) \le 2017.$
2007 Singapore Senior Math Olympiad, 2
For any positive integer $n$, let $f(n)$ denote the $n$- th positive nonsquare integer, i.e., $f(1) = 2, f(2) = 3, f(3) = 5, f(4) = 6$, etc. Prove that $f(n)=n +\{\sqrt{n}\}$ where $\{x\}$ denotes the integer closest to $x$.
(For example, $\{\sqrt{1}\} = 1, \{\sqrt{2}\} = 1, \{\sqrt{3}\} = 2, \{\sqrt{4}\} = 2$.)
2018 PUMaC Live Round, 2.3
Sophie has $20$ indistinguishable pairs of socks in a laundry bag. She pulls them out one at a time. After pulling out $30$ socks, the expected number of unmatched socks among the socks that she has pulled out can be expressed in simplest form as $\tfrac{m}{n}$. Find $m+n$.