A dark room full of valuable orbs with superpowers : 1 orb inscribed 1, 2 orbs inscribed 2, ... , 50 orbs inscribed 50 on them [orbs inscribed 1 to 50 on them, with orb numbers respectively 1 to 50].
As soon as Jason Langdon entered the room, the lights turned out and the door got close. A genie asked Jason Langdon to pick at least 10 orbs with the same integer inscribed on them.
If he did so, he would get all orbs of that room. If he failed, he'd be stuck in this room forever.
Additionaly, the genie told him that for each orb he picked, he will remain asleep for a day at the middle of nowhere. JL didn't want to lose an extra day of his life, but he didn't wish to get stuck either.
In this dark room where a man can never determine which orb is being picked, what's the least number of orbs JL should pick, to remain safe and to win all those orbs?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This was a problem from BdMO 2008 , where I've imposed a new story.
As we can see, JL cannot pick 10 orbs of 1 to 9 . Let him count his worst luck, say he has picked all orbs from 1 to 9 and 9 orbs of each value from 10 to 50 . JL is now certain that if he picks another orb, the campaign will come successful.
So, the answer is: 2 9 ( 9 + 1 ) + 9 × 4 1 + 1 = 4 1 5 . :D