# Can we rearrange the integers, such that the arithmetic average of any two numbers does not appear between them?

Can we rearrange the integers, such that the arithmetic average of any two numbers does not appear between them?

In other words: Can we have a sequence $\{a_n\}_{n\in \mathbb{Z}}$, where all integers appear once and only once, such that $a_j\ne (a_i+a_k)/2,\forall i<j<k$?

I've noticed the questions here and here. But the first one only applies to arbitrarily long finite segments. The second does not contain a solution in itself, and unfortunately I can not access the reference (for free).

Also, the second question is much more general than this one, so I am wondering if this one can be solved somewhat more easily.

-
As you noticed, the paper contains the assertion that there is no such ordering. – André Nicolas Jul 4 '13 at 4:22
? When I looked at the second link, the existence of such "chaotic orderings" of the integers is said to be known, and the authors (going for the same in reals) begin by constructing an explicit one for the integers. – coffeemath Jul 4 '13 at 5:57
I think this article: On permutations containing no long arithmetic progressions would be of interest to you (it happens that it is the second reference in the previously mentioned paper). – dtldarek Jul 4 '13 at 9:12
There seems to be a big difference between the question for $\mathbb{Z}$ versus only $\mathbb{N}$. The chaotic construction I came across following the second link was definitely for $\mathbb{Z}$ (chaotic: no average of two terms lies between them) – coffeemath Jul 4 '13 at 11:22
@dentisDark It seems that you should also add a condition that the range of the sequence $\{a_n\}$ is $\mathbb Z$, because the present formulation is not equivalent to the first and the reformulated question has an easy answer: for any injection $i:\mathbb Z\to\mathbb N$ and each $n\in\mathbb Z$ put $a_n=2^{i(n)}$. – Alex Ravsky Jul 5 '13 at 1:00