Found problems: 800
On a stormy night ten guests came to dinner party and left their shoes outside the room in order to keep the carpet clean. After the dinner there was a blackout, and the gusts leaving one by one, put on at random, any pair of shoes big enough for their feet. (Each pair of shoes stays together). Any guest who could not find a pair big enough spent the night there. What is the largest number of guests who might have had to spend the night there?
Suppose that $ s_1,s_2,s_3, \ldots$ is a strictly increasing sequence of positive integers such that the sub-sequences \[s_{s_1},\, s_{s_2},\, s_{s_3},\, \ldots\qquad\text{and}\qquad s_{s_1+1},\, s_{s_2+1},\, s_{s_3+1},\, \ldots\] are both arithmetic progressions. Prove that the sequence $ s_1, s_2, s_3, \ldots$ is itself an arithmetic progression.
[i]Proposed by Gabriel Carroll, USA[/i]
Let $\mathbb{Z}$ and $\mathbb{Q}$ be the sets of integers and rationals respectively.
a) Does there exist a partition of $\mathbb{Z}$ into three non-empty subsets $A,B,C$ such that the sets $A+B, B+C, C+A$ are disjoint?
b) Does there exist a partition of $\mathbb{Q}$ into three non-empty subsets $A,B,C$ such that the sets $A+B, B+C, C+A$ are disjoint?
Here $X+Y$ denotes the set $\{ x+y : x \in X, y \in Y \}$, for $X,Y \subseteq \mathbb{Z}$ and for $X,Y \subseteq \mathbb{Q}$.
For any finite sets $X$ and $Y$ of positive integers, denote by $f_X(k)$ the $k^{\text{th}}$ smallest positive integer not in $X$, and let $$X*Y=X\cup \{ f_X(y):y\in Y\}.$$Let $A$ be a set of $a>0$ positive integers and let $B$ be a set of $b>0$ positive integers. Prove that if $A*B=B*A$, then $$\underbrace{A*(A*\cdots (A*(A*A))\cdots )}_{\text{ A appears $b$ times}}=\underbrace{B*(B*\cdots (B*(B*B))\cdots )}_{\text{ B appears $a$ times}}.$$
[i]Proposed by Alex Zhai, United States[/i]
[b]7.1[/b] Prove that a natural number with an odd number of divisors is a perfect square.
[b]7.2[/b] In a triangle $ABC$ with area $S$, medians $AK$ and $BE$ are drawn, intersecting at the point $O$. Find the area of the quadrilateral $CKOE$.
[img]https://cdn.artofproblemsolving.com/attachments/0/f/9cd32bef4f4459dc2f8f736f7cc9ca07e57d05.png[/img]
[b]7.3 .[/b] The front tires of a car wear out after $25,000$ kilometers, and the rear tires after $15,000$ kilometers. When you need to swap tires so that the car can travel the longest possible distance with the same tires?
[b]7.4 [/b] A $24 \times 60$ rectangle is divided by lines parallel to it sides, into unit squares. How many parts will this rectangle be divided into if you also draw a diagonal in it?
[b]7.5 / 8.4[/b] Let $ [A]$ denote the largest integer not greater than $A$. Solve the equation: $[(5 + 6x)/8] = (15x-7)/5$ .
[b]7.6[/b] Black paint was sprayed onto a white surface. Prove that there are two points of the same color, the distance between which is $1965$ meters.
PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988081_1965_leningrad_math_olympiad]here[/url].
Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied:
[list=1]
[*] Each number in the table is congruent to $1$ modulo $n$.
[*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$.
[/list]
Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.
Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord.
Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.
Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.
A set of positive integers is called [i]fragrant[/i] if it contains at least two elements and each of its elements has a prime factor in common with at least one of the other elements. Let $P(n)=n^2+n+1$. What is the least possible positive integer value of $b$ such that there exists a non-negative integer $a$ for which the set $$\{P(a+1),P(a+2),\ldots,P(a+b)\}$$ is fragrant?
Let $r,g,b$ be non negative integers and $\Gamma$ be a connected graph with $r+g+b+1$ vertices. Its edges are colored in red green and blue. It turned out that $\Gamma $ contains
A spanning tree with exactly $r$ red edges.
A spanning tree with exactly $g$ green edges.
A spanning tree with exactly $b$ blue edges.
Prove that $\Gamma$ contains a spanning tree with exactly $r$ red edges, $g$ green edges and $b$ blue edges.
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that
$$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$
for all positive integers $n$. Show that $a_{2022}\leq 1$.
Let $\nu$ be an irrational positive number, and let $m$ be a positive integer. A pair of $(a,b)$ of positive integers is called [i]good[/i] if
\[a \left \lceil b\nu \right \rceil - b \left \lfloor a \nu \right \rfloor = m.\] A good pair $(a,b)$ is called [i]excellent[/i] if neither of the pair $(a-b,b)$ and $(a,b-a)$ is good.
Prove that the number of excellent pairs is equal to the sum of the positive divisors of $m$.
A grid of cells is tiled with dominoes such that every cell is covered by exactly one domino. A subset $S$ of dominoes is chosen. Is it true that at least one of the following 2 statements is false?
(1) There are $2022$ more horizontal dominoes than vertical dominoes in $S$.
(2) The cells covered by the dominoes in $S$ can be tiled completely and exactly by $L$-shaped tetrominoes.
There are several cities in a country. Some pairs of the cities are connected by a two-way airline of one of the $N$ companies, so that each company serves exactly one airline from each city, and one can travel between any two cities, possibly with transfers. During a financial crisis, $N-1$ airlines have been canceled, all from different companies. Prove that it is still possible to travel between any two cities.
Alice and Bob play a game in which they take turns removing stones from a heap that initially has $n$ stones. The number of stones removed at each turn must be one less than a prime number. The winner is the player who takes the last stone. Alice plays first. Prove that there are infinitely many such $n$ such that Bob has a winning strategy. (For example, if $n=17,$ then Alice might take $6$ leaving $11;$ then Bob might take $1$ leaving $10;$ then Alice can take the remaining stones to win.)
Let $a_1$, $a_2$, $\ldots$ be an infinite sequence of positive integers. Suppose that there is an integer $N > 1$ such that, for each $n \geq N$, the number
$$\frac{a_1}{a_2} + \frac{a_2}{a_3} + \cdots + \frac{a_{n-1}}{a_n} + \frac{a_n}{a_1}$$
is an integer. Prove that there is a positive integer $M$ such that $a_m = a_{m+1}$ for all $m \geq M$.
[i]Proposed by Bayarmagnai Gombodorj, Mongolia[/i]
Find, with proof, all positive integers $n$ for which $2^n + 12^n + 2011^n$ is a perfect square.
Let $n \geq 4$ be an integer. Find all positive real solutions to the following system of $2n$ equations:
\begin{align*}
a_{1} &=\frac{1}{a_{2 n}}+\frac{1}{a_{2}}, & a_{2}&=a_{1}+a_{3}, \\
a_{3}&=\frac{1}{a_{2}}+\frac{1}{a_{4}}, & a_{4}&=a_{3}+a_{5}, \\
a_{5}&=\frac{1}{a_{4}}+\frac{1}{a_{6}}, & a_{6}&=a_{5}+a_{7} \\
&\vdots & &\vdots \\
a_{2 n-1}&=\frac{1}{a_{2 n-2}}+\frac{1}{a_{2 n}}, & a_{2 n}&=a_{2 n-1}+a_{1}
\end{align*}
On a $999\times 999$ board a [i]limp rook[/i] can move in the following way: From any square it can move to any of its adjacent squares, i.e. a square having a common side with it, and every move must be a turn, i.e. the directions of any two consecutive moves must be perpendicular. A [i]non-intersecting route[/i] of the limp rook consists of a sequence of pairwise different squares that the limp rook can visit in that order by an admissible sequence of moves. Such a non-intersecting route is called [i]cyclic[/i], if the limp rook can, after reaching the last square of the route, move directly to the first square of the route and start over.
How many squares does the longest possible cyclic, non-intersecting route of a limp rook visit?
[i]Proposed by Nikolay Beluhov, Bulgaria[/i]
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
If $ab+\sqrt{ab+1}+\sqrt{a^2+b}\sqrt{a+b^2}=0$, find the value of $b\sqrt{a^2+b}+a\sqrt{b^2+a}$
Find the maximum possible value of $k$ for which there exist distinct reals $x_1,x_2,\ldots ,x_k $ greater than $1$ such that for all $1 \leq i, j \leq k$,
$$x_i^{\lfloor x_j \rfloor }= x_j^{\lfloor x_i\rfloor}.$$
[i]Proposed by Morteza Saghafian[/i]
Let $\tau(n)$ denote the number of positive integer divisors of a positive integer $n$ (for example, $\tau(2022) = 8$). Given a polynomial $P(X)$ with integer coefficients, we define a sequence $a_1, a_2,\ldots$ of nonnegative integers by setting
\[a_n =\begin{cases}\gcd(P(n), \tau (P(n)))&\text{if }P(n) > 0\\0 &\text{if }P(n) \leq0\end{cases}\]
for each positive integer $n$. We then say the sequence [i]has limit infinity[/i] if every integer occurs in this sequence only finitely many times (possibly not at all).
Does there exist a choice of $P(X)$ for which the sequence $a_1$, $a_2$, . . . has limit infinity?
[i]Jovan Vuković[/i]
Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied:
[list=1]
[*] Each number in the table is congruent to $1$ modulo $n$.
[*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$.
[/list]
Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.
Convex quadrilaterals \(ABCD\), \(A_1B_1C_1D_1\), and \(A_2B_2C_2D_2\) are similar with vertices in order. Points \(A\), \(A_1\), \(B_2\), \(B\) are collinear in order, points \(B\), \(B_1\), \(C_2\), \(C\) are collinear in order, points \(C\), \(C_1\), \(D_2\), \(D\) are collinear in order, and points \(D\), \(D_1\), \(A_2\), \(A\) are collinear in order. Diagonals \(AC\) and \(BD\) intersect at \(P\), diagonals \(A_1C_1\) and \(B_1D_1\) intersect at \(P_1\), and diagonals \(A_2C_2\) and \(B_2D_2\) intersect at \(P_2\). Prove that points \(P\), \(P_1\), and \(P_2\) are collinear.
[i]Proposed by Holden Mui[/i]