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.

Find the value of $a_2 + a_4 + a_6 + \dots + a_{98}$ if $a_1$, $a_2$, $a_3$, $\dots$ is an arithmetic progression with common difference 1, and $a_1 + a_2 + a_3 + \dots + a_{98} = 137$.

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]

Determine the largest integer $n\geq 3$ for which the edges of the complete graph on $n$ vertices can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.

In a football tournament there are n teams, with ${n \ge 4}$, and each pair of teams meets exactly once. Suppose that, at the end of the tournament, the final scores form an arithmetic sequence where each team scores ${1}$ more point than the following team on the scoreboard. Determine the maximum possible score of the lowest scoring team, assuming usual scoring for football games (where the winner of a game gets ${3}$ points, the loser ${0}$ points, and if there is a tie both teams get ${1}$ point).

Let $n$ and $k$ be positive integers. Consider $n$ infinite arithmetic progressions of nonnegative integers with the property that among any $k$ consecutive nonnegative integers, at least one of $k$ integers belongs to one of the $n$ arithmetic progressions. Let $d_1,d_2,\ldots,d_n$ denote the differences of the arithmetic progressions, and let $d=\min\{d_1,d_2,\ldots,d_n\}$. In terms of $n$ and $k$, what is the maximum possible value of $d$?

For a natural number $d$, $M_d$ denotes the set of natural numbers which are not representable as the sum of at least two consecutive terms of an arithmetic progression with the common difference d whose terms are integers. Prove that each $c\in M_3$ can be written in the form $c=ab$, where $a\in M_1$ and $b\in M_2\setminus\{2\}$.

Numbers from $1$ to $100$ are written on the board. Is it possible to cross $10$ numbers in such way, that we couldn't select 10 numbers from rest which would form arithmetic progression?

How many numbers are there that appear both in the arithmetic sequence $10, 16, 22, 28, ... 1000$ and the arithmetic sequence $10, 21, 32, 43, ..., 1000?$

In the five-sided star shown, the letters $A,B,C,D,$ and $E$ are replaced by the numbers $3,5,6,7,$ and $9$, although not necessarily in this order. The sums of the numbers at the ends of the line segments $\overline{AB}$,$\overline{BC}$,$\overline{CD}$,$\overline{DE}$, and $\overline{EA}$ form an arithmetic sequence, although not necessarily in this order. What is the middle term of the arithmetic sequence? [asy] size(150); defaultpen(linewidth(0.8)); string[] strng = {'A','D','B','E','C'}; pair A=dir(90),B=dir(306),C=dir(162),D=dir(18),E=dir(234); draw(A--B--C--D--E--cycle); for(int i=0;i<=4;i=i+1) { path circ=circle(dir(90-72*i),0.125); unfill(circ); draw(circ); label("$"+strng[i]+"$",dir(90-72*i)); } [/asy] $ \textbf{(A)}\ 9\qquad \textbf{(B)}\ 10\qquad \textbf{(C)}\ 11\qquad \textbf{(D)}\ 12\qquad \textbf{(E)}\ 13$

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]

Give a geometric series $(a_n)$ with common ratio of $q$, let $b_1=a_1+a_2+a_3,b_2=a_4+a_5+a_6,\cdots,b_n=a_{3n}+a_{3n+1}+a_{3n+2}$, then sequence $(b_n)$ $\text{(A)}$ is an arithmetic sequence $\text{(B)}$ is a geometric series with common ratio of $q$ $\text{(C)}$ is a geometric series with common ratio of $q^3$ $\text{(D)}$ is neither an arithmetic sequence nor a geometric series

Let $n \ge 2018$ be an integer, and let $a_1, a_2, \dots, a_n, b_1, b_2, \dots, b_n$ be pairwise distinct positive integers not exceeding $5n$. Suppose that the sequence \[ \frac{a_1}{b_1}, \frac{a_2}{b_2}, \dots, \frac{a_n}{b_n} \] forms an arithmetic progression. Prove that the terms of the sequence are equal.

The sequence $\{a_n\}_{n}$ satisfies the relations $a_1=a_2=1$ and for all positive integers $n$, \[ a_{n+2} = \frac 1{a_{n+1}} + a_n . \] Find $a_{2004}$.

