Olympiad problems

Putnam 1939, A5

Tags:

Do either $(1)$ or $(2)$ $(1)$ $x$ and $y$ are functions of $t.$ Solve $x' = x + y - 3, y' = -2x + 3y + 1,$ given that $x(0) = y(0) = 0.$ $(2)$ A weightless rod is hinged at $O$ so that it can rotate without friction in a vertical plane. A mass $m$ is attached to the end of the rod $A,$ which is balanced vertically above $O.$ At time $t = 0,$ the rod moves away from the vertical with negligible initial angular velocity. Prove that the mass first reaches the position under $O$ at $t = \sqrt{(\frac{OA}{g})} \ln{(1 + sqrt(2))}.$

MMPC Part II 1996 - 2019, 2016.3

Tags:

This problem is about pairs of consecutive whole numbers satisfying the property that one of the numbers is a perfect square and the other one is the double of a perfect square. (a) The smallest such pairs are $(0,1)$ and $(8,9)$, Indeed $0=2 \cdot 0^2$ and $1=1^2$; $8=2 \cdot 2^2$ and $9=3^2$. Show that there are infinitely many pairs of the form $(2a^2,b^2)$ where the smaller number is the double of a perfect square satisfying the given property. (b) Find a pair of integers satisfying the property that is not in the form given in the first part, that is, find a pair of integers such that the smaller one is a perfect square and the larger one is the double of a perfect square.

1958 November Putnam, A5

Tags: matrix , combinatorics

Show that the number of non-zero integers in the expansion of the $n$-th order determinant having zeroes in the main diagonal and ones elsewhere is $$n ! \left(1- \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!} + \cdots + \frac{(-1)^{n}}{n!} \right) .$$

2019 Philippine MO, 2

Tags: combinatorics , double counting

Twelve students participated in a theater festival consisting of $n$ different performances. Suppose there were six students in each performance, and each pair of performances had at most two students in common. Determine the largest possible value of $n$.

2005 MOP Homework, 1

Tags: number theory

Let $a0$, $a1$, ..., $a_n$ be integers, not all zero, and all at least $-1$. Given that $a_0+2a_1+2^2a_2+...+2^na_n =0$, prove that $a_0+a_1+...+a_n>0$.

1988 Irish Math Olympiad, 10

Tags: inequalities

Let $0\le x\le 1$. Show that if $n$ is any positive integer, then $$(1+x)^n\ge (1-x)^n+2nx(1-x^2)^{\frac{n-1}{2}}$$.

1999 Hungary-Israel Binational, 2

Tags: analytic geometry , graphing lines , slope , combinatorics

$ 2n\plus{}1$ lines are drawn in the plane, in such a way that every 3 lines define a triangle with no right angles. What is the maximal possible number of acute triangles that can be made in this way?

2005 Dutch Mathematical Olympiad, 1

Tags:

In how many ways can one choose distinct numbers a and b from {1, 2, 3, ..., 2005} such that a + b is a multiple of 5?

2015 Princeton University Math Competition, A3

Tags: geometry

Let $I$ be the incenter of a triangle $ABC$ with $AB = 20$, $BC = 15$, and $BI = 12$. Let $CI$ intersect the circumcircle $\omega_1$ of $ABC$ at $D \neq C $. Alice draws a line $l$ through $D$ that intersects $\omega_1$ on the minor arc $AC$ at $X$ and the circumcircle $\omega_2$ of $AIC$ at $Y$ outside $\omega_1$. She notices that she can construct a right triangle with side lengths $ID$, $DX$, and $XY$. Determine, with proof, the length of $IY$.

2022 Math Prize for Girls Olympiad, 2

Tags: mew

Determine, with proof, whether or not there exists a [i]non-isosceles[/i] trapezoid $ABCD$ such that the lengths $AC$ and $BD$ both lie in the set $\{ DA+AB, AB+BC, BC+CD, CD+DA, AB+CD, BC+DA \}$.

1997 National High School Mathematics League, 12

Tags: logarithm

Let $a=\lg z+\lg\left[x(yz)^{-1}+1\right],b=\lg x^{-1}+\lg(xyz+1),c=\lg y+\lg\left[(xyz)^{-1}+1\right]$, if $M=\max\{a,b,c\}$, then the minumum value of $M$ is________.

2010 Purple Comet Problems, 6

Tags: arithmetic sequence

Evaluate the sum $1 + 2 - 3 + 4 + 5 - 6 + 7 + 8 - 9 \cdots + 208 + 209 - 210.$

1992 IMO Shortlist, 15

Tags: number theory , perfect power , additive combinatorics , additive number theory

Does there exist a set $ M$ with the following properties? [i](i)[/i] The set $ M$ consists of 1992 natural numbers. [i](ii)[/i] Every element in $ M$ and the sum of any number of elements have the form $ m^k$ $ (m, k \in \mathbb{N}, k \geq 2).$

