Prove that it will always be possible to find such two weights so the weight difference between them wouldn't...
$begingroup$
You have 40 weights. It is known that the difference of weight in every 2 weights is no bigger than 45 kg. Also, it is known that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg. You have to prove that it will always be possible to find such two weights so the weight difference between them wouldn't be bigger than 1 kg.
What I got is that our all weights must be between (and including) $n$ kg and $n+45$ kg. But I'm not sure should I use the fact, that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg.
Any hint would be very appreciated.
proof-writing
$endgroup$
add a comment |
$begingroup$
You have 40 weights. It is known that the difference of weight in every 2 weights is no bigger than 45 kg. Also, it is known that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg. You have to prove that it will always be possible to find such two weights so the weight difference between them wouldn't be bigger than 1 kg.
What I got is that our all weights must be between (and including) $n$ kg and $n+45$ kg. But I'm not sure should I use the fact, that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg.
Any hint would be very appreciated.
proof-writing
$endgroup$
$begingroup$
Do the weights take integral values only?
$endgroup$
– Sameer Baheti
Dec 16 '18 at 17:05
$begingroup$
Not necessarily.
$endgroup$
– thomas21
Dec 16 '18 at 18:03
add a comment |
$begingroup$
You have 40 weights. It is known that the difference of weight in every 2 weights is no bigger than 45 kg. Also, it is known that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg. You have to prove that it will always be possible to find such two weights so the weight difference between them wouldn't be bigger than 1 kg.
What I got is that our all weights must be between (and including) $n$ kg and $n+45$ kg. But I'm not sure should I use the fact, that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg.
Any hint would be very appreciated.
proof-writing
$endgroup$
You have 40 weights. It is known that the difference of weight in every 2 weights is no bigger than 45 kg. Also, it is known that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg. You have to prove that it will always be possible to find such two weights so the weight difference between them wouldn't be bigger than 1 kg.
What I got is that our all weights must be between (and including) $n$ kg and $n+45$ kg. But I'm not sure should I use the fact, that you can divide every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg.
Any hint would be very appreciated.
proof-writing
proof-writing
asked Dec 16 '18 at 16:34
thomas21thomas21
159112
159112
$begingroup$
Do the weights take integral values only?
$endgroup$
– Sameer Baheti
Dec 16 '18 at 17:05
$begingroup$
Not necessarily.
$endgroup$
– thomas21
Dec 16 '18 at 18:03
add a comment |
$begingroup$
Do the weights take integral values only?
$endgroup$
– Sameer Baheti
Dec 16 '18 at 17:05
$begingroup$
Not necessarily.
$endgroup$
– thomas21
Dec 16 '18 at 18:03
$begingroup$
Do the weights take integral values only?
$endgroup$
– Sameer Baheti
Dec 16 '18 at 17:05
$begingroup$
Do the weights take integral values only?
$endgroup$
– Sameer Baheti
Dec 16 '18 at 17:05
$begingroup$
Not necessarily.
$endgroup$
– thomas21
Dec 16 '18 at 18:03
$begingroup$
Not necessarily.
$endgroup$
– thomas21
Dec 16 '18 at 18:03
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Just an idea...see if it can be made to work.
Proof by contradiction: for any two weights $w_i, w_j, |w_i-w_j|>1$. Put them all in ascending order. Without loss of generality, we can probably start with $epsilon >0$ as the smallest weight. Then take the lightest 5 weights and the heaviest 5 weights - can they still be partitioned so that the weight difference is less than 11? That would be a contradiction to "every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg."
$endgroup$
$begingroup$
solved it, thank you very much
$endgroup$
– thomas21
Dec 18 '18 at 16:15
add a comment |
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
});
}
});
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%2fmath.stackexchange.com%2fquestions%2f3042809%2fprove-that-it-will-always-be-possible-to-find-such-two-weights-so-the-weight-dif%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
$begingroup$
Just an idea...see if it can be made to work.
Proof by contradiction: for any two weights $w_i, w_j, |w_i-w_j|>1$. Put them all in ascending order. Without loss of generality, we can probably start with $epsilon >0$ as the smallest weight. Then take the lightest 5 weights and the heaviest 5 weights - can they still be partitioned so that the weight difference is less than 11? That would be a contradiction to "every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg."
$endgroup$
$begingroup$
solved it, thank you very much
$endgroup$
– thomas21
Dec 18 '18 at 16:15
add a comment |
$begingroup$
Just an idea...see if it can be made to work.
Proof by contradiction: for any two weights $w_i, w_j, |w_i-w_j|>1$. Put them all in ascending order. Without loss of generality, we can probably start with $epsilon >0$ as the smallest weight. Then take the lightest 5 weights and the heaviest 5 weights - can they still be partitioned so that the weight difference is less than 11? That would be a contradiction to "every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg."
$endgroup$
$begingroup$
solved it, thank you very much
$endgroup$
– thomas21
Dec 18 '18 at 16:15
add a comment |
$begingroup$
Just an idea...see if it can be made to work.
Proof by contradiction: for any two weights $w_i, w_j, |w_i-w_j|>1$. Put them all in ascending order. Without loss of generality, we can probably start with $epsilon >0$ as the smallest weight. Then take the lightest 5 weights and the heaviest 5 weights - can they still be partitioned so that the weight difference is less than 11? That would be a contradiction to "every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg."
$endgroup$
Just an idea...see if it can be made to work.
Proof by contradiction: for any two weights $w_i, w_j, |w_i-w_j|>1$. Put them all in ascending order. Without loss of generality, we can probably start with $epsilon >0$ as the smallest weight. Then take the lightest 5 weights and the heaviest 5 weights - can they still be partitioned so that the weight difference is less than 11? That would be a contradiction to "every single group of 10 weights into 2 groups (5 weights in each) and the sum of weights in these 2 groups won't differ by more than 11 kg."
answered Dec 17 '18 at 1:32
MatthiasMatthias
3287
3287
$begingroup$
solved it, thank you very much
$endgroup$
– thomas21
Dec 18 '18 at 16:15
add a comment |
$begingroup$
solved it, thank you very much
$endgroup$
– thomas21
Dec 18 '18 at 16:15
$begingroup$
solved it, thank you very much
$endgroup$
– thomas21
Dec 18 '18 at 16:15
$begingroup$
solved it, thank you very much
$endgroup$
– thomas21
Dec 18 '18 at 16:15
add a comment |
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.
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%2fmath.stackexchange.com%2fquestions%2f3042809%2fprove-that-it-will-always-be-possible-to-find-such-two-weights-so-the-weight-dif%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$
Do the weights take integral values only?
$endgroup$
– Sameer Baheti
Dec 16 '18 at 17:05
$begingroup$
Not necessarily.
$endgroup$
– thomas21
Dec 16 '18 at 18:03