All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Choosing the right number (Posted on 2018-02-13) Difficulty: 2 of 5
From a set of 2n+1 consecutive integers a certain number, say x, is selected in a way that the remaining n pairs can be arranged as couples having the same sum.

What are all the possible values of x making such task doable?

See The Solution Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Not feeling literal | Comment 3 of 6 |
(In reply to Not feeling literal by Steve Herman)

I red the puzzle literally. As 2n+1 is always odd, removing one leave always n pairs of numbers. 

But only if the term been remove is the first, or that in the middle or the last, you have pairs that can be arranged having the same sum. 

That's why I post before:
1, n+1, 2n+1

Edited on February 14, 2018, 2:20 am
  Posted by armando on 2018-02-14 02:15:09

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (5)
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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information