For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$

The arithmetic mean (ordinary average) of the fifty-two successive positive integers beginning with $2$ is: $\textbf{(A) }27\qquad \textbf{(B) }27\tfrac14\qquad \textbf{(C) }27\tfrac12\qquad \textbf{(D) }28\qquad \textbf{(E) }28\tfrac12$

Let $x\neq y$. Two sequences $x,a_1,a_2,a_3,y$ and $b_1,x,b_2,b_3,y,b_4$ are arithmetic sequence. Then $\frac{b_4-b_3}{a_2-a_1}=$________.

Let $n \geq 3$ be an integer. Let $f$ be a function from the set of all integers to itself with the following property: If the integers $a_1,a_2,\ldots,a_n$ form an arithmetic progression, then the numbers $$f(a_1),f(a_2),\ldots,f(a_n)$$ form an arithmetic progression (possibly constant) in some order. Find all values for $n$ such that the only functions $f$ with this property are the functions of the form $f(x)=cx+d$, where $c$ and $d$ are integers.

There is an arithmetic progression of $7$ terms in which all the terms are different prime numbers. Determine the smallest possible value of the last term of such a progression. Clarification: In an arithmetic progression of difference $d$ each term is equal to the previous one plus $d$.

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.

Equilateral triangle $ABC$ has side length $6$. Circles with centers at $A$, $B$, and $C$ are drawn such that their respective radii $r_A$, $r_B$, and $r_C$ form an arithmetic sequence with $r_A<r_B<r_C$. If the shortest distance between circles $A$ and $B$ is $3.5$, and the shortest distance between circles $A$ and $C$ is $3$, then what is the area of the shaded region? Express your answer in terms of pi. [asy] size(8cm); draw((0,0)--(6,0)--6*dir(60)--cycle); draw(circle((0,0),1)); draw(circle(6*dir(60),1.5)); draw(circle((6,0),2)); filldraw((0,0)--arc((0,0),1,0,60)--cycle, grey); filldraw(6*dir(60)--arc(6*dir(60),1.5,240,300)--cycle, grey); filldraw((6,0)--arc((6,0),2,120,180)--cycle, grey); label("$A$",(0,0),SW); label("$B$",6*dir(60),N); label("$C$",(6,0),SE); [/asy]

Initially Alex, Betty, and Charlie had a total of $444$ peanuts. Charlie had the most peanuts, and Alex had the least. The three numbers of peanuts that each person had form a geometric progression. Alex eats 5 of his peanuts, Betty eats 9 of her peanuts, and Charlie eats 25 of his peanuts. Now the three numbers of peanuts that each person has form an arithmetic progression. Find the number of peanuts Alex had initially.

The sequence $ a_1<a_2<...<a_M$ of real numbers is called a weak arithmetic progression of length $ M$ if there exists an arithmetic progression $ x_0,x_1,...,x_M$ such that: $ x_0 \le a_1<x_1 \le a_2<x_2 \le ... \le a_M<x_M.$ $ (a)$ Prove that if $ a_1<a_2<a_3$ then $ (a_1,a_2,a_3)$ is a weak arithmetic progression. $ (b)$ Prove that any subset of $ \{ 0,1,2,...,999 \}$ with at least $ 730$ elements contains a weak arithmetic progression of length $ 10$.

Consider an arithmetic progression made up of $100$ terms. If the sum of all the terms of the progression is $150$ and the sum of the even terms is $50$, find the sum of the squares of the $100$ terms of the progression.

Let $d$ be a positive integer. The seqeunce $a_1, a_2, a_3,...$ of positive integers is defined by $a_1 = 1$ and $a_{n + 1} = n\left \lfloor \frac{a_n}{n} \right \rfloor+ d$ for $n = 1,2,3, ...$ . Prove that there exists a positive integer $N$ so that the terms $a_N,a_{N + 1}, a_{N + 2},...$ form an arithmetic progression. Note: If $x$ is a real number, $\left \lfloor x \right \rfloor $ denotes the largest integer that is less than or equal to $x$.