Radioactive coins - find the two radioactive coins out of twelve












2














Here is a beautiful problem:




Given twelve coins, exactly two of them is radioactive.
There is a machine. You are able to put some of the coins into the machine, and then the machine tells if the coins contain a radioactive one. It doesn’t tell exactly how many, only if there is at least one. How many tries do you need to find the two radioactive coins.




Of course is it easily possible with 12 or 11 tries. But what is the minimum number of tries needed to find the two radioactive coins? And what if there are $n$ coins, where two of them are radioactive? Then is it possible to find the minimum number of tries?






combinations recreational-mathematics puzzle







share|cite|improve this question
























  • I think the best way is something like binary search. Then number of tries is $ln{n}$.
    – Matt53
    Nov 24 at 23:27






  • 1




    At least $7$ trials are required. There are $66$ possibilities for the two distinguished coins. Since the machine only answers "yes" or "no", we can model the decision process as a binary tree, which must have at least $66$ leaves. If there are $k$ tests, we can have at most $2^k$ leaves, so $kge 7.$ I haven't come up with a way to do it in $7$ tests yet, however.
    – saulspatz
    Nov 24 at 23:33
















2














Here is a beautiful problem:




Given twelve coins, exactly two of them is radioactive.
There is a machine. You are able to put some of the coins into the machine, and then the machine tells if the coins contain a radioactive one. It doesn’t tell exactly how many, only if there is at least one. How many tries do you need to find the two radioactive coins.




Of course is it easily possible with 12 or 11 tries. But what is the minimum number of tries needed to find the two radioactive coins? And what if there are $n$ coins, where two of them are radioactive? Then is it possible to find the minimum number of tries?






combinations recreational-mathematics puzzle







share|cite|improve this question
























  • I think the best way is something like binary search. Then number of tries is $ln{n}$.
    – Matt53
    Nov 24 at 23:27






  • 1




    At least $7$ trials are required. There are $66$ possibilities for the two distinguished coins. Since the machine only answers "yes" or "no", we can model the decision process as a binary tree, which must have at least $66$ leaves. If there are $k$ tests, we can have at most $2^k$ leaves, so $kge 7.$ I haven't come up with a way to do it in $7$ tests yet, however.
    – saulspatz
    Nov 24 at 23:33














2












2








2







Here is a beautiful problem:




Given twelve coins, exactly two of them is radioactive.
There is a machine. You are able to put some of the coins into the machine, and then the machine tells if the coins contain a radioactive one. It doesn’t tell exactly how many, only if there is at least one. How many tries do you need to find the two radioactive coins.




Of course is it easily possible with 12 or 11 tries. But what is the minimum number of tries needed to find the two radioactive coins? And what if there are $n$ coins, where two of them are radioactive? Then is it possible to find the minimum number of tries?






combinations recreational-mathematics puzzle







share|cite|improve this question















Here is a beautiful problem:




Given twelve coins, exactly two of them is radioactive.
There is a machine. You are able to put some of the coins into the machine, and then the machine tells if the coins contain a radioactive one. It doesn’t tell exactly how many, only if there is at least one. How many tries do you need to find the two radioactive coins.




Of course is it easily possible with 12 or 11 tries. But what is the minimum number of tries needed to find the two radioactive coins? And what if there are $n$ coins, where two of them are radioactive? Then is it possible to find the minimum number of tries?






combinations recreational-mathematics puzzle




combinations recreational-mathematics puzzle






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 27 at 1:19









Mike Pierce

11.4k103583




11.4k103583










asked Nov 24 at 22:48









Leo Gardner

49011




49011












  • I think the best way is something like binary search. Then number of tries is $ln{n}$.
    – Matt53
    Nov 24 at 23:27






  • 1




    At least $7$ trials are required. There are $66$ possibilities for the two distinguished coins. Since the machine only answers "yes" or "no", we can model the decision process as a binary tree, which must have at least $66$ leaves. If there are $k$ tests, we can have at most $2^k$ leaves, so $kge 7.$ I haven't come up with a way to do it in $7$ tests yet, however.
    – saulspatz
    Nov 24 at 23:33


















  • I think the best way is something like binary search. Then number of tries is $ln{n}$.
    – Matt53
    Nov 24 at 23:27






  • 1




    At least $7$ trials are required. There are $66$ possibilities for the two distinguished coins. Since the machine only answers "yes" or "no", we can model the decision process as a binary tree, which must have at least $66$ leaves. If there are $k$ tests, we can have at most $2^k$ leaves, so $kge 7.$ I haven't come up with a way to do it in $7$ tests yet, however.
    – saulspatz
    Nov 24 at 23:33
















I think the best way is something like binary search. Then number of tries is $ln{n}$.
– Matt53
Nov 24 at 23:27




I think the best way is something like binary search. Then number of tries is $ln{n}$.
– Matt53
Nov 24 at 23:27




1




1




At least $7$ trials are required. There are $66$ possibilities for the two distinguished coins. Since the machine only answers "yes" or "no", we can model the decision process as a binary tree, which must have at least $66$ leaves. If there are $k$ tests, we can have at most $2^k$ leaves, so $kge 7.$ I haven't come up with a way to do it in $7$ tests yet, however.
– saulspatz
Nov 24 at 23:33




