Finding the smallest positive integers such that $sum_{k=1}^{n} a_{k}^{r} = sum_{k=1}^{n} b_{k}^{r}$, for all...
up vote
0
down vote
favorite
So we are trying to find two sets of positive integers $lbrace a_{1},...,a_{n} rbrace$ and $lbrace b_{1},...,b_{n}rbrace$, with nomember of one set in the other, such that $$sum_{k=1}^{n} a_{k} = sum_{k=1}^{n} b_{k}$$$$sum_{k=1}^{n} a_{k}^{2} = sum_{k=1}^{n} b_{k}^{2}$$
$$vdots$$
$$sum_{k=1}^{n} a_{k}^{N} = sum_{k=1}^{n} b_{k}^{N}$$
For some integer $r$. I define 'smallest' in the question title as the solution set with smallest value of $sum_{k=1}^{n} a_{k}$.
For example, for $N=1$ the solution is, $lbrace 3,1rbrace$ and $lbrace 2,2 rbrace$ as there is only one way to sum $2$ and $3$. For $N=2$, I believe the smallest solution is $lbrace 4,4,1rbrace$ and $lbrace 5,2,2 rbrace$. How can I find solutions for higher values of $N$?
number-theory
asked Nov 22 at 11:33
Joshua Farrell
600218
add a comment |
up vote
0
down vote
favorite
So we are trying to find two sets of positive integers $lbrace a_{1},...,a_{n} rbrace$ and $lbrace b_{1},...,b_{n}rbrace$, with nomember of one set in the other, such that $$sum_{k=1}^{n} a_{k} = sum_{k=1}^{n} b_{k}$$$$sum_{k=1}^{n} a_{k}^{2} = sum_{k=1}^{n} b_{k}^{2}$$
$$vdots$$
$$sum_{k=1}^{n} a_{k}^{N} = sum_{k=1}^{n} b_{k}^{N}$$
For some integer $r$. I define 'smallest' in the question title as the solution set with smallest value of $sum_{k=1}^{n} a_{k}$.
For example, for $N=1$ the solution is, $lbrace 3,1rbrace$ and $lbrace 2,2 rbrace$ as there is only one way to sum $2$ and $3$. For $N=2$, I believe the smallest solution is $lbrace 4,4,1rbrace$ and $lbrace 5,2,2 rbrace$. How can I find solutions for higher values of $N$?
number-theory
asked Nov 22 at 11:33
Joshua Farrell
600218
What do you mean by "with member of one set in the other"? Also, do solutions exist for all $N$?
– Servaes
Nov 22 at 12:07
In its full generality, this is a notorious unsolved problem that goes by the name of Tarry-Escott, or multigrades. Those search terms will get you many hits on the net in general and on MathOverflow and math.stackexchange in particular.
– Gerry Myerson
Nov 22 at 12:09
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
So we are trying to find two sets of positive integers $lbrace a_{1},...,a_{n} rbrace$ and $lbrace b_{1},...,b_{n}rbrace$, with nomember of one set in the other, such that $$sum_{k=1}^{n} a_{k} = sum_{k=1}^{n} b_{k}$$$$sum_{k=1}^{n} a_{k}^{2} = sum_{k=1}^{n} b_{k}^{2}$$
$$vdots$$
$$sum_{k=1}^{n} a_{k}^{N} = sum_{k=1}^{n} b_{k}^{N}$$
For some integer $r$. I define 'smallest' in the question title as the solution set with smallest value of $sum_{k=1}^{n} a_{k}$.
For example, for $N=1$ the solution is, $lbrace 3,1rbrace$ and $lbrace 2,2 rbrace$ as there is only one way to sum $2$ and $3$. For $N=2$, I believe the smallest solution is $lbrace 4,4,1rbrace$ and $lbrace 5,2,2 rbrace$. How can I find solutions for higher values of $N$?
number-theory
asked Nov 22 at 11:33
Joshua Farrell
600218
So we are trying to find two sets of positive integers $lbrace a_{1},...,a_{n} rbrace$ and $lbrace b_{1},...,b_{n}rbrace$, with nomember of one set in the other, such that $$sum_{k=1}^{n} a_{k} = sum_{k=1}^{n} b_{k}$$$$sum_{k=1}^{n} a_{k}^{2} = sum_{k=1}^{n} b_{k}^{2}$$
$$vdots$$
$$sum_{k=1}^{n} a_{k}^{N} = sum_{k=1}^{n} b_{k}^{N}$$
For some integer $r$. I define 'smallest' in the question title as the solution set with smallest value of $sum_{k=1}^{n} a_{k}$.
For example, for $N=1$ the solution is, $lbrace 3,1rbrace$ and $lbrace 2,2 rbrace$ as there is only one way to sum $2$ and $3$. For $N=2$, I believe the smallest solution is $lbrace 4,4,1rbrace$ and $lbrace 5,2,2 rbrace$. How can I find solutions for higher values of $N$?
number-theory
number-theory
asked Nov 22 at 11:33
Joshua Farrell
600218
asked Nov 22 at 11:33
Joshua Farrell
600218
edited Nov 22 at 20:22
asked Nov 22 at 11:33
Joshua Farrell
600218
asked Nov 22 at 11:33
Joshua Farrell
600218
asked Nov 22 at 11:33
Joshua Farrell
600218
600218
What do you mean by "with member of one set in the other"? Also, do solutions exist for all $N$?
– Servaes
Nov 22 at 12:07
In its full generality, this is a notorious unsolved problem that goes by the name of Tarry-Escott, or multigrades. Those search terms will get you many hits on the net in general and on MathOverflow and math.stackexchange in particular.
– Gerry Myerson
Nov 22 at 12:09
add a comment |
What do you mean by "with member of one set in the other"? Also, do solutions exist for all $N$?
– Servaes
Nov 22 at 12:07
In its full generality, this is a notorious unsolved problem that goes by the name of Tarry-Escott, or multigrades. Those search terms will get you many hits on the net in general and on MathOverflow and math.stackexchange in particular.
– Gerry Myerson
Nov 22 at 12:09
What do you mean by "with member of one set in the other"? Also, do solutions exist for all $N$?
– Servaes
Nov 22 at 12:07
What do you mean by "with member of one set in the other"? Also, do solutions exist for all $N$?
– Servaes
Nov 22 at 12:07
In its full generality, this is a notorious unsolved problem that goes by the name of Tarry-Escott, or multigrades. Those search terms will get you many hits on the net in general and on MathOverflow and math.stackexchange in particular.
– Gerry Myerson
Nov 22 at 12:09
In its full generality, this is a notorious unsolved problem that goes by the name of Tarry-Escott, or multigrades. Those search terms will get you many hits on the net in general and on MathOverflow and math.stackexchange in particular.
– Gerry Myerson
Nov 22 at 12:09
add a comment |
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: "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',
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%2f3009024%2ffinding-the-smallest-positive-integers-such-that-sum-k-1n-a-kr-su%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3009024%2ffinding-the-smallest-positive-integers-such-that-sum-k-1n-a-kr-su%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
What do you mean by "with member of one set in the other"? Also, do solutions exist for all $N$?
– Servaes
Nov 22 at 12:07
In its full generality, this is a notorious unsolved problem that goes by the name of Tarry-Escott, or multigrades. Those search terms will get you many hits on the net in general and on MathOverflow and math.stackexchange in particular.
– Gerry Myerson
Nov 22 at 12:09