Breaking Balance (Part C-minor: easy version!)












0












$begingroup$


Identical to Breaking Balance (Part C), except with two weighings.




For a starting number of otherwise identical coins there are among them TWO IDENTICAL counterfeit coins which are either heavier or lighter than the rest. Using a three-pan balance (described in detail in the previous question), and two weighings, what is the most number of starting coins (including the counterfeits) you can have while being able to always determine the counterfeits and whether they are both heavier or both lighter?




The previous question comes with a Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... this isn't for everybody. I think the opposite is true here, I think the answer is cute, not trivial, but not too hard.



I request @DarkThunder, OP of the previous question, to delay answering for a while :-)










share|improve this question









$endgroup$

















    0












    $begingroup$


    Identical to Breaking Balance (Part C), except with two weighings.




    For a starting number of otherwise identical coins there are among them TWO IDENTICAL counterfeit coins which are either heavier or lighter than the rest. Using a three-pan balance (described in detail in the previous question), and two weighings, what is the most number of starting coins (including the counterfeits) you can have while being able to always determine the counterfeits and whether they are both heavier or both lighter?




    The previous question comes with a Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... this isn't for everybody. I think the opposite is true here, I think the answer is cute, not trivial, but not too hard.



    I request @DarkThunder, OP of the previous question, to delay answering for a while :-)










    share|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      Identical to Breaking Balance (Part C), except with two weighings.




      For a starting number of otherwise identical coins there are among them TWO IDENTICAL counterfeit coins which are either heavier or lighter than the rest. Using a three-pan balance (described in detail in the previous question), and two weighings, what is the most number of starting coins (including the counterfeits) you can have while being able to always determine the counterfeits and whether they are both heavier or both lighter?




      The previous question comes with a Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... this isn't for everybody. I think the opposite is true here, I think the answer is cute, not trivial, but not too hard.



      I request @DarkThunder, OP of the previous question, to delay answering for a while :-)










      share|improve this question









      $endgroup$




      Identical to Breaking Balance (Part C), except with two weighings.




      For a starting number of otherwise identical coins there are among them TWO IDENTICAL counterfeit coins which are either heavier or lighter than the rest. Using a three-pan balance (described in detail in the previous question), and two weighings, what is the most number of starting coins (including the counterfeits) you can have while being able to always determine the counterfeits and whether they are both heavier or both lighter?




      The previous question comes with a Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... this isn't for everybody. I think the opposite is true here, I think the answer is cute, not trivial, but not too hard.



      I request @DarkThunder, OP of the previous question, to delay answering for a while :-)







      weighing






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 14 mins ago









      deep thoughtdeep thought

      3,2531738




      3,2531738






















          0






          active

          oldest

          votes











          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: "559"
          };
          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: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          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%2fpuzzling.stackexchange.com%2fquestions%2f78890%2fbreaking-balance-part-c-minor-easy-version%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Puzzling 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.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f78890%2fbreaking-balance-part-c-minor-easy-version%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

          Callistus I

          Tabula Rosettana

          How to label and detect the document text images