At least $7$ trials are required. There are $66$ possibilities for the two distinguished coins. Since the machine only answers "yes" or "no", we can model the decision process as a binary tree, which must have at least $66$ leaves. If there are $k$ tests, we can have at most $2^k$ leaves, so $kge 7.$ I haven't come up with a way to do it in $7$ tests yet, however.
– saulspatz
Nov 24 at 23:33










1 Answer
1






active

oldest

votes


















5














Here is a way to find the coins in no more than 7 tests.



Number the coins 1 through 12. Then test the following 3 groups of coins:



[1,2,3,4], [5,6,7,8], [9,10,11,12]



That takes at most 3 tests. Then consider two cases.




  • Case 1: If only of those groups, say [1,2,3,4], tests positive then it contains both radioactive coins, In that case test three of its coins, say 1, 2, and 3. If two of those coins test positive then we are done. If only one tests positive, the other one is 4. This requires three additional tests, so 3 + 3 = 6 tests total.


  • Case 2: If two of the original groups test positive, say [1,2,3,4] and [6,7,8,9], then we know one of the coins is in one of the groups and the other one is in the other one. Then perform binary search on each of them. That takes 2 additional tests per group, so a total of 4 tests, plus the original 3 tests = 7 tests.



As saulspatz noted, there are 66 possibilities and the process work like a binary decision tree with at most $2^k$ leaves, so $kgeq 7$. Hence the process shown above is optimal.






share|cite|improve this answer





















  • Is this similar to the “12 balls with 2 heavier/lighter” puzzle?
    – user107224
    Nov 25 at 14:14










  • @user107224 - depends on your definition of "similar", but a major difference is that a scale/balance has 3 outcomes: left side heavier, right side heavier, equal. so the detailed math bounds & algorithms are different. however, certainly the same kind of thinking goes into solving both.
    – antkam
    Dec 12 at 16:43











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3012195%2fradioactive-coins-find-the-two-radioactive-coins-out-of-twelve%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









5














Here is a way to find the coins in no more than 7 tests.



Number the coins 1 through 12. Then test the following 3 groups of coins:



[1,2,3,4], [5,6,7,8], [9,10,11,12]



That takes at most 3 tests. Then consider two cases.




  • Case 1: If only of those groups, say [1,2,3,4], tests positive then it contains both radioactive coins, In that case test three of its coins, say 1, 2, and 3. If two of those coins test positive then we are done. If only one tests positive, the other one is 4. This requires three additional tests, so 3 + 3 = 6 tests total.


  • Case 2: If two of the original groups test positive, say [1,2,3,4] and [6,7,8,9], then we know one of the coins is in one of the groups and the other one is in the other one. Then perform binary search on each of them. That takes 2 additional tests per group, so a total of 4 tests, plus the original 3 tests = 7 tests.



As saulspatz noted, there are 66 possibilities and the process work like a binary decision tree with at most $2^k$ leaves, so $kgeq 7$. Hence the process shown above is optimal.






share|cite|improve this answer





















  • Is this similar to the “12 balls with 2 heavier/lighter” puzzle?
    – user107224
    Nov 25 at 14:14










  • @user107224 - depends on your definition of "similar", but a major difference is that a scale/balance has 3 outcomes: left side heavier, right side heavier, equal. so the detailed math bounds & algorithms are different. however, certainly the same kind of thinking goes into solving both.
    – antkam
    Dec 12 at 16:43
















5














Here is a way to find the coins in no more than 7 tests.



Number the coins 1 through 12. Then test the following 3 groups of coins:



[1,2,3,4], [5,6,7,8], [9,10,11,12]



That takes at most 3 tests. Then consider two cases.




  • Case 1: If only of those groups, say [1,2,3,4], tests positive then it contains both radioactive coins, In that case test three of its coins, say 1, 2, and 3. If two of those coins test positive then we are done. If only one tests positive, the other one is 4. This requires three additional tests, so 3 + 3 = 6 tests total.


  • Case 2: If two of the original groups test positive, say [1,2,3,4] and [6,7,8,9], then we know one of the coins is in one of the groups and the other one is in the other one. Then perform binary search on each of them. That takes 2 additional tests per group, so a total of 4 tests, plus the original 3 tests = 7 tests.



As saulspatz noted, there are 66 possibilities and the process work like a binary decision tree with at most $2^k$ leaves, so $kgeq 7$. Hence the process shown above is optimal.






share|cite|improve this answer





















  • Is this similar to the “12 balls with 2 heavier/lighter” puzzle?
    – user107224
    Nov 25 at 14:14










  • @user107224 - depends on your definition of "similar", but a major difference is that a scale/balance has 3 outcomes: left side heavier, right side heavier, equal. so the detailed math bounds & algorithms are different. however, certainly the same kind of thinking goes into solving both.
    – antkam
    Dec 12 at 16:43














5












5








5






Here is a way to find the coins in no more than 7 tests.



