Knowing $prod_{i=1}^n (c_1 - a_i) = d_1$ can we determine $prod_{i=1}^n (c_2 - a_i)$?
For known set of real values ${a_i}$ and $c_1$, if we know
$$prod_{i=1}^n (c_1 - a_i) = d_1$$
is there a way to determine
$$prod_{i=1}^n (c_2 - a_i)$$
without having to redo the multiplications?
(Forgot to include additional relevant assumptions):
All $a_i$ are strictly positive, and no $a_i$ is equal to $c_1$ or $c_2$; in fact both ${c_1,c_2}$ are greater than the $max {a_i}$. The product is strictly positive. Thank you.
algebra-precalculus
add a comment |
For known set of real values ${a_i}$ and $c_1$, if we know
$$prod_{i=1}^n (c_1 - a_i) = d_1$$
is there a way to determine
$$prod_{i=1}^n (c_2 - a_i)$$
without having to redo the multiplications?
(Forgot to include additional relevant assumptions):
All $a_i$ are strictly positive, and no $a_i$ is equal to $c_1$ or $c_2$; in fact both ${c_1,c_2}$ are greater than the $max {a_i}$. The product is strictly positive. Thank you.
algebra-precalculus
No: Consider the case that some $a_i$ coincides with $c_1$, giving a zero product. Then if $c_2 notin {a_i}$, the second product is certainly unrelated to $d_1$.
– T. Bongers
Dec 9 at 0:30
Ah, yes; I should have clarified; which I'll edit - no a_i is equal to c1 or c2; in fact both {c1,c2} are greater than the max {a_i}.
– sheppa28
Dec 9 at 0:33
add a comment |
For known set of real values ${a_i}$ and $c_1$, if we know
$$prod_{i=1}^n (c_1 - a_i) = d_1$$
is there a way to determine
$$prod_{i=1}^n (c_2 - a_i)$$
without having to redo the multiplications?
(Forgot to include additional relevant assumptions):
All $a_i$ are strictly positive, and no $a_i$ is equal to $c_1$ or $c_2$; in fact both ${c_1,c_2}$ are greater than the $max {a_i}$. The product is strictly positive. Thank you.
algebra-precalculus
For known set of real values ${a_i}$ and $c_1$, if we know
$$prod_{i=1}^n (c_1 - a_i) = d_1$$
is there a way to determine
$$prod_{i=1}^n (c_2 - a_i)$$
without having to redo the multiplications?
(Forgot to include additional relevant assumptions):
All $a_i$ are strictly positive, and no $a_i$ is equal to $c_1$ or $c_2$; in fact both ${c_1,c_2}$ are greater than the $max {a_i}$. The product is strictly positive. Thank you.
algebra-precalculus
algebra-precalculus
edited Dec 9 at 0:35
asked Dec 9 at 0:29
sheppa28
318110
318110
No: Consider the case that some $a_i$ coincides with $c_1$, giving a zero product. Then if $c_2 notin {a_i}$, the second product is certainly unrelated to $d_1$.
– T. Bongers
Dec 9 at 0:30
Ah, yes; I should have clarified; which I'll edit - no a_i is equal to c1 or c2; in fact both {c1,c2} are greater than the max {a_i}.
– sheppa28
Dec 9 at 0:33
add a comment |
No: Consider the case that some $a_i$ coincides with $c_1$, giving a zero product. Then if $c_2 notin {a_i}$, the second product is certainly unrelated to $d_1$.
– T. Bongers
Dec 9 at 0:30
Ah, yes; I should have clarified; which I'll edit - no a_i is equal to c1 or c2; in fact both {c1,c2} are greater than the max {a_i}.
– sheppa28
Dec 9 at 0:33
No: Consider the case that some $a_i$ coincides with $c_1$, giving a zero product. Then if $c_2 notin {a_i}$, the second product is certainly unrelated to $d_1$.
– T. Bongers
Dec 9 at 0:30
No: Consider the case that some $a_i$ coincides with $c_1$, giving a zero product. Then if $c_2 notin {a_i}$, the second product is certainly unrelated to $d_1$.
– T. Bongers
Dec 9 at 0:30
Ah, yes; I should have clarified; which I'll edit - no a_i is equal to c1 or c2; in fact both {c1,c2} are greater than the max {a_i}.
– sheppa28
Dec 9 at 0:33
Ah, yes; I should have clarified; which I'll edit - no a_i is equal to c1 or c2; in fact both {c1,c2} are greater than the max {a_i}.
– sheppa28
Dec 9 at 0:33
add a comment |
2 Answers
2
active
oldest
votes
Unless $n=1$, this is not possible in general. Let $P(x) = (x-a_1)(x-a_2)...(x-a_n)$, then you are asking is if there easy way to find $P(c_2)$, knowing only $P(c_1).$ Normally, you would compute the coefficients of $P(x)$ and then plug $c_2$ in to find $P(c_2).$ This is much worse than calculating $prod_{i=1}^n(c_2-a_i)$ by $n-1$ multiplication. So I'd say multiplying out is actually the easiest way to compute $P(c_2),$ since you say you know the roots $a_i.$
It seems like you want to do "better" than performing $n-1$ multiplication and I highly doubt this can be done.
I don't think polynomial interpolation is relevant. Interpolating a polynomial with a polynomial is not very useful, and here $P$ is explicit. Meanwhile, you do have the values at $n+1$ points, namely $c_1$ and $a_1,ldots,a_n$.
– Martin Argerami
Dec 9 at 1:11
@MartinArgerami you are right, I overlooked that.
– dezdichado
Dec 9 at 1:21
add a comment |
Here is a way to rephrase your question: given a monic polynomial $p$ of degree $n$ with roots $a_1,ldots,a_n$, and such that $p(c_1)=d_1$, find $p(c_2)$.
Of course this can always be done, as you can recover the coefficients for $p$ from the symmetric polynomials. Namely, you have
$$
p(x)=sum_{k=0}^n (-1)^{n}e_n(a_1,ldots,a_n),x^{n-k}.
$$
Other than that, I don't think you can expect any kind of general answer. Consider for instance the case where $a_1=ldots=a_n=0$. Then you are asking something like
If I now that $pi^n=d_1$, find $e^n$.
Which can be answer, but not in a "polynomial" way.
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%2f3031856%2fknowing-prod-i-1n-c-1-a-i-d-1-can-we-determine-prod-i-1n-c-2%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
Unless $n=1$, this is not possible in general. Let $P(x) = (x-a_1)(x-a_2)...(x-a_n)$, then you are asking is if there easy way to find $P(c_2)$, knowing only $P(c_1).$ Normally, you would compute the coefficients of $P(x)$ and then plug $c_2$ in to find $P(c_2).$ This is much worse than calculating $prod_{i=1}^n(c_2-a_i)$ by $n-1$ multiplication. So I'd say multiplying out is actually the easiest way to compute $P(c_2),$ since you say you know the roots $a_i.$
It seems like you want to do "better" than performing $n-1$ multiplication and I highly doubt this can be done.
I don't think polynomial interpolation is relevant. Interpolating a polynomial with a polynomial is not very useful, and here $P$ is explicit. Meanwhile, you do have the values at $n+1$ points, namely $c_1$ and $a_1,ldots,a_n$.
– Martin Argerami
Dec 9 at 1:11
@MartinArgerami you are right, I overlooked that.
– dezdichado
Dec 9 at 1:21
add a comment |
Unless $n=1$, this is not possible in general. Let $P(x) = (x-a_1)(x-a_2)...(x-a_n)$, then you are asking is if there easy way to find $P(c_2)$, knowing only $P(c_1).$ Normally, you would compute the coefficients of $P(x)$ and then plug $c_2$ in to find $P(c_2).$ This is much worse than calculating $prod_{i=1}^n(c_2-a_i)$ by $n-1$ multiplication. So I'd say multiplying out is actually the easiest way to compute $P(c_2),$ since you say you know the roots $a_i.$
It seems like you want to do "better" than performing $n-1$ multiplication and I highly doubt this can be done.
I don't think polynomial interpolation is relevant. Interpolating a polynomial with a polynomial is not very useful, and here $P$ is explicit. Meanwhile, you do have the values at $n+1$ points, namely $c_1$ and $a_1,ldots,a_n$.
– Martin Argerami
Dec 9 at 1:11
@MartinArgerami you are right, I overlooked that.
– dezdichado
Dec 9 at 1:21
add a comment |
Unless $n=1$, this is not possible in general. Let $P(x) = (x-a_1)(x-a_2)...(x-a_n)$, then you are asking is if there easy way to find $P(c_2)$, knowing only $P(c_1).$ Normally, you would compute the coefficients of $P(x)$ and then plug $c_2$ in to find $P(c_2).$ This is much worse than calculating $prod_{i=1}^n(c_2-a_i)$ by $n-1$ multiplication. So I'd say multiplying out is actually the easiest way to compute $P(c_2),$ since you say you know the roots $a_i.$
It seems like you want to do "better" than performing $n-1$ multiplication and I highly doubt this can be done.
Unless $n=1$, this is not possible in general. Let $P(x) = (x-a_1)(x-a_2)...(x-a_n)$, then you are asking is if there easy way to find $P(c_2)$, knowing only $P(c_1).$ Normally, you would compute the coefficients of $P(x)$ and then plug $c_2$ in to find $P(c_2).$ This is much worse than calculating $prod_{i=1}^n(c_2-a_i)$ by $n-1$ multiplication. So I'd say multiplying out is actually the easiest way to compute $P(c_2),$ since you say you know the roots $a_i.$
It seems like you want to do "better" than performing $n-1$ multiplication and I highly doubt this can be done.
edited Dec 9 at 1:22
answered Dec 9 at 1:07
dezdichado
6,1781929
6,1781929
I don't think polynomial interpolation is relevant. Interpolating a polynomial with a polynomial is not very useful, and here $P$ is explicit. Meanwhile, you do have the values at $n+1$ points, namely $c_1$ and $a_1,ldots,a_n$.
– Martin Argerami
Dec 9 at 1:11
@MartinArgerami you are right, I overlooked that.
– dezdichado
Dec 9 at 1:21
add a comment |
I don't think polynomial interpolation is relevant. Interpolating a polynomial with a polynomial is not very useful, and here $P$ is explicit. Meanwhile, you do have the values at $n+1$ points, namely $c_1$ and $a_1,ldots,a_n$.
– Martin Argerami
Dec 9 at 1:11
@MartinArgerami you are right, I overlooked that.
– dezdichado
Dec 9 at 1:21
I don't think polynomial interpolation is relevant. Interpolating a polynomial with a polynomial is not very useful, and here $P$ is explicit. Meanwhile, you do have the values at $n+1$ points, namely $c_1$ and $a_1,ldots,a_n$.
– Martin Argerami
Dec 9 at 1:11
I don't think polynomial interpolation is relevant. Interpolating a polynomial with a polynomial is not very useful, and here $P$ is explicit. Meanwhile, you do have the values at $n+1$ points, namely $c_1$ and $a_1,ldots,a_n$.
– Martin Argerami
Dec 9 at 1:11
@MartinArgerami you are right, I overlooked that.
– dezdichado
Dec 9 at 1:21
@MartinArgerami you are right, I overlooked that.
– dezdichado
Dec 9 at 1:21
add a comment |
Here is a way to rephrase your question: given a monic polynomial $p$ of degree $n$ with roots $a_1,ldots,a_n$, and such that $p(c_1)=d_1$, find $p(c_2)$.
Of course this can always be done, as you can recover the coefficients for $p$ from the symmetric polynomials. Namely, you have
$$
p(x)=sum_{k=0}^n (-1)^{n}e_n(a_1,ldots,a_n),x^{n-k}.
$$
Other than that, I don't think you can expect any kind of general answer. Consider for instance the case where $a_1=ldots=a_n=0$. Then you are asking something like
If I now that $pi^n=d_1$, find $e^n$.
Which can be answer, but not in a "polynomial" way.
add a comment |
Here is a way to rephrase your question: given a monic polynomial $p$ of degree $n$ with roots $a_1,ldots,a_n$, and such that $p(c_1)=d_1$, find $p(c_2)$.
Of course this can always be done, as you can recover the coefficients for $p$ from the symmetric polynomials. Namely, you have
$$
p(x)=sum_{k=0}^n (-1)^{n}e_n(a_1,ldots,a_n),x^{n-k}.
$$
Other than that, I don't think you can expect any kind of general answer. Consider for instance the case where $a_1=ldots=a_n=0$. Then you are asking something like
If I now that $pi^n=d_1$, find $e^n$.
Which can be answer, but not in a "polynomial" way.
add a comment |
Here is a way to rephrase your question: given a monic polynomial $p$ of degree $n$ with roots $a_1,ldots,a_n$, and such that $p(c_1)=d_1$, find $p(c_2)$.
Of course this can always be done, as you can recover the coefficients for $p$ from the symmetric polynomials. Namely, you have
$$
p(x)=sum_{k=0}^n (-1)^{n}e_n(a_1,ldots,a_n),x^{n-k}.
$$
Other than that, I don't think you can expect any kind of general answer. Consider for instance the case where $a_1=ldots=a_n=0$. Then you are asking something like
If I now that $pi^n=d_1$, find $e^n$.
Which can be answer, but not in a "polynomial" way.
Here is a way to rephrase your question: given a monic polynomial $p$ of degree $n$ with roots $a_1,ldots,a_n$, and such that $p(c_1)=d_1$, find $p(c_2)$.
Of course this can always be done, as you can recover the coefficients for $p$ from the symmetric polynomials. Namely, you have
$$
p(x)=sum_{k=0}^n (-1)^{n}e_n(a_1,ldots,a_n),x^{n-k}.
$$
Other than that, I don't think you can expect any kind of general answer. Consider for instance the case where $a_1=ldots=a_n=0$. Then you are asking something like
If I now that $pi^n=d_1$, find $e^n$.
Which can be answer, but not in a "polynomial" way.
edited Dec 9 at 1:13
answered Dec 9 at 1:07
Martin Argerami
124k1176174
124k1176174
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.
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%2f3031856%2fknowing-prod-i-1n-c-1-a-i-d-1-can-we-determine-prod-i-1n-c-2%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
No: Consider the case that some $a_i$ coincides with $c_1$, giving a zero product. Then if $c_2 notin {a_i}$, the second product is certainly unrelated to $d_1$.
– T. Bongers
Dec 9 at 0:30
Ah, yes; I should have clarified; which I'll edit - no a_i is equal to c1 or c2; in fact both {c1,c2} are greater than the max {a_i}.
– sheppa28
Dec 9 at 0:33