Home > Logic > Weights and Scales
| Radioactive Coins (Posted on 2006-10-17) |
 |
You have N coins, 2 of which are radioactive. You have a radioactivity
detector which can test any subset of the coins at a time, and return the
number of radioactive coins in the group (i.e. it returns 0, 1 or 2). You have to find the radioactive coins, using not more than 10 tests. What is the largest N for which this is possible?
|
No Solution Yet
|
Submitted by David Shin
|
|
Rating: 4.5000 (6 votes)
|
|
re(2): Fibonacci Connection.....placed
|
 | Comment 16 of 20 | 
|
(In reply to re: Fibonacci Connection by Brian Smith)
Would you believe:
https://oeis.org/A164509
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
