Sifting polynomials
$begingroup$
Let's say that polynomial $P(x)$ sifts another polynomial $Q(x)$ if three conditions are satisfied:
- $deg P(x) + 1 = deg Q(x) = n$
$Q(x)$ has $n$ distinct real roots, $P(x)$ has $n - 1$ distinct real roots- Roots of $Q(x)$ and $P(x)$ alternate, so if $alpha_1, alpha_2, dots, alpha_n$ are roots of $Q(x)$, $beta_1, beta_2, dots, beta_{n - 1}$ are roots of $P(x)$, then $alpha_1 < beta_1 < alpha_2 < beta_2 < dots < beta_{n - 1} < alpha_n$.
There's a statement that if $P(x)$ sifts $Q(x)$ and $R(x)$ is the remainder of $Q(x)$ divided by $P(x)$, then $R(x)$ sifts $P(x)$, but I failed to come up with an idea to prove it. I tried to build something used factorised forms of polynomials, but it seems to lead nowhere.
real-analysis polynomials
$endgroup$
add a comment |
$begingroup$
Let's say that polynomial $P(x)$ sifts another polynomial $Q(x)$ if three conditions are satisfied:
- $deg P(x) + 1 = deg Q(x) = n$
$Q(x)$ has $n$ distinct real roots, $P(x)$ has $n - 1$ distinct real roots- Roots of $Q(x)$ and $P(x)$ alternate, so if $alpha_1, alpha_2, dots, alpha_n$ are roots of $Q(x)$, $beta_1, beta_2, dots, beta_{n - 1}$ are roots of $P(x)$, then $alpha_1 < beta_1 < alpha_2 < beta_2 < dots < beta_{n - 1} < alpha_n$.
There's a statement that if $P(x)$ sifts $Q(x)$ and $R(x)$ is the remainder of $Q(x)$ divided by $P(x)$, then $R(x)$ sifts $P(x)$, but I failed to come up with an idea to prove it. I tried to build something used factorised forms of polynomials, but it seems to lead nowhere.
real-analysis polynomials
$endgroup$
add a comment |
$begingroup$
Let's say that polynomial $P(x)$ sifts another polynomial $Q(x)$ if three conditions are satisfied:
- $deg P(x) + 1 = deg Q(x) = n$
$Q(x)$ has $n$ distinct real roots, $P(x)$ has $n - 1$ distinct real roots- Roots of $Q(x)$ and $P(x)$ alternate, so if $alpha_1, alpha_2, dots, alpha_n$ are roots of $Q(x)$, $beta_1, beta_2, dots, beta_{n - 1}$ are roots of $P(x)$, then $alpha_1 < beta_1 < alpha_2 < beta_2 < dots < beta_{n - 1} < alpha_n$.
There's a statement that if $P(x)$ sifts $Q(x)$ and $R(x)$ is the remainder of $Q(x)$ divided by $P(x)$, then $R(x)$ sifts $P(x)$, but I failed to come up with an idea to prove it. I tried to build something used factorised forms of polynomials, but it seems to lead nowhere.
real-analysis polynomials
$endgroup$
Let's say that polynomial $P(x)$ sifts another polynomial $Q(x)$ if three conditions are satisfied:
- $deg P(x) + 1 = deg Q(x) = n$
$Q(x)$ has $n$ distinct real roots, $P(x)$ has $n - 1$ distinct real roots- Roots of $Q(x)$ and $P(x)$ alternate, so if $alpha_1, alpha_2, dots, alpha_n$ are roots of $Q(x)$, $beta_1, beta_2, dots, beta_{n - 1}$ are roots of $P(x)$, then $alpha_1 < beta_1 < alpha_2 < beta_2 < dots < beta_{n - 1} < alpha_n$.
There's a statement that if $P(x)$ sifts $Q(x)$ and $R(x)$ is the remainder of $Q(x)$ divided by $P(x)$, then $R(x)$ sifts $P(x)$, but I failed to come up with an idea to prove it. I tried to build something used factorised forms of polynomials, but it seems to lead nowhere.
real-analysis polynomials
real-analysis polynomials
edited Jan 15 at 21:52
Nikrom
asked Jan 15 at 17:09
NikromNikrom
1376
1376
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
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%2f3074654%2fsifting-polynomials%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
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%2f3074654%2fsifting-polynomials%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