Found problems: 5802
Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$.
[i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]
Let $a_1,a_2,\dots$ be a sequence of positive numbers satisfying, for any positive integers $k,l,m,n$ such that $k+n=m+l$, $$\frac{a_k+a_n}{1+a_ka_n}=\frac{a_m+a_l}{1+a_ma_l}.$$Show that there exist positive numbers $b,c$ so that $b\le a_n\le c$ for any positive integer $n$.
Let $G = (V, E)$ be a finite simple graph on $n$ vertices. An edge $e$ of $G$ is called a [i]bottleneck[/i] if one can partition $V$ into two disjoint sets $A$ and $B$ such that
[list]
[*] at most $100$ edges of $G$ have one endpoint in $A$ and one endpoint in $B$; and
[*] the edge $e$ is one such edge (meaning the edge $e$ also has one endpoint in $A$ and one endpoint in $B$).
[/list]
Prove that at most $100n$ edges of $G$ are bottlenecks.
[i]Proposed by Yang Liu[/i]
Let $n \ge 2$ be an integer and let $a_1, a_2, \cdots a_n$ be fixed positive integers (not necessarily all distinct) in such a way that $\gcd(a_1, a_2 \cdots a_n)=1$. In a board the numbers $a_1, a_2 \cdots a_n$ are all written along with a positive integer $x$. A move consists of choosing two numbers $a>b$ from the $n+1$ numbers in the board and replace them with $a-b,2b$. Find all possible values of $x$, with respect of the values of $a_1, a_2 \cdots a_n$, for which it is possible to achieve a finite sequence of moves (possibly none) such that eventually all numbers written in the board are equal.
Let $n$ be a positive integer. Let $S$ be a subset of points on the plane with these conditions:
$i)$ There does not exist $n$ lines in the plane such that every element of $S$ be on at least one of them.
$ii)$ for all $X \in S$ there exists $n$ lines in the plane such that every element of $S - {X} $ be on at least one of them.
Find maximum of $\mid S\mid$.
[i]Proposed by Erfan Salavati[/i]
Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products
\[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\]
form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.
Two players in turns color the sides of an $n$-gon. The first player colors any side that has $0$ or $2$ common vertices with already colored sides. The second player colors any side that has exactly $1$ common vertex with already colored sides. The player who cannot move, loses. For which $n$ the second player has a winning strategy?
Let $\mathbb Q$ be the set of all rational numbers and $\mathbb R$ be the set of real numbers. Function $f: \mathbb Q \to \mathbb R$ satisfies the following conditions:
(i) $f(0) = 0$, and for any nonzero $a \in Q, f(a) > 0.$
(ii) $f(x + y) = f(x)f(y) \qquad \forall x,y \in \mathbb Q.$
(iii) $f(x + y) \leq \max\{f(x), f(y)\} \qquad \forall x,y \in \mathbb Q , x,y \neq 0.$
Let $x$ be an integer and $f(x) \neq 1$. Prove that $f(1 + x + x^2+ \cdots + x^n) = 1$ for any positive integer $n.$
There is an empty table with $2^{100}$ rows and $100$ columns. Alice and Eva take turns filling the empty cells of the first row of the table, Alice plays first. In each move, Alice chooses an empty cell and puts a cross in it; Eva in each move chooses an empty cell and puts a zero. When no empty cells remain in the first row, the players move on to the second row, and so on (in each new row Alice plays first).
The game ends when all the rows are filled. Alice wants to make as many different rows in the table as possible, while Eva wants to make as few as possible. How many different rows will be there in the table if both follow their best strategies?
Proposed by Denis Afrizonov
A lattice point is a point on the coordinate plane with integer coefficients. Prove or disprove : there exists a finite set $S$ of lattice points such that for every line $l$ in the plane with slope $0,1,-1$, or undefined, either $l$ and $S$ intersect at exactly $2022$ points, or they do not intersect.
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]
Find all functions $ f: \mathbb{R} \to \mathbb{R} $ such that $$ f\left(xf\left(y\right)-f\left(x\right)-y\right) = yf\left(x\right)-f\left(y\right)-x $$ holds for all $ x,y \in \mathbb{R} $
Let $a,b,c,d$ be positive integers such that $ad \neq bc$ and $gcd(a,b,c,d)=1$. Let $S$ be the set of values attained by $\gcd(an+b,cn+d)$ as $n$ runs through the positive integers. Show that $S$ is the set of all positive divisors of some positive integer.
Find all functions $f:\mathbb R\to\mathbb R$ such that $$f\left( x^2+xf(y)\right)=xf(x+y)$$ for all reals $x,y$.
Functions $f,g:\mathbb{Z}\to\mathbb{Z}$ satisfy $$f(g(x)+y)=g(f(y)+x)$$ for any integers $x,y$. If $f$ is bounded, prove that $g$ is periodic.
For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.
Prove that the polynomial $P_n(x)=1+x+\frac{x^2}{2!}+\cdots +\frac{x^n}{n!}$ has no real zeros if $n$ is even and has exatly one real zero if $n$ is odd
Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses.
An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise.
Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.
Can there be drawn on a circle of radius $1$ a number of $1975$ distinct points, so that the distance (measured on the chord) between any two points (from the considered points) is a rational number?
A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$.
(a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced.
(b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$.
[i]Proposed by Jorge Tipe, Peru[/i]
Find all surjective functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: \[m \vert n \Longleftrightarrow f(m) \vert f(n).\]
Let $n$ be a positive integer and let $(x_1,\ldots,x_n)$, $(y_1,\ldots,y_n)$ be two sequences of positive real numbers. Suppose $(z_2,\ldots,z_{2n})$ is a sequence of positive real numbers such that $z_{i+j}^2 \geq x_iy_j$ for all $1\le i,j \leq n$.
Let $M=\max\{z_2,\ldots,z_{2n}\}$. Prove that \[
\left( \frac{M+z_2+\dots+z_{2n}}{2n} \right)^2
\ge
\left( \frac{x_1+\dots+x_n}{n} \right)
\left( \frac{y_1+\dots+y_n}{n} \right). \]
[hide="comment"]
[i]Edited by Orl.[/i]
[/hide]
[i]Proposed by Reid Barton, USA[/i]
[b]p1.[/b] At a certain point in time, $20\%$ of seniors, $30\%$ of juniors, and $50\%$ of sophomores at a school had a cold. If the number of sick students was the same for each grade, the fraction of sick students across all three grades can be written as $\frac{a}{b}$ , where a and b are relatively prime positive integers. Find $a + b$.
[b]p2.[/b] The average score on Mr. Feng’s recent test is a $63$ out of $100$. After two students drop out of the class, the average score of the remaining students on that test is now a $72$. What is the maximum number of students that could initially have been in Mr. Feng’s class? (All of the scores on the test are integers between $0$ and $100$, inclusive.)
[b]p3.[/b] Madeline is climbing Celeste Mountain. She starts at $(0, 0)$ on the coordinate plane and wants to reach the summit at $(7, 4)$. Every hour, she moves either $1$ unit up or $1$ unit to the right. A strawberry is located at each of $(1, 1)$ and $(4, 3)$. How many paths can Madeline take so that she encounters exactly one strawberry?
[b]p4.[/b] Let $E$ be a point on side $AD$ of rectangle $ABCD$. Given that $AB = 3$, $AE = 4$, and $\angle BEC = \angle CED$, the length of segment $CE$ can be written as $\sqrt{a}$ for some positive integer $a$. Find $a$.
[b]p5.[/b] Lucy has some spare change. If she were to convert it into quarters and pennies, the minimum number of coins she would need is $66$. If she were to convert it into dimes and pennies, the minimum number of coins she would need is $147$. How much money, in cents, does Lucy have?
[b]p6.[/b] For how many positive integers $x$ does there exist a triangle with altitudes of length $20$, $22$, and $x$?
[b]p7.[/b] Compute the number of positive integers $x$ for which $\frac{x^{20}}{x+22}$ is an integer.
[b]p8.[/b] Vincent the Bug is crawling along an octagonal prism. He starts on a fixed vertex $A$, visits all other vertices exactly once by traveling along the edges, and returns to $A$. Find the number of paths Vincent could have taken.
[b]p9.[/b] Point $U$ is chosen inside square $ALEX$ so that $\angle AUL = 90^o$. Given that $UL = 56$ and $UE = 65$, what is the sum of all possible values for the area of square $ALEX$?
[b]p10.[/b] Miranda has prepared $8$ outfits, no two of which are the same quality. She asks her intern Andrea to order these outfits for the new runway show. Andrea first randomly orders the outfits in a list. She then starts removing outfits according to the following method: she chooses a random outfit which is both immediately preceded and immediately succeeded by a better outfit and then removes it. Andrea repeats this process until there are no outfits that can be removed. Given that the expected number of outfits in the final routine can be written as $\frac{a}{b}$ for some relatively prime positive integers $a$ and $b$, find $a + b$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
$(HUN 1)$ Let $a$ and $b$ be arbitrary integers. Prove that if $k$ is an integer not divisible by $3$, then $(a + b)^{2k}+ a^{2k} +b^{2k}$ is divisible by $a^2 +ab+ b^2$
Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has
\[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]