1996 Czech and Slovak Match, 3

Tags: inequalities , solid geometry , pyramid , geometry , 3d geometry

The base of a regular quadrilateral pyramid $\pi$ is a square with side length $2a$ and its lateral edge has length a$\sqrt{17}$. Let $M$ be a point inside the pyramid. Consider the five pyramids which are similar to $\pi$ , whose top vertex is at $M$ and whose bases lie in the planes of the faces of $\pi$ . Show that the sum of the surface areas of these five pyramids is greater or equal to one fifth the surface of $\pi$ , and find for which $M$ equality holds.

2009 National Olympiad First Round, 31

Tags: inequalities

For all $ |x| \ge n$, the inequality $ |x^3 \plus{} 3x^2 \minus{} 33x \minus{} 3| \ge 2x^2$ holds. Integer $ n$ can be at least ? $\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ 5$

2013 Tournament of Towns, 4

Tags: coloring , sum , product , algebra , combinatorics

On a circle, there are $1000$ nonzero real numbers painted black and white in turn. Each black number is equal to the sum of two white numbers adjacent to it, and each white number is equal to the product of two black numbers adjacent to it. What are the possible values of the total sum of $1000$ numbers?

2015 Saint Petersburg Mathematical Olympiad, 6

Tags: combinatorics , graph theory

In country there are some cities, some pairs of cities are connected with roads.From every city go out exactly $100$ roads. We call $10$ roads, that go out from same city, as bunch. Prove, that we can split all roads in several bunches.

2006 Chile National Olympiad, 4

Tags: number theory , perfect square , perfect cube

Let $n$ be a $6$-digit number, perfect square and perfect cube, if $n -6$ is neither even nor multiple of $3$. Find $n$ .

2017 Kosovo Team Selection Test, 5

Tags: geometry

Given triangle $ABC$. Let $P$, $Q$, $R$, be the tangency points of inscribed circle of $\triangle ABC$ on sides $AB$, $BC$, $AC$ respectively. We take the reflection of these points with respect to midpoints of the sides they lie on, and denote them as $P',Q'$ and $R'$. Prove that $AP'$, $BQ'$, and $CR'$ are concurrent.

2021 Peru Cono Sur TST., P2

Tags: number theory

For each positive integer $k$ we denote by $S(k)$ the sum of its digits, for example $S(132)=6$ and $S(1000)=1$. A positive integer $n$ is said to be $\textbf{fascinating}$ if it holds that $n = \frac{k}{S(k)}$ for some positive integer $k$. For example, the number $11$ is $\textbf{fascinating}$ since $11 = \frac{198}{S(198)} ($since $\frac{198}{S(198)}=\frac{198}{1+9+8}=\frac{198}{18} = 11)$. Prove that there exists a positive integer less than $2021$ and that it is not $\textbf{fascinating}$.

2010 Argentina Team Selection Test, 4

Tags: geometry , rhombus , combinatorics

Two players, $A$ and $B$, play a game on a board which is a rhombus of side $n$ and angles of $60^{\circ}$ and $120^{\circ}$, divided into $2n^2$ equilateral triangles, as shown in the diagram for $n=4$. $A$ uses a red token and $B$ uses a blue token, which are initially placed in cells containing opposite corners of the board (the $60^{\circ}$ ones). In turns, players move their token to a neighboring cell (sharing a side with the previous one). To win the game, a player must either place his token on the cell containing the other player's token, or get to the opposite corner to the one where he started. If $A$ starts the game, determine which player has a winning strategy.

2010 239 Open Mathematical Olympiad, 3

Tags: combinatorics

Grisha wrote $n$ different natural numbers, the sum of which does not exceed $S$. The saboteur added to each of them a number from the half-interval $[0, 1)$. The sabotage is successful if there exists two subsets, the sums of the numbers in which differ by no more than $1$. At what minimum $S$ can Grisha ensure that the sabotage will definitely not be succeeded?

Kvant 2022, M2710

Tags: combinatorics , board , geometry

We are given an $(n^2-1)\times(n^2-1)$ checkered board. A set of $n{}$ cells is called [i]progressive[/i] if the centers of the cells lie on a straight line and form $n-1$ equal intervals. Find the number of progressive sets. [i]Proposed by P. Kozhevnikov[/i]

2011 Indonesia TST, 2

Tags: combinatorics , geometry , probability , acute

Let $n$ be a integer and $n \ge 3$, and $T_1T_2...T_n$ is a regular n-gon. Distinct $3$ points $T_i , T_j , T_k$ are chosen randomly. Determine the probability of triangle $T_iT_jT_k$ being an acute triangle.

2010 Bosnia And Herzegovina - Regional Olympiad, 4

Tags: combinatorics , noncollinear

In plane there are $n$ noncollinear points $A_1$, $A_2$,...,$A_n$. Prove that there exist a line which passes through exactly two of these points