Found problems: 492
Call a triple of numbers [b]Nice[/b] if one of them is the average of the other two. Assume that we have $2k+1$ distinct real numbers with $k^2$ [b] Nice[/b] triples. Prove that these numbers can be devided into two arithmetic progressions with equal ratios
Proposed by [i]Morteza Saghafian[/i]
Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.
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]
Fix a positive integer $n\geq 3$. Does there exist infinitely many sets $S$ of positive integers $\lbrace a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n\rbrace$, such that $\gcd (a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n)=1$, $\lbrace a_i\rbrace _{i=1}^n$, $\lbrace b_i\rbrace _{i=1}^n$ are arithmetic progressions, and $\prod_{i=1}^n a_i = \prod_{i=1}^n b_i$?
Is it possible to mark four points on the plane so that the distances between any point and three other points form an arithmetic progression? (V. Brayman)
Prove that the sum of the squares of the medians of a triangle is at least $ 9/4 $ if the circumradius of the triangle, the area of the triangle and the inradius of the triangle (in this order) are in arithmetic progression.
[i]Dumitru Crăciun[/i]
Let $x$, $y$, and $z$ be nonnegative integers that are less than or equal to 100. Suppose that $x + y + z$, $xy + z$, $x + yz$, and $xyz$ are (in some order) four consecutive terms of an arithmetic sequence. Compute the number of such ordered triples $(x, y, z)$.
Show that $\binom{n}{m},\binom{n}{m+1},\binom{n}{m+2}$ and $\binom{n}{m+3}$ cannot be in arithmetic progression, where $n,m>0$ and $n\geq m+3$.
Prove that there exists infinitely many primes $ p$ such that: \[ 13|p^3\plus{}1\]
For real numbers $a, b$ and $c$ we have
\[(2b-a)^2 + (2b-c)^2 = 2(2b^2-ac).\]
Prove that the numbers $a, b$ and $c$ are three consecutive terms in some arithmetic sequence.
Let $p\neq 3$ be a prime number. Show that there is a non-constant arithmetic sequence of positive integers $x_1,x_2,\ldots ,x_p$ such that the product of the terms of the sequence is a cube.
Suppose that $S$ is a finite set of real numbers with the property that any two distinct elements of $S$ form an arithmetic progression with another element in $S$. Give an example of such a set with 5 elements and show that no such set exists with more than $5$ elements.
Each of the numbers in the set \(A = \{1,2, \cdots, 2017\}\) is colored either red or white. Prove that for \(n \geq 18\), there exists a coloring of the numbers in \(A\) such that any of its n-term arithmetic sequences contains both colors.
Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$
[i]Proposed by Igor Voronovich, Belarus[/i]
Is there an arithmetic sequence with
a. $2003$
b. infinitely many
terms such that each term is a power of a natural number with a degree greater than $1$?
Bunbury the bunny is hopping on the positive integers. First, he is told a positive integer $n$. Then Bunbury chooses positive integers $a,d$ and hops on all of the spaces $a,a+d,a+2d,\dots,a+2013d$. However, Bunbury must make these choices so that the number of every space that he hops on is less than $n$ and relatively prime to $n$.
A positive integer $n$ is called [i]bunny-unfriendly[/i] if, when given that $n$, Bunbury is unable to find positive integers $a,d$ that allow him to perform the hops he wants. Find the maximum bunny-unfriendly integer, or prove that no such maximum exists.
Consider the sequence $a_{1}, a_{2}, a_{3},\ldots$ defined by $a_{1}=2024^{2024}$ and for each positive integer $n$, $$a_{n+1}=\left|a_{n}-\sqrt{2}\right|.$$ Prove that there exists an integer $k$ such that $a_{k+2}=a_k$.
[i]Here [/i]$\left|x\right|$[i] denotes the absolute value of [/i]$x$.
Prove that there exists a four-coloring of the set $M = \{1, 2, \cdots, 1987\}$ such that any arithmetic progression with $10$ terms in the set $M$ is not monochromatic.
[b][i]Alternative formulation[/i][/b]
Let $M = \{1, 2, \cdots, 1987\}$. Prove that there is a function $f : M \to \{1, 2, 3, 4\}$ that is not constant on every set of $10$ terms from $M$ that form an arithmetic progression.
[i]Proposed by Romania[/i]
Let $ \left( a_n \right)_{n\ge 1} $ be an arithmetic progression with $ a_1=1 $ and natural ratio.
[b]a)[/b] Prove that
$$ a_n^{1/a_k} <1+\sqrt{\frac{2\left( a_n-1 \right)}{a_k\left( a_k -1 \right)}} , $$
for any natural numbers $ 2\le k\le n. $
[b]b)[/b] Calculate $ \lim_{n\to\infty } \frac{1}{a_n}\sum_{k=1}^n a_n^{1/a_k} . $
[i]Nicolae Bourbăcuț[/i]
Let $\mathbb N = B_1\cup\cdots \cup B_q$ be a partition of the set $\mathbb N$ of all positive integers and let an integer $l \in \mathbb N$ be given. Prove that there exist a set $X \subset \mathbb N$ of cardinality $l$, an infinite set $T \subset \mathbb N$, and an integer $k$ with $1 \leq k \leq q$ such that for any $t \in T$ and any finite set $Y \subset X$, the sum $t+ \sum_{y \in Y} y$ belongs to $B_k.$
Let $a_1, a_2,...$ a sequence of real numbers.
For each positive integer $n$, we denote $m_n =\frac{a_1 + a_2 +... + a_n}{n}$.
It is known that there exists a real number $c$ such that for any different positive integers $i, j, k$: $(i - j) m_k + (j - k) m_i + (k - i) m_j = c$.
Prove that the sequence $a_1, a_2,..$ is arithmetic
Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying
\[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\]
for all integers $x$ and $y$. For such a function, we say that an integer $v$ is [i]f-rare[/i] if the set
\[X_v=\{x\in\mathbb Z:f(x)=v\}\]
is finite and nonempty.
(a) Prove that there exists such a function $f$ for which there is an $f$-rare integer.
(b) Prove that no such function $f$ can have more than one $f$-rare integer.
[i]Netherlands[/i]
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(f(m)+f(n))=m+n.\]
Suppose that $ \{a_n\}$ is an arithmetic sequence with \[a_1 \plus{} a_2 \plus{} \cdots \plus{} a_{100} \equal{} 100\quad\text{and}\quad a_{101} \plus{} a_{102} \plus{} \cdots \plus{} a_{200} \equal{} 200.\] What is the value of $ a_2 \minus{} a_1$?
$ \textbf{(A)}\ 0.0001 \qquad \textbf{(B)}\ 0.001 \qquad \textbf{(C)}\ 0.01 \qquad \textbf{(D)}\ 0.1 \qquad \textbf{(E)}\ 1$
Let $p$ and $q$ be two given positive integers. A set of $p+q$ real numbers $a_1<a_2<\cdots <a_{p+q}$ is said to be balanced iff $a_1,\ldots,a_p$ were an arithmetic progression with common difference $q$ and $a_p,\ldots,a_{p+q}$ where an arithmetic progression with common difference $p$. Find the maximum possible number of balanced sets, so that any two of them have nonempty intersection.
Comment: The intended problem also had "$p$ and $q$ are coprime" in the hypothesis. A typo when the problems where written made it appear like that in the exam (as if it were the only typo in the olympiad). Fortunately, the problem can be solved even if we didn't suppose that and it can be further generalized: we may suppose that a balanced set has $m+n$ reals $a_1<\cdots <a_{m+n-1}$ so that $a_1,\ldots,a_m$ is an arithmetic progression with common difference $p$ and $a_m,\ldots,a_{m+n-1}$ is an arithmetic progression with common difference $q$.