Home > Combinatorics, IMO, Olympiad, Problem Solving > Permutation with distinct distances

Permutation with distinct distances


For what values of n \geq 1 there exist permutations (x_1,...,x_n) of the set \{1,2,...,n\} such that all the differences |x_k-k| are distinct, for k=1..n.

AMM 1989

Advertisements
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: