Let n be a positive integer. Two players, Alice and Bob, are playing the following game:
• Alice chooses n real numbers, not necessarily distinct;
• Alice writes all pairwise sums on a sheet of paper and gives it to Bob (there are n(n-1)/2 such sums, not necessarily distinct);
• Bob wins if he finds correctly the initial n numbers chosen by Alice with only one guess.
Can Bob be sure to win for the following cases?
a) n = 5 b) n = 6 c) n = 8
Justify your answer(s).
[For example, when n = 4, Alice may choose the numbers 1, 5, 7, 9, which have the same pairwise sums as the numbers 2, 4, 6, 10, and hence Bob cannot be sure to win.]
[Junior Balkan MO 2013 Problem 4][Note that the original paper has 4 problems to be done in 4.5 hours]
This space is here to avoid seeing the answers before trying the problem!
If you enjoy using this website then please consider making a donation - every little helps :-)
You can receive these questions directly to your email box or read them in an RSS reader. Subscribe using the links on the right.
Don’t forget to follow Gifted Mathematics on Google+, Facebook or Twitter. You may add your own interesting questions on our Google+ Community and Facebook..
You can also subscribe to our Bookmarks on StumbleUpon and Pinterest. Many resources never make it onto the pages of Gifted Mathematics but are stored in these bookmarking websites to share with you.