A removing number problem

11082012, 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. 

« Next Oldest  Next Newest »

Messages In This Thread 
A removing number problem  elim  11082012 02:15 PM
RE: A removing number problem  elim  11082012, 02:51 PM
