Existence of 2006 distinct natural numbers
$begingroup$
Does there exists $2006$ distinct natural numbers such that the sum of any two divides the sum of all the given numbers?
combinatorics elementary-number-theory recreational-mathematics
$endgroup$
add a comment |
$begingroup$
Does there exists $2006$ distinct natural numbers such that the sum of any two divides the sum of all the given numbers?
combinatorics elementary-number-theory recreational-mathematics
$endgroup$
1
$begingroup$
Why $2006{}{}$?
$endgroup$
– Lord Shark the Unknown
Jan 15 at 7:14
$begingroup$
It's from a 2006 contest I guess. But I was told that it works for all $nge 3$.
$endgroup$
– Jerry Tao
Jan 15 at 7:18
2
$begingroup$
Perhaps this might help: cut-the-knot.org/arithmetic/NumbersDivideSums.shtml
$endgroup$
– crskhr
Jan 15 at 7:18
$begingroup$
Has to be a contest problem, indeed. Nevertheless, it is a good one.
$endgroup$
– Aaron
Jan 15 at 15:03
add a comment |
$begingroup$
Does there exists $2006$ distinct natural numbers such that the sum of any two divides the sum of all the given numbers?
combinatorics elementary-number-theory recreational-mathematics
$endgroup$
Does there exists $2006$ distinct natural numbers such that the sum of any two divides the sum of all the given numbers?
combinatorics elementary-number-theory recreational-mathematics
combinatorics elementary-number-theory recreational-mathematics
edited Jan 15 at 7:32
Jerry Tao
asked Jan 15 at 7:11
Jerry TaoJerry Tao
906
906
1
$begingroup$
Why $2006{}{}$?
$endgroup$
– Lord Shark the Unknown
Jan 15 at 7:14
$begingroup$
It's from a 2006 contest I guess. But I was told that it works for all $nge 3$.
$endgroup$
– Jerry Tao
Jan 15 at 7:18
2
$begingroup$
Perhaps this might help: cut-the-knot.org/arithmetic/NumbersDivideSums.shtml
$endgroup$
– crskhr
Jan 15 at 7:18
$begingroup$
Has to be a contest problem, indeed. Nevertheless, it is a good one.
$endgroup$
– Aaron
Jan 15 at 15:03
add a comment |
1
$begingroup$
Why $2006{}{}$?
$endgroup$
– Lord Shark the Unknown
Jan 15 at 7:14
$begingroup$
It's from a 2006 contest I guess. But I was told that it works for all $nge 3$.
$endgroup$
– Jerry Tao
Jan 15 at 7:18
2
$begingroup$
Perhaps this might help: cut-the-knot.org/arithmetic/NumbersDivideSums.shtml
$endgroup$
– crskhr
Jan 15 at 7:18
$begingroup$
Has to be a contest problem, indeed. Nevertheless, it is a good one.
$endgroup$
– Aaron
Jan 15 at 15:03
1
1
$begingroup$
Why $2006{}{}$?
$endgroup$
– Lord Shark the Unknown
Jan 15 at 7:14
$begingroup$
Why $2006{}{}$?
$endgroup$
– Lord Shark the Unknown
Jan 15 at 7:14
$begingroup$
It's from a 2006 contest I guess. But I was told that it works for all $nge 3$.
$endgroup$
– Jerry Tao
Jan 15 at 7:18
$begingroup$
It's from a 2006 contest I guess. But I was told that it works for all $nge 3$.
$endgroup$
– Jerry Tao
Jan 15 at 7:18
2
2
$begingroup$
Perhaps this might help: cut-the-knot.org/arithmetic/NumbersDivideSums.shtml
$endgroup$
– crskhr
Jan 15 at 7:18
$begingroup$
Perhaps this might help: cut-the-knot.org/arithmetic/NumbersDivideSums.shtml
$endgroup$
– crskhr
Jan 15 at 7:18
$begingroup$
Has to be a contest problem, indeed. Nevertheless, it is a good one.
$endgroup$
– Aaron
Jan 15 at 15:03
$begingroup$
Has to be a contest problem, indeed. Nevertheless, it is a good one.
$endgroup$
– Aaron
Jan 15 at 15:03
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The answer is no, and for any $n$, not just $n=2006$.
Suppose $a_1<a_2<cdots<a_n$ be a such numbers, with the desired property. Let $S=sum_{k=1}^n a_k$. Then observe that, $a_n+a_{n-1},a_n+a_{n-2},cdots,a_n+a_1$ all divide $S$, and
$$
frac{S}{a_n+a_1}>frac{S}{a_n+a_2}>cdots>frac{S}{a_n+a_{n-1}} geq 2.
$$
Hence,
$$
frac{S}{a_n+a_1}geq n+1 implies a_1+cdots+a_{n-1}geq na_n+(n+1)a_1,
$$
which is a clear contradiction.
$endgroup$
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%2f3074150%2fexistence-of-2006-distinct-natural-numbers%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$
The answer is no, and for any $n$, not just $n=2006$.
Suppose $a_1<a_2<cdots<a_n$ be a such numbers, with the desired property. Let $S=sum_{k=1}^n a_k$. Then observe that, $a_n+a_{n-1},a_n+a_{n-2},cdots,a_n+a_1$ all divide $S$, and
$$
frac{S}{a_n+a_1}>frac{S}{a_n+a_2}>cdots>frac{S}{a_n+a_{n-1}} geq 2.
$$
Hence,
$$
frac{S}{a_n+a_1}geq n+1 implies a_1+cdots+a_{n-1}geq na_n+(n+1)a_1,
$$
which is a clear contradiction.
$endgroup$
add a comment |
$begingroup$
The answer is no, and for any $n$, not just $n=2006$.
Suppose $a_1<a_2<cdots<a_n$ be a such numbers, with the desired property. Let $S=sum_{k=1}^n a_k$. Then observe that, $a_n+a_{n-1},a_n+a_{n-2},cdots,a_n+a_1$ all divide $S$, and
$$
frac{S}{a_n+a_1}>frac{S}{a_n+a_2}>cdots>frac{S}{a_n+a_{n-1}} geq 2.
$$
Hence,
$$
frac{S}{a_n+a_1}geq n+1 implies a_1+cdots+a_{n-1}geq na_n+(n+1)a_1,
$$
which is a clear contradiction.
$endgroup$
add a comment |
$begingroup$
The answer is no, and for any $n$, not just $n=2006$.
Suppose $a_1<a_2<cdots<a_n$ be a such numbers, with the desired property. Let $S=sum_{k=1}^n a_k$. Then observe that, $a_n+a_{n-1},a_n+a_{n-2},cdots,a_n+a_1$ all divide $S$, and
$$
frac{S}{a_n+a_1}>frac{S}{a_n+a_2}>cdots>frac{S}{a_n+a_{n-1}} geq 2.
$$
Hence,
$$
frac{S}{a_n+a_1}geq n+1 implies a_1+cdots+a_{n-1}geq na_n+(n+1)a_1,
$$
which is a clear contradiction.
$endgroup$
The answer is no, and for any $n$, not just $n=2006$.
Suppose $a_1<a_2<cdots<a_n$ be a such numbers, with the desired property. Let $S=sum_{k=1}^n a_k$. Then observe that, $a_n+a_{n-1},a_n+a_{n-2},cdots,a_n+a_1$ all divide $S$, and
$$
frac{S}{a_n+a_1}>frac{S}{a_n+a_2}>cdots>frac{S}{a_n+a_{n-1}} geq 2.
$$
Hence,
$$
frac{S}{a_n+a_1}geq n+1 implies a_1+cdots+a_{n-1}geq na_n+(n+1)a_1,
$$
which is a clear contradiction.
answered Jan 15 at 14:58
AaronAaron
1,894415
1,894415
add a comment |
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%2f3074150%2fexistence-of-2006-distinct-natural-numbers%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
1
$begingroup$
Why $2006{}{}$?
$endgroup$
– Lord Shark the Unknown
Jan 15 at 7:14
$begingroup$
It's from a 2006 contest I guess. But I was told that it works for all $nge 3$.
$endgroup$
– Jerry Tao
Jan 15 at 7:18
2
$begingroup$
Perhaps this might help: cut-the-knot.org/arithmetic/NumbersDivideSums.shtml
$endgroup$
– crskhr
Jan 15 at 7:18
$begingroup$
Has to be a contest problem, indeed. Nevertheless, it is a good one.
$endgroup$
– Aaron
Jan 15 at 15:03