perplexus.info :: Numbers : Any order will do

Any order will do (Posted on 2005-07-12)

The numbers from 1 to 2n are separated into two lists of n numbers each, A and B; elements are ordered so a₁<a₂<...<a_n and b₁>b₂>...>b_n.

How much is |a₁-b₁|+|a₂-b₂|+...+|a_n-b_n|?

See The Solution Submitted by Federico Kereki

Rating: 3.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

By inspection... no proof !

| Comment 3 of 8 |

By inspection, the result is n^2. No proof, however.

By the way, FK, the name has something to do with "Any dream will do" ?

Posted by pcbouhid on 2005-07-12 17:24:15

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info