Found problems: 85335
1974 IMO Longlists, 1
We consider the division of a chess board $8 \times 8$ in p disjoint rectangles which satisfy the conditions:
[b]a)[/b] every rectangle is formed from a number of full squares (not partial) from the 64 and the number of white squares is equal to the number of black squares.
[b]b)[/b] the numbers $\ a_{1}, \ldots, a_{p}$ of white squares from $p$ rectangles satisfy $a_1, , \ldots, a_p.$ Find the greatest value of $p$ for which there exists such a division and then for that value of $p,$ all the sequences $a_{1}, \ldots, a_{p}$ for which we can have such a division.
[color=#008000]Moderator says: see [url]https://artofproblemsolving.com/community/c6h58591[/url][/color]
2022 Indonesia TST, G
In a nonisosceles triangle $ABC$, point $I$ is its incentre and $\Gamma$ is its circumcircle. Points $E$ and $D$ lie on $\Gamma$ and the circumcircle of triangle $BIC$ respectively such that $AE$ and $ID$ are both perpendicular to $BC$. Let $M$ be the midpoint of $BC$, $N$ be the midpoint of arc $BC$ on $\Gamma$ containing $A$, $F$ is the point of tangency of the $A-$excircle on $BC$, and $G$ is the intersection of line $DE$ with $\Gamma$. Prove that lines $GM$ and $NF$ intersect at a point located on $\Gamma$.
(Possibly proposed by Farras Faddila)
2023 Euler Olympiad, Round 2, 4
Let $ABCD$ be a trapezoid, with $AD \parallel BC$, let $M$ be the midpoint of $AD$, and let $C_1$ be symmetric point to $C$ with respect to line $BD$. Segment $BM$ meets diagonal $AC$ at point $K$, and ray $C_1K$ meets line $BD$ at point $H$. Prove that $\angle{AHD}$ is a right angle.
[i]Proposed by Giorgi Arabidze, Georgia[/i]
2003 May Olympiad, 2
The triangle $ABC$ is right in $A$ and $R$ is the midpoint of the hypotenuse $BC$ . On the major leg $AB$ the point $P$ is marked such that $CP = BP$ and on the segment $BP$ the point $Q$ is marked such that the triangle $PQR$ is equilateral. If the area of triangle $ABC$ is $27$, calculate the area of triangle $PQR$ .
1996 Baltic Way, 7
A sequence of integers $a_1,a_2,\ldots $ is such that $a_1=1,a_2=2$ and for $n\ge 1$,
\[a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. \]
Prove that $a_n\not= 0$ for all $n$.
1997 French Mathematical Olympiad, Problem 4
In a triangle $ABC$, let $a,b,c$ be its sides and $m,n,p$ be the corresponding medians. For every $\alpha>0$, let $\lambda(\alpha)$ be the real number such that
$$a^\alpha+b^\alpha+c^\alpha=\lambda(\alpha)^\alpha\left(m^\alpha+n^\alpha+p^\alpha\right)^\alpha.$$
(a) Compute $\lambda(2)$.
(b) Find the limit of $\lambda(\alpha)$ as $\alpha$ approaches $0$.
(c) For which triangles $ABC$ is $\lambda(\alpha)$ independent of $\alpha$?
2004 All-Russian Olympiad Regional Round, 11.4
In a certain state there were 2004 cities connected by roads so that from any city one could get to any other. It is known that when it is prohibited to travel on any of the roads, the least of them any city could be reached to any other. The Minister of Transport and the Minister of Internal Affairs take turns introducing restrictions on the roads while there is possibility, one-way traffic (on one road per turn), and minister, after whose move it became impossible to leave any city to reach any other, immediately resigns. First the Minister of Transport walks. Can any of the ministers force the resignation of another, regardless of his performance?
[hide=original wording]В некотором государстве было 2004 города, соединенных дорогами так, что из любого города можно было добраться до любого другого. Известно, что при запрещенном проезде по любой из дорог, по-прежнему из любого города можно было добраться до любого другого. Министр транспорта и министр внутренних дел по очереди вводят на дорогах, пока есть возможность, одностороннее движение (на одной дороге за ход), причем министр, после хода которого из какого-либо города стало невозможно
добраться до какого-либо другого, немедленно уходит в отставку. Первым ходит министр транспорта. Может ли кто-либо из министров добиться отставки другого независимо от его игры?[/hide]
2005 MOP Homework, 6
A circle which is tangent to sides $AB$ and $BC$ of triangle $ABC$ is also tangent to its circumcircle at point $T$. If $I$ in the incenter of triangle $ABC$, show that $\angle ATI=\angle CTI$.
2015 NIMO Summer Contest, 14
We say that an integer $a$ is a quadratic, cubic, or quintic residue modulo $n$ if there exists an integer $x$ such that $x^2\equiv a \pmod n$, $x^3 \equiv a \pmod n$, or $x^5 \equiv a \pmod n$, respectively. Further, an integer $a$ is a primitive residue modulo $n$ if it is exactly one of these three types of residues modulo $n$.
How many integers $1 \le a \le 2015$ are primitive residues modulo $2015$?
[i] Proposed by Michael Ren [/i]
1991 Vietnam Team Selection Test, 3
Let a set $X$ be given which consists of $2 \cdot n$ distinct real numbers ($n \geq 3$). Consider a set $K$ consisting of some pairs $(x, y)$ of distinct numbers $x, y \in X$, satisfying the two conditions:
[b]I.[/b] If $(x, y) \in K$ then $(y, x) \not \in K$.
[b]II.[/b] Every number $x \in X$ belongs to at most 19 pairs of $K$.
Show that we can divide the set $X$ into 5 non-empty disjoint sets $X_1, X_2, X_3, X_4, X_5$ in such a way that for each $i = 1, 2, 3, 4, 5$ the number of pairs $(x, y) \in K$ where $x, y$ both belong to $X_i$ is not greater than $3 \cdot n$.
2010 AIME Problems, 13
The $ 52$ cards in a deck are numbered $ 1, 2, \ldots, 52$. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let $ p(a)$ be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards $ a$ and $ a\plus{}9$, and Dylan picks the other of these two cards. The minimum value of $ p(a)$ for which $ p(a)\ge\frac12$ can be written as $ \frac{m}{n}$. where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.
2012 China Second Round Olympiad, 8
There are $4$ distinct codes used in an intelligence station, one of them applied in each week. No two codes used in two adjacent weeks are the same code. Knowing that code $A$ is used in the first week, find the probability that code $A$ is used in the seventh week.
2020 BMT Fall, 4
Let $a, b$, and $c$ be integers that satisfy $2a + 3b = 52$, $3b + c = 41$, and $bc = 60$. Find $a + b + c$
1982 IMO Longlists, 46
Prove that if a diagonal is drawn in a quadrilateral inscribed in a circle, the sum of the radii of the circles inscribed in the two triangles thus formed is the same, no matter which diagonal is drawn.
Kyiv City MO 1984-93 - geometry, 1987.7.1
The circle inscribed in the triangle $ABC$ touches the side BC at point $K$. Prove that the segment $AK$ is longer than the diameter of the circle.
2017 Bosnia Herzegovina Team Selection Test, 6
Given is an acute triangle $ABC$. $M$ is an arbitrary point at the side $AB$ and $N$ is midpoint of $AC$. The foots of the perpendiculars from $A$ to $MC$ and $MN$ are points $P$ and $Q$. Prove that center of the circumcircle of triangle $PQN$ lies on the fixed line for all points $M$ from the side $AB$.
2001 Junior Balkan Team Selection Tests - Romania, 3
Let $ABCD$ be a quadrilateral inscribed in the circle $O$. For a point $E\in O$, its projections $K,L,M,N$ on the lines $DA,AB,BC,CD$, respectively, are considered. Prove that if $N$ is the orthocentre of the triangle $KLM$ for some point $E$, different from $A,B,C,D$, then this holds for every point $E$ of the circle.
2002 Romania Team Selection Test, 4
For any positive integer $n$, let $f(n)$ be the number of possible choices of signs $+\ \text{or}\ - $ in the algebraic expression $\pm 1\pm 2\ldots \pm n$, such that the obtained sum is zero. Show that $f(n)$ satisfies the following conditions:
a) $f(n)=0$ for $n=1\pmod{4}$ or $n=2\pmod{4}$.
b) $2^{\frac{n}{2}-1}\le f(n)\le 2^n-2^{\lfloor\frac{n}{2}\rfloor+1}$, for $n=0\pmod{4}$ or $n=3\pmod{4}$.
[i]Ioan Tomsecu[/i]
2009 Belarus Team Selection Test, 1
Prove that any positive real numbers a,b,c satisfy the inequlaity $$\frac{1}{(a+b)b}+\frac{1}{(b+c)c}+\frac{1}{(c+a)a}\ge \frac{9}{2(ab+bc+ca)}$$
I.Voronovich
1953 Putnam, A2
The complete graph with 6 points and 15 edges has each edge colored red or blue. Show that we can find 3 points such that the 3 edges joining them are the same color.
2005 All-Russian Olympiad Regional Round, 10.5
Arithmetic progression $a_1, a_2, . . . , $ consisting of natural numbers is such that for any $n$ the product $a_n \cdot a_{n+31}$ is divisible by $2005$. Is it possible to say that all terms of the progression are divisible by $2005$?
1965 AMC 12/AHSME, 24
Given the sequence $ 10^{\frac {1}{11}},10^{\frac {2}{11}},10^{\frac {3}{11}},\ldots,10^{\frac {n}{11}}$, the smallest value of $ n$ such that the product of the first $ n$ members of this sequence exceeds $ 100000$ is:
$ \textbf{(A)}\ 7 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 11$
1979 AMC 12/AHSME, 26
The function $f$ satisfies the functional equation \[f(x) +f(y) = f(x + y ) - xy - 1\] for every pair $x,~ y$ of real numbers. If $f( 1) = 1$, then the number of integers $n \neq 1$ for which $f ( n ) = n$ is
$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }\text{infinite}$
MMPC Part II 1958 - 95, 1968
[b]p1.[/b] A man is walking due east at $2$ m.p.h. and to him the wind appears to be blowing from the north. On doubling his speed to $4$ m.p.h. and still walking due east, the wind appears to be blowing from the nortl^eas^. What is the speed of the wind (assumed to have a constant velocity)?
[b]p2.[/b] Prove that any triangle can be cut into three pieces which can be rearranged to form a rectangle of the same area.
[b]p3.[/b] An increasing sequence of integers starting with $1$ has the property that if $n$ is any member of the sequence, then so also are $3n$ and $n + 7$. Also, all the members of the sequence are solely generated from the first nummber $1$; thus the sequence starts with $1,3,8,9,10, ...$ and $2,4,5,6,7...$ are not members of this sequence. Determine all the other positive integers which are not members of the sequence.
[b]p4.[/b] Three prime numbers, each greater than $3$, are in arithmetic progression. Show that their common difference is a multiple of $6$.
[b]p5.[/b] Prove that if $S$ is a set of at least $7$ distinct points, no four in a plane, the volumes of all the tetrahedra with vertices in $S$ are not all equal.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2007 Oral Moscow Geometry Olympiad, 2
Two circles intersect at points $P$ and $Q$. Point $A$ lies on the first circle, but outside the second. Lines $AP$ and $AQ$ intersect the second circle at points $B$ and $C$, respectively. Indicate the position of point $A$ at which triangle $ABC$ has the largest area.
(D. Prokopenko)