Find a stone which is not the lightest oneWhich one is the lightest marble?Using a balance scale the minimum number of times, find the median weight personA balance with three pans, detecting the lightest pan (find the one lighter ball)A balance with three pans, detecting the lightest pan (find the one heavier ball)A balance with three pans, detecting the lightest pan (find the two heavier balls)A balance with three pans, detecting the lightest pan (find the one lighter/heavier ball, for a given number of balls)Find 2 heavy coins among 27 with a 3-pan balanceMinimum number of tries to find the balance!Lots of Gold Stacks and a Balance ScaleFive balls weighing
Is there any pythonic way to find average of specific tuple elements in array?
Crossed out red box fitting tightly around image
Was Dennis Ritchie being too modest in this quote about C and Pascal?
How to not starve gigantic beasts
std::unique_ptr of base class holding reference of derived class does not show warning in gcc compiler while naked pointer shows it. Why?
How can I wire a 9-position switch so that each position turns on one more LED than the one before?
Double-nominative constructions and “von”
`microtype`: Set Minimum Width of a Space
"Whatever a Russian does, they end up making the Kalashnikov gun"? Are there any similar proverbs in English?
What to do with someone that cheated their way through university and a PhD program?
Magical attacks and overcoming damage resistance
Retract an already submitted recommendation letter (written for an undergrad student)
Restricting the options of a lookup field, based on the value of another lookup field?
A faster way to compute the largest prime factor
Apply a different color ramp to subset of categorized symbols in QGIS?
Unknown code in script
Contradiction proof for inequality of P and NP?
What does "function" actually mean in music?
Prove that the countable union of countable sets is also countable
Why must Chinese maps be obfuscated?
All ASCII characters with a given bit count
A Note on N!
I preordered a game on my Xbox while on the home screen of my friend's account. Which of us owns the game?
What makes accurate emulation of old systems a difficult task?
Find a stone which is not the lightest one
Which one is the lightest marble?Using a balance scale the minimum number of times, find the median weight personA balance with three pans, detecting the lightest pan (find the one lighter ball)A balance with three pans, detecting the lightest pan (find the one heavier ball)A balance with three pans, detecting the lightest pan (find the two heavier balls)A balance with three pans, detecting the lightest pan (find the one lighter/heavier ball, for a given number of balls)Find 2 heavy coins among 27 with a 3-pan balanceMinimum number of tries to find the balance!Lots of Gold Stacks and a Balance ScaleFive balls weighing
$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.
weighing
New contributor
$endgroup$
add a comment |
$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.
weighing
New contributor
$endgroup$
$begingroup$
Please give credit to the author of the puzzle.
$endgroup$
– Gilles
55 mins ago
add a comment |
$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.
weighing
New contributor
$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.
weighing
weighing
New contributor
New contributor
edited 56 mins ago
Gilles
3,42531837
3,42531837
New contributor
asked 9 hours ago
podloga123podloga123
411
411
New contributor
New contributor
$begingroup$
Please give credit to the author of the puzzle.
$endgroup$
– Gilles
55 mins ago
add a comment |
$begingroup$
Please give credit to the author of the puzzle.
$endgroup$
– Gilles
55 mins ago
$begingroup$
Please give credit to the author of the puzzle.
$endgroup$
– Gilles
55 mins ago
$begingroup$
Please give credit to the author of the puzzle.
$endgroup$
– Gilles
55 mins ago
add a comment |
2 Answers
2
active
oldest
votes
$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.
$endgroup$
$begingroup$
Doh!! You got in a little before me. :) Nice answer; have an upvote.
$endgroup$
– Brandon_J
8 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
8 hours ago
add a comment |
$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!
$endgroup$
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f83188%2ffind-a-stone-which-is-not-the-lightest-one%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
$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.
$endgroup$
$begingroup$
Doh!! You got in a little before me. :) Nice answer; have an upvote.
$endgroup$
– Brandon_J
8 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
8 hours ago
add a comment |
$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.
$endgroup$
$begingroup$
Doh!! You got in a little before me. :) Nice answer; have an upvote.
$endgroup$
– Brandon_J
8 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
8 hours ago
add a comment |
$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.
$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.
answered 8 hours ago
HermesHermes
4307
4307
$begingroup$
Doh!! You got in a little before me. :) Nice answer; have an upvote.
$endgroup$
– Brandon_J
8 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
8 hours ago
add a comment |
$begingroup$
Doh!! You got in a little before me. :) Nice answer; have an upvote.
$endgroup$
– Brandon_J
8 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
8 hours ago
$begingroup$
Doh!! You got in a little before me. :) Nice answer; have an upvote.
$endgroup$
– Brandon_J
8 hours ago
$begingroup$
Doh!! You got in a little before me. :) Nice answer; have an upvote.
$endgroup$
– Brandon_J
8 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
8 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
8 hours ago
add a comment |
$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!
$endgroup$
add a comment |
$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!
$endgroup$
add a comment |
$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!
$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!
answered 8 hours ago
Brandon_JBrandon_J
3,883447
3,883447
add a comment |
add a comment |
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.
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f83188%2ffind-a-stone-which-is-not-the-lightest-one%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$begingroup$
Please give credit to the author of the puzzle.
$endgroup$
– Gilles
55 mins ago