Breaking Balance (Part C)
$begingroup$
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 below), and three 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?
This should not be confused with the balance detailed in Find 2 heavy coins among 27 with a 3-pan balance as it has a bunch of different rules.
So there isn't confusion, I want to explicitly state how this thing works. It has three equal-length arms supporting three pans (120deg apart), and is balancing on a point. It works like other balances in that the center-of-gravity is below the balance point and thus will tilt to counteract imbalance in the pans.
There are exactly 7 outcomes the balance will give you. The first is the "balanced" outcome, where all pans stay at the same height. The other six are variations on the following:
One "lone" pan will go up or down, and the other two pans will be equal to each other but move opposite the lone pan. Given that there are TWO IDENTICAL counterfeit coins, this may be less informative than you might otherwise hope for. My shorthand for the 7 outcomes is as follows:
- A = B = C
- A > B = C
- A < B = C
- B > A = C
- B < A = C
- C > A = B
- C < A = B
For sake of convention, I consider the coins to be numbered 1 through whatever, and the pans labeled A, B and C. The 4th location, D, is used to denote a coin not being the scale.
Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... and even then it isn't quite a "proof". I really enjoyed going through it, but seriously... this isn't for everybody. And for those that do get it... there's a bunch of much harder variants awaiting you!
weighing physics
New contributor
$endgroup$
add a comment |
$begingroup$
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 below), and three 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?
This should not be confused with the balance detailed in Find 2 heavy coins among 27 with a 3-pan balance as it has a bunch of different rules.
So there isn't confusion, I want to explicitly state how this thing works. It has three equal-length arms supporting three pans (120deg apart), and is balancing on a point. It works like other balances in that the center-of-gravity is below the balance point and thus will tilt to counteract imbalance in the pans.
There are exactly 7 outcomes the balance will give you. The first is the "balanced" outcome, where all pans stay at the same height. The other six are variations on the following:
One "lone" pan will go up or down, and the other two pans will be equal to each other but move opposite the lone pan. Given that there are TWO IDENTICAL counterfeit coins, this may be less informative than you might otherwise hope for. My shorthand for the 7 outcomes is as follows:
- A = B = C
- A > B = C
- A < B = C
- B > A = C
- B < A = C
- C > A = B
- C < A = B
For sake of convention, I consider the coins to be numbered 1 through whatever, and the pans labeled A, B and C. The 4th location, D, is used to denote a coin not being the scale.
Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... and even then it isn't quite a "proof". I really enjoyed going through it, but seriously... this isn't for everybody. And for those that do get it... there's a bunch of much harder variants awaiting you!
weighing physics
New contributor
$endgroup$
add a comment |
$begingroup$
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 below), and three 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?
This should not be confused with the balance detailed in Find 2 heavy coins among 27 with a 3-pan balance as it has a bunch of different rules.
So there isn't confusion, I want to explicitly state how this thing works. It has three equal-length arms supporting three pans (120deg apart), and is balancing on a point. It works like other balances in that the center-of-gravity is below the balance point and thus will tilt to counteract imbalance in the pans.
There are exactly 7 outcomes the balance will give you. The first is the "balanced" outcome, where all pans stay at the same height. The other six are variations on the following:
One "lone" pan will go up or down, and the other two pans will be equal to each other but move opposite the lone pan. Given that there are TWO IDENTICAL counterfeit coins, this may be less informative than you might otherwise hope for. My shorthand for the 7 outcomes is as follows:
- A = B = C
- A > B = C
- A < B = C
- B > A = C
- B < A = C
- C > A = B
- C < A = B
For sake of convention, I consider the coins to be numbered 1 through whatever, and the pans labeled A, B and C. The 4th location, D, is used to denote a coin not being the scale.
Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... and even then it isn't quite a "proof". I really enjoyed going through it, but seriously... this isn't for everybody. And for those that do get it... there's a bunch of much harder variants awaiting you!
weighing physics
New contributor
$endgroup$
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 below), and three 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?
This should not be confused with the balance detailed in Find 2 heavy coins among 27 with a 3-pan balance as it has a bunch of different rules.
So there isn't confusion, I want to explicitly state how this thing works. It has three equal-length arms supporting three pans (120deg apart), and is balancing on a point. It works like other balances in that the center-of-gravity is below the balance point and thus will tilt to counteract imbalance in the pans.
There are exactly 7 outcomes the balance will give you. The first is the "balanced" outcome, where all pans stay at the same height. The other six are variations on the following:
One "lone" pan will go up or down, and the other two pans will be equal to each other but move opposite the lone pan. Given that there are TWO IDENTICAL counterfeit coins, this may be less informative than you might otherwise hope for. My shorthand for the 7 outcomes is as follows:
- A = B = C
- A > B = C
- A < B = C
- B > A = C
- B < A = C
- C > A = B
- C < A = B
For sake of convention, I consider the coins to be numbered 1 through whatever, and the pans labeled A, B and C. The 4th location, D, is used to denote a coin not being the scale.
Warning: I do not believe there is a "cute" solution and it took me weeks to solve it... and even then it isn't quite a "proof". I really enjoyed going through it, but seriously... this isn't for everybody. And for those that do get it... there's a bunch of much harder variants awaiting you!
weighing physics
weighing physics
New contributor
New contributor
New contributor
asked 8 mins ago
Dark ThunderDark Thunder
436
436
New contributor
New contributor
add a comment |
add a comment |
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
});
}
});
Dark Thunder 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%2f78884%2fbreaking-balance-part-c%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
Dark Thunder is a new contributor. Be nice, and check out our Code of Conduct.
Dark Thunder is a new contributor. Be nice, and check out our Code of Conduct.
Dark Thunder is a new contributor. Be nice, and check out our Code of Conduct.
Dark Thunder 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%2f78884%2fbreaking-balance-part-c%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