The weakest link Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar ManaraTrapped in my CellarFinding the number of ways of crossing a riverThirty genuine and seventy fake coinsEvaporating coins212 weights of 1 gramMinimum number of tries to find the balance!Lots of Gold Stacks and a Balance Scale30 fake coins out of 99 coins1 Fake Coin among N Amount of coinsWhich is heavier, the heaviest of the light or the lightest of the heavy?

Island of Knights, Knaves and Spies

How do I prove this combinatorial identity

Philosophical question on logisitic regression: why isn't the optimal threshold value trained?

What is it called when you ride around on your front wheel?

Check if a string is entirely made of the same substring

`microtype`: Set Minimum Width of a Space

Was Dennis Ritchie being too modest in this quote about C and Pascal?

Tikz positioning above circle exact alignment

How much cash can I safely carry into the USA and avoid civil forfeiture?

What makes accurate emulation of old systems a difficult task?

How to keep bees out of canned beverages?

Is there really no use for MD5 anymore?

Is there any pythonic way to find average of specific tuple elements in array?

"Whatever a Russian does, they end up making the Kalashnikov gun"? Are there any similar proverbs in English?

How do I reattach a shelf to the wall when it ripped out of the wall?

Could moose/elk survive in the Amazon forest?

Scheduling based problem

Is Electric Central Heating worth it if using Solar Panels?

How exactly does Hawking radiation decrease the mass of black holes?

A strange hotel

Raising a bilingual kid. When should we introduce the majority language?

Has a Nobel Peace laureate ever been accused of war crimes?

My admission is revoked after accepting the admission offer

Co-worker works way more than he should



The weakest link



Unicorn Meta Zoo #1: Why another podcast?
Announcing the arrival of Valued Associate #679: Cesar ManaraTrapped in my CellarFinding the number of ways of crossing a riverThirty genuine and seventy fake coinsEvaporating coins212 weights of 1 gramMinimum number of tries to find the balance!Lots of Gold Stacks and a Balance Scale30 fake coins out of 99 coins1 Fake Coin among N Amount of coinsWhich is heavier, the heaviest of the light or the lightest of the heavy?










5












$begingroup$


I've gotten this riddle and have been struggling with solving it:



Suppose you have 20 stones which have different weights [0 ... n] . You have no way of measuring the weight of any stone individually, instead you can only measure them by putting 10 on each side of a balance. After doing this you see which "group" of stones is heavier. You can do this only 10 times in total. You can also switch the stones from either side to the other as much as you want between the measurements.



Your task is to find a stone for which you can be certain is not the lightest of them all.



All the stones are marked, so you always know which is which. Their appearance or anything similar does not help you with to determine their weight, the only way you can do it is by putting it on the balance.










share|improve this question









New contributor




podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$
















    5












    $begingroup$


    I've gotten this riddle and have been struggling with solving it:



    Suppose you have 20 stones which have different weights [0 ... n] . You have no way of measuring the weight of any stone individually, instead you can only measure them by putting 10 on each side of a balance. After doing this you see which "group" of stones is heavier. You can do this only 10 times in total. You can also switch the stones from either side to the other as much as you want between the measurements.



    Your task is to find a stone for which you can be certain is not the lightest of them all.



    All the stones are marked, so you always know which is which. Their appearance or anything similar does not help you with to determine their weight, the only way you can do it is by putting it on the balance.










    share|improve this question









    New contributor




    podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$














      5












      5








      5





      $begingroup$


      I've gotten this riddle and have been struggling with solving it:



      Suppose you have 20 stones which have different weights [0 ... n] . You have no way of measuring the weight of any stone individually, instead you can only measure them by putting 10 on each side of a balance. After doing this you see which "group" of stones is heavier. You can do this only 10 times in total. You can also switch the stones from either side to the other as much as you want between the measurements.



      Your task is to find a stone for which you can be certain is not the lightest of them all.



      All the stones are marked, so you always know which is which. Their appearance or anything similar does not help you with to determine their weight, the only way you can do it is by putting it on the balance.










      share|improve this question









      New contributor




      podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I've gotten this riddle and have been struggling with solving it:



      Suppose you have 20 stones which have different weights [0 ... n] . You have no way of measuring the weight of any stone individually, instead you can only measure them by putting 10 on each side of a balance. After doing this you see which "group" of stones is heavier. You can do this only 10 times in total. You can also switch the stones from either side to the other as much as you want between the measurements.



      Your task is to find a stone for which you can be certain is not the lightest of them all.



      All the stones are marked, so you always know which is which. Their appearance or anything similar does not help you with to determine their weight, the only way you can do it is by putting it on the balance.







      mathematics






      share|improve this question









      New contributor




      podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question









      New contributor




      podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question








      edited 2 hours ago









      Brandon_J

      3,863447




      3,863447






      New contributor




      podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 3 hours ago









      podloga123podloga123

      261




      261




      New contributor




      podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      podloga123 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.




















          2 Answers
          2






          active

          oldest

          votes


















          5












          $begingroup$


          Measure 10 and 10.

          In each subsequent weighing you change one of the originals of one side for one of the originals of the other side.

          At some point, the balance turns around.

          The stone that you have put on the side that has come down is not the lightest, because the other is lighter than that.

          If at the tenth weighing the sides have not been turned around, the only original stone left on the side that is below is not the lightest.







          share|improve this answer









          $endgroup$












          • $begingroup$
            Doh!! You got in a little before me. :) Nice answer; have an upvote.
            $endgroup$
            – Brandon_J
            2 hours ago










          • $begingroup$
            You didn't explicitly mention this, but it is impossible for the two scales to ever be equal with the given set of stones. But this solution would still work even if the weights were such that the scales could be balanced, provided you know that there is at least one stone that has a unique weight.
            $endgroup$
            – Jaap Scherphuis
            2 hours ago


















          1












          $begingroup$

          Here's how to do it:



          Step one:




          make a measurement, and take note of which side is heavier.




          Then,




          Switch two stones. If the scale tips differently than before, then the stone that you switched to the side that tipped is guaranteed to not be the lightest stone.




          If the scale does not tip differently, then




          switch again.




          Eventually, the scale will tip differently. If it does not do so after 10 trials,




          then the remaining stone on the tipped-to side that has not yet been switched is guaranteed to not be the lightest stone.




          and you have your answer!






          share|improve this answer









          $endgroup$













            Your Answer








            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
            );



            );






            podloga123 is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f83188%2fthe-weakest-link%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            5












            $begingroup$


            Measure 10 and 10.

            In each subsequent weighing you change one of the originals of one side for one of the originals of the other side.

            At some point, the balance turns around.

            The stone that you have put on the side that has come down is not the lightest, because the other is lighter than that.

            If at the tenth weighing the sides have not been turned around, the only original stone left on the side that is below is not the lightest.







            share|improve this answer









            $endgroup$












            • $begingroup$
              Doh!! You got in a little before me. :) Nice answer; have an upvote.
              $endgroup$
              – Brandon_J
              2 hours ago










            • $begingroup$
              You didn't explicitly mention this, but it is impossible for the two scales to ever be equal with the given set of stones. But this solution would still work even if the weights were such that the scales could be balanced, provided you know that there is at least one stone that has a unique weight.
              $endgroup$
              – Jaap Scherphuis
              2 hours ago















            5












            $begingroup$


            Measure 10 and 10.

            In each subsequent weighing you change one of the originals of one side for one of the originals of the other side.

            At some point, the balance turns around.

            The stone that you have put on the side that has come down is not the lightest, because the other is lighter than that.

            If at the tenth weighing the sides have not been turned around, the only original stone left on the side that is below is not the lightest.







            share|improve this answer









            $endgroup$












            • $begingroup$
              Doh!! You got in a little before me. :) Nice answer; have an upvote.
              $endgroup$
              – Brandon_J
              2 hours ago










            • $begingroup$
              You didn't explicitly mention this, but it is impossible for the two scales to ever be equal with the given set of stones. But this solution would still work even if the weights were such that the scales could be balanced, provided you know that there is at least one stone that has a unique weight.
              $endgroup$
              – Jaap Scherphuis
              2 hours ago













            5












            5








            5





            $begingroup$


            Measure 10 and 10.

            In each subsequent weighing you change one of the originals of one side for one of the originals of the other side.

            At some point, the balance turns around.

            The stone that you have put on the side that has come down is not the lightest, because the other is lighter than that.

            If at the tenth weighing the sides have not been turned around, the only original stone left on the side that is below is not the lightest.







            share|improve this answer









            $endgroup$




            Measure 10 and 10.

            In each subsequent weighing you change one of the originals of one side for one of the originals of the other side.

            At some point, the balance turns around.

            The stone that you have put on the side that has come down is not the lightest, because the other is lighter than that.

            If at the tenth weighing the sides have not been turned around, the only original stone left on the side that is below is not the lightest.








            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered 2 hours ago









            HermesHermes

            4107




            4107











            • $begingroup$
              Doh!! You got in a little before me. :) Nice answer; have an upvote.
              $endgroup$
              – Brandon_J
              2 hours ago










            • $begingroup$
              You didn't explicitly mention this, but it is impossible for the two scales to ever be equal with the given set of stones. But this solution would still work even if the weights were such that the scales could be balanced, provided you know that there is at least one stone that has a unique weight.
              $endgroup$
              – Jaap Scherphuis
              2 hours ago
















            • $begingroup$
              Doh!! You got in a little before me. :) Nice answer; have an upvote.
              $endgroup$
              – Brandon_J
              2 hours ago










            • $begingroup$
              You didn't explicitly mention this, but it is impossible for the two scales to ever be equal with the given set of stones. But this solution would still work even if the weights were such that the scales could be balanced, provided you know that there is at least one stone that has a unique weight.
              $endgroup$
              – Jaap Scherphuis
              2 hours ago















            $begingroup$
            Doh!! You got in a little before me. :) Nice answer; have an upvote.
            $endgroup$
            – Brandon_J
            2 hours ago




            $begingroup$
            Doh!! You got in a little before me. :) Nice answer; have an upvote.
            $endgroup$
            – Brandon_J
            2 hours ago












            $begingroup$
            You didn't explicitly mention this, but it is impossible for the two scales to ever be equal with the given set of stones. But this solution would still work even if the weights were such that the scales could be balanced, provided you know that there is at least one stone that has a unique weight.
            $endgroup$
            – Jaap Scherphuis
            2 hours ago




            $begingroup$
            You didn't explicitly mention this, but it is impossible for the two scales to ever be equal with the given set of stones. But this solution would still work even if the weights were such that the scales could be balanced, provided you know that there is at least one stone that has a unique weight.
            $endgroup$
            – Jaap Scherphuis
            2 hours ago











            1












            $begingroup$

            Here's how to do it:



            Step one:




            make a measurement, and take note of which side is heavier.




            Then,




            Switch two stones. If the scale tips differently than before, then the stone that you switched to the side that tipped is guaranteed to not be the lightest stone.




            If the scale does not tip differently, then




            switch again.




            Eventually, the scale will tip differently. If it does not do so after 10 trials,




            then the remaining stone on the tipped-to side that has not yet been switched is guaranteed to not be the lightest stone.




            and you have your answer!






            share|improve this answer









            $endgroup$

















              1












              $begingroup$

              Here's how to do it:



              Step one:




              make a measurement, and take note of which side is heavier.




              Then,




              Switch two stones. If the scale tips differently than before, then the stone that you switched to the side that tipped is guaranteed to not be the lightest stone.




              If the scale does not tip differently, then




              switch again.




              Eventually, the scale will tip differently. If it does not do so after 10 trials,




              then the remaining stone on the tipped-to side that has not yet been switched is guaranteed to not be the lightest stone.




              and you have your answer!






              share|improve this answer









              $endgroup$















                1












                1








                1





                $begingroup$

                Here's how to do it:



                Step one:




                make a measurement, and take note of which side is heavier.




                Then,




                Switch two stones. If the scale tips differently than before, then the stone that you switched to the side that tipped is guaranteed to not be the lightest stone.




                If the scale does not tip differently, then




                switch again.




                Eventually, the scale will tip differently. If it does not do so after 10 trials,




                then the remaining stone on the tipped-to side that has not yet been switched is guaranteed to not be the lightest stone.




                and you have your answer!






                share|improve this answer









                $endgroup$



                Here's how to do it:



                Step one:




                make a measurement, and take note of which side is heavier.




                Then,




                Switch two stones. If the scale tips differently than before, then the stone that you switched to the side that tipped is guaranteed to not be the lightest stone.




                If the scale does not tip differently, then




                switch again.




                Eventually, the scale will tip differently. If it does not do so after 10 trials,




                then the remaining stone on the tipped-to side that has not yet been switched is guaranteed to not be the lightest stone.




                and you have your answer!







                share|improve this answer












                share|improve this answer



                share|improve this answer










                answered 2 hours ago









                Brandon_JBrandon_J

                3,863447




                3,863447




















                    podloga123 is a new contributor. Be nice, and check out our Code of Conduct.









                    draft saved

                    draft discarded


















                    podloga123 is a new contributor. Be nice, and check out our Code of Conduct.












                    podloga123 is a new contributor. Be nice, and check out our Code of Conduct.











                    podloga123 is a new contributor. Be nice, and check out our Code of Conduct.














                    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%2f83188%2fthe-weakest-link%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

                    Log på Navigationsmenu

                    Creating second map without labels using QGIS?How to lock map labels for inset map in Print Composer?How to Force the Showing of Labels of a Vector File in QGISQGIS Valmiera, Labels only show for part of polygonsRemoving duplicate point labels in QGISLabeling every feature using QGIS?Show labels for point features outside map canvasAbbreviate Road Labels in QGIS only when requiredExporting map from composer in QGIS - text labels have moved in output?How to make sure labels in qgis turn up in layout map?Writing label expression with ArcMap and If then Statement?

                    Nuuk Indholdsfortegnelse Etyomologi | Historie | Geografi | Transport og infrastruktur | Politik og administration | Uddannelsesinstitutioner | Kultur | Venskabsbyer | Noter | Eksterne henvisninger | Se også | Navigationsmenuwww.sermersooq.gl64°10′N 51°45′V / 64.167°N 51.750°V / 64.167; -51.75064°10′N 51°45′V / 64.167°N 51.750°V / 64.167; -51.750DMI - KlimanormalerSalmonsen, s. 850Grønlands Naturinstitut undersøger rensdyr i Akia og Maniitsoq foråret 2008Grønlands NaturinstitutNy vej til Qinngorput indviet i dagAntallet af biler i Nuuk må begrænsesNy taxacentral mødt med demonstrationKøreplan. Rute 1, 2 og 3SnescootersporNuukNord er for storSkoler i Kommuneqarfik SermersooqAtuarfik Samuel KleinschmidtKangillinguit AtuarfiatNuussuup AtuarfiaNuuk Internationale FriskoleIlinniarfissuaq, Grønlands SeminariumLedelseÅrsberetning for 2008Kunst og arkitekturÅrsberetning for 2008Julie om naturenNuuk KunstmuseumSilamiutGrønlands Nationalmuseum og ArkivStatistisk ÅrbogGrønlands LandsbibliotekStore koncerter på stribeVandhund nummer 1.000.000Kommuneqarfik Sermersooq – MalikForsidenVenskabsbyerLyngby-Taarbæk i GrønlandArctic Business NetworkWinter Cities 2008 i NuukDagligt opdaterede satellitbilleder fra NuukområdetKommuneqarfik Sermersooqs hjemmesideTurist i NuukGrønlands Statistiks databankGrønlands Hjemmestyres valgresultaterrrWorldCat124325457671310-5