All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic > Weights and Scales
From Russia with love (Posted on 2012-08-11) Difficulty: 4 of 5
Let n be a fixed integer.
Kostya has a black box, such that if you put in exactly 2n+1 coins of distinct weights, the box will expose the coin of median weight.
The teacher gave Kostya 4n+1 coins of distinct weights and told him which coin has the median weight.

Can Kostya check whether the teacher is right, using the box not more than n+2 times?

Source : Russian Euler contest 2012

Rem: Note that Kostya can't just put 4n+1 coins in the box.
The box accepts exactly 2n+1 coins.
Hint: start with n = 1. .

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: Revised Solution (spoiler)Ady TZIDON2012-08-12 10:30:30
SolutionRevised Solution (spoiler)Steve Herman2012-08-11 19:05:35
SolutionSolutionChris, PhD2012-08-11 11:44:50
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information