Post Reply 
 
Thread Rating:
  • 0 Votes - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
A removing number problem
11-08-2012, 02:15 PM
Post: #1
A removing number problem
source (Vietnam NMO 1990_2)

At least $ n - 1$ numbers are removed from the set $ A = \{1, 2, \ldots, 2n - 1\}$ according to the following rules:

(i) If $ a$ is removed, so is $ 2a$;
(ii) If $ a$ and $ b$ are removed, so is $ a + b$.

Find the way of removing numbers such that the sum of the remaining numbers is maximum possible.
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
A removing number problem - elim - 11-08-2012 02:15 PM
RE: A removing number problem - elim - 11-08-2012, 02:51 PM

Forum Jump:


Contact Us | Software Frontier | Return to Top | Return to Content | Lite (Archive) Mode | RSS Syndication