Number the coins 1 through 12. Then test the following 3 groups of coins:



[1,2,3,4], [5,6,7,8], [9,10,11,12]



That takes at most 3 tests. Then consider two cases.




  • Case 1: If only of those groups, say [1,2,3,4], tests positive then it contains both radioactive coins, In that case test three of its coins, say 1, 2, and 3. If two of those coins test positive then we are done. If only one tests positive, the other one is 4. This requires three additional tests, so 3 + 3 = 6 tests total.


  • Case 2: If two of the original groups test positive, say [1,2,3,4] and [6,7,8,9], then we know one of the coins is in one of the groups and the other one is in the other one. Then perform binary search on each of them. That takes 2 additional tests per group, so a total of 4 tests, plus the original 3 tests = 7 tests.



As saulspatz noted, there are 66 possibilities and the process work like a binary decision tree with at most $2^k$ leaves, so $kgeq 7$. Hence the process shown above is optimal.






share|cite|improve this answer












Here is a way to find the coins in no more than 7 tests.



Number the coins 1 through 12. Then test the following 3 groups of coins:



[1,2,3,4], [5,6,7,8], [9,10,11,12]



That takes at most 3 tests. Then consider two cases.




  • Case 1: If only of those groups, say [1,2,3,4], tests positive then it contains both radioactive coins, In that case test three of its coins, say 1, 2, and 3. If two of those coins test positive then we are done. If only one tests positive, the other one is 4. This requires three additional tests, so 3 + 3 = 6 tests total.


  • Case 2: If two of the original groups test positive, say [1,2,3,4] and [6,7,8,9], then we know one of the coins is in one of the groups and the other one is in the other one. Then perform binary search on each of them. That takes 2 additional tests per group, so a total of 4 tests, plus the original 3 tests = 7 tests.



As saulspatz noted, there are 66 possibilities and the process work like a binary decision tree with at most $2^k$ leaves, so $kgeq 7$. Hence the process shown above is optimal.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 25 at 2:49









mlerma54

1,087138




1,087138












  • Is this similar to the “12 balls with 2 heavier/lighter” puzzle?
    – user107224
    Nov 25 at 14:14










  • @user107224 - depends on your definition of "similar", but a major difference is that a scale/balance has 3 outcomes: left side heavier, right side heavier, equal. so the detailed math bounds & algorithms are different. however, certainly the same kind of thinking goes into solving both.
    – antkam
    Dec 12 at 16:43


















  • Is this similar to the “12 balls with 2 heavier/lighter” puzzle?
    – user107224
    Nov 25 at 14:14










  • @user107224 - depends on your definition of "similar", but a major difference is that a scale/balance has 3 outcomes: left side heavier, right side heavier, equal. so the detailed math bounds & algorithms are different. however, certainly the same kind of thinking goes into solving both.
    – antkam
    Dec 12 at 16:43
















Is this similar to the “12 balls with 2 heavier/lighter” puzzle?
– user107224
Nov 25 at 14:14




Is this similar to the “12 balls with 2 heavier/lighter” puzzle?
– user107224
Nov 25 at 14:14












@user107224 - depends on your definition of "similar", but a major difference is that a scale/balance has 3 outcomes: left side heavier, right side heavier, equal. so the detailed math bounds & algorithms are different. however, certainly the same kind of thinking goes into solving both.
– antkam
Dec 12 at 16:43




@user107224 - depends on your definition of "similar", but a major difference is that a scale/balance has 3 outcomes: left side heavier, right side heavier, equal. so the detailed math bounds & algorithms are different. however, certainly the same kind of thinking goes into solving both.
– antkam
Dec 12 at 16:43


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3012195%2fradioactive-coins-find-the-two-radioactive-coins-out-of-twelve%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Plaza Victoria

Image
Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
Read more

In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

Image
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 2 OneNote has two useful keyboard shortcuts for bulleted and numbered lists, namely Ctrl + . and Ctrl + - . Is there something similar for PowerPoint where the work with lists is also very common? Haven't found anything here: Use keyboard shortcuts in PowerPoint. keyboard-shortcuts microsoft-powerpoint share | improve this question edited Aug 14 '14 at 14:49 Linger 2,826 10 28 40
Read more

How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...

Image
1 0 I want to put 3 images in LateX such as 2 figures are side by side horizotally and 3rd figure below these 2 side by side figures but in middle. I have following code: begin{figure}[H] centering begin{minipage}{.5textwidth} centering includegraphics[width=.50linewidth]{Text/Images/Genelec_8010_AP.jpg} captionof{figure}{Genelec 8010 AP} label{fig:Genelec 8010} end{minipage}% begin{minipage}{.5textwidth} centering includegraphics[width=.69linewidth]{Text/Images/Genelec_8020_CPM.jpg} captionof{figure}{Genelec 8020 CPM} label{fig:Genelec 8020} end{minipage}% end{figure} %%Here is my 3rd picture code begin{figure} centering includegraphics[width=5cm]{Text/Images/Genelec_8030_BPM.jpg} caption{Genelec 8030 BPM} label{fig:Genelec 8030} end{figure} I want to ask ho
Read more