Olympiad problems

2012 USA TSTST, 1

Find all infinite sequences $a_1, a_2, \ldots$ of positive integers satisfying the following properties: (a) $a_1 < a_2 < a_3 < \cdots$, (b) there are no positive integers $i$, $j$, $k$, not necessarily distinct, such that $a_i+a_j=a_k$, (c) there are infinitely many $k$ such that $a_k = 2k-1$.

2024 Switzerland Team Selection Test, 5

Tags: arithmetic sequence , number theory

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.

PEN A Problems, 2

Tags: arithmetic sequence , diophantine equation , divisibility theory , pell s equation

Find infinitely many triples $(a, b, c)$ of positive integers such that $a$, $b$, $c$ are in arithmetic progression and such that $ab+1$, $bc+1$, and $ca+1$ are perfect squares.

2003 IMO Shortlist, 4

Tags: arithmetic sequence , inequalities

Let $n$ be a positive integer and let $x_1\le x_2\le\cdots\le x_n$ be real numbers. Prove that \[ \left(\sum_{i,j=1}^{n}|x_i-x_j|\right)^2\le\frac{2(n^2-1)}{3}\sum_{i,j=1}^{n}(x_i-x_j)^2. \] Show that the equality holds if and only if $x_1, \ldots, x_n$ is an arithmetic sequence.

1986 IMO Longlists, 15

Tags: induction , ratio , arithmetic sequence , algebra

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.$

2005 AIME Problems, 2

Tags: arithmetic sequence , number theory , prime factorization

For each positive integer $k$, let $S_k$ denote the increasing arithmetic sequence of integers whose first term is $1$ and whose common difference is $k$. For example, $S_3$ is the sequence $1,4,7,10,...$. For how many values of $k$ does $S_k$ contain the term $2005$?

1965 AMC 12/AHSME, 20

Tags: arithmetic sequence

For every $ n$ the sum of $ n$ terms of an arithmetic progression is $ 2n \plus{} 3n^2$. The $ r$th term is: $ \textbf{(A)}\ 3r^2 \qquad \textbf{(B)}\ 3r^2 \plus{} 2r \qquad \textbf{(C)}\ 6r \minus{} 1 \qquad \textbf{(D)}\ 5r \plus{} 5 \qquad \textbf{(E)}\ 6r \plus{} 2 \qquad$

2003 AMC 10, 1

Tags: arithmetic sequence

What is the difference between the sum of the first $ 2003$ even counting numbers and the sum of the first $ 2003$ odd counting numbers? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 2003 \qquad \textbf{(E)}\ 4006$

2011 Romania Team Selection Test, 2

Tags: floor function , pigeonhole principle , arithmetic sequence , ramsey theory , number theory

Prove that the set $S=\{\lfloor n\pi\rfloor \mid n=0,1,2,3,\ldots\}$ contains arithmetic progressions of any finite length, but no infinite arithmetic progressions. [i]Vasile Pop[/i]

1997 Korea National Olympiad, 8

Tags: arithmetic sequence

For any positive integers $x,y,z$ and $w,$ prove that $x^2,y^2,z^2$ and $w^2$ cannot be four consecutive terms of arithmetic sequence.

2010 Romania Team Selection Test, 1

Tags: calculus , integration , algebra , polynomial , modular arithmetic , induction , arithmetic sequence

A nonconstant polynomial $f$ with integral coefficients has the property that, for each prime $p$, there exist a prime $q$ and a positive integer $m$ such that $f(p) = q^m$. Prove that $f = X^n$ for some positive integer $n$. [i]AMM Magazine[/i]

2012 USA TSTST, 3

Tags: function , modular arithmetic , induction , number theory , greatest common divisor , relatively prime , arithmetic sequence

Let $\mathbb N$ be the set of positive integers. Let $f: \mathbb N \to \mathbb N$ be a function satisfying the following two conditions: (a) $f(m)$ and $f(n)$ are relatively prime whenever $m$ and $n$ are relatively prime. (b) $n \le f(n) \le n+2012$ for all $n$. Prove that for any natural number $n$ and any prime $p$, if $p$ divides $f(n)$ then $p$ divides $n$.

2014 NIMO Problems, 6

Tags: modular arithmetic , number theory , relatively prime , arithmetic sequence , logarithm

Let $\varphi(k)$ denote the numbers of positive integers less than or equal to $k$ and relatively prime to $k$. Prove that for some positive integer $n$, \[ \varphi(2n-1) + \varphi(2n+1) < \frac{1}{1000} \varphi(2n). \][i]Proposed by Evan Chen[/i]

2003 IMO, 5

Tags: inequalities , arithmetic sequence

Let $n$ be a positive integer and let $x_1\le x_2\le\cdots\le x_n$ be real numbers. Prove that \[ \left(\sum_{i,j=1}^{n}|x_i-x_j|\right)^2\le\frac{2(n^2-1)}{3}\sum_{i,j=1}^{n}(x_i-x_j)^2. \] Show that the equality holds if and only if $x_1, \ldots, x_n$ is an arithmetic sequence.

1990 IMO Shortlist, 7

Tags: algebra , polynomial , arithmetic sequence , number theory , functional equation , divisibility

Let $ f(0) \equal{} f(1) \equal{} 0$ and \[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\] Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$

1991 IMO, 2

Tags: number theory , arithmetic sequence , system of equations , eulers function , laurentiu panaitopol

Let $ \,n > 6\,$ be an integer and $ \,a_{1},a_{2},\cdots ,a_{k}\,$ be all the natural numbers less than $ n$ and relatively prime to $ n$. If \[ a_{2} \minus{} a_{1} \equal{} a_{3} \minus{} a_{2} \equal{} \cdots \equal{} a_{k} \minus{} a_{k \minus{} 1} > 0, \] prove that $ \,n\,$ must be either a prime number or a power of $ \,2$.

1990 Irish Math Olympiad, 2

Tags: number theory , prime number , arithmetic sequence

Suppose that $p_1<p_2<\dots <p_{15}$ are prime numbers in arithmetic progression, with common difference $d$. Prove that $d$ is divisible by $2,3,5,7,11$ and $13$.