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?
 |
All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars |
re(2): Not feeling literal
