Combinatorial Function Factoring











up vote
2
down vote

favorite
1












Define ${x choose n}=frac{x(x-1)(x-2)...(x-n+1)}{n!}$ for positive integer $n$. For what values of positive integers $n$ and $m$ is $g(x)={{{x+1} choose n} choose {m}}-{{{x} choose n} choose {m}}$ a factor of $f(x)={{{x+1} choose n} choose {m}}$?



I fairly quickly realized that m=n=1 and m=n=2 both worked, and thus perhaps m=n in general will work, though I’m not sure. The quotient upon division must obviously be linear. I suppose we’d have to ensure that all roots of $f$ are also roots of $g$, but I’m not sure about how to do so. Any help would be appreciated
After a bit more thought, I realized it’s equivalent to having consecutive roots differing by one for $f(x)$, but I still don’t know how to proceed from there.










share|cite|improve this question
























  • Tedious CAS computations show that $g(x)$ is not a factor of $f(x)$ for $m=n=3$. Nor is it when $left{m,nright} = left{2,3right}$.
    – darij grinberg
    2 days ago












  • Are you sure $m=n=2$ works? If we set x=9, I get ${{10 choose 2} choose 2} - {{9 choose 2} choose 2} = 360$, while ${{10 choose 2} choose 2} = 990$, which doesn't have 360 as a factor.
    – Todor Markov
    16 hours ago












  • Yes— the quotient is just $frac{x+2}{4}$, which won’t always give an integer for a fixed $x$.
    – Don Jon
    11 hours ago















up vote
2
down vote

favorite
1












Define ${x choose n}=frac{x(x-1)(x-2)...(x-n+1)}{n!}$ for positive integer $n$. For what values of positive integers $n$ and $m$ is $g(x)={{{x+1} choose n} choose {m}}-{{{x} choose n} choose {m}}$ a factor of $f(x)={{{x+1} choose n} choose {m}}$?



I fairly quickly realized that m=n=1 and m=n=2 both worked, and thus perhaps m=n in general will work, though I’m not sure. The quotient upon division must obviously be linear. I suppose we’d have to ensure that all roots of $f$ are also roots of $g$, but I’m not sure about how to do so. Any help would be appreciated
After a bit more thought, I realized it’s equivalent to having consecutive roots differing by one for $f(x)$, but I still don’t know how to proceed from there.










share|cite|improve this question
























  • Tedious CAS computations show that $g(x)$ is not a factor of $f(x)$ for $m=n=3$. Nor is it when $left{m,nright} = left{2,3right}$.
    – darij grinberg
    2 days ago












  • Are you sure $m=n=2$ works? If we set x=9, I get ${{10 choose 2} choose 2} - {{9 choose 2} choose 2} = 360$, while ${{10 choose 2} choose 2} = 990$, which doesn't have 360 as a factor.
    – Todor Markov
    16 hours ago












  • Yes— the quotient is just $frac{x+2}{4}$, which won’t always give an integer for a fixed $x$.
    – Don Jon
    11 hours ago













up vote
2
down vote

favorite
1









up vote
2
down vote

favorite
1






1





Define ${x choose n}=frac{x(x-1)(x-2)...(x-n+1)}{n!}$ for positive integer $n$. For what values of positive integers $n$ and $m$ is $g(x)={{{x+1} choose n} choose {m}}-{{{x} choose n} choose {m}}$ a factor of $f(x)={{{x+1} choose n} choose {m}}$?



I fairly quickly realized that m=n=1 and m=n=2 both worked, and thus perhaps m=n in general will work, though I’m not sure. The quotient upon division must obviously be linear. I suppose we’d have to ensure that all roots of $f$ are also roots of $g$, but I’m not sure about how to do so. Any help would be appreciated
After a bit more thought, I realized it’s equivalent to having consecutive roots differing by one for $f(x)$, but I still don’t know how to proceed from there.










share|cite|improve this question















Define ${x choose n}=frac{x(x-1)(x-2)...(x-n+1)}{n!}$ for positive integer $n$. For what values of positive integers $n$ and $m$ is $g(x)={{{x+1} choose n} choose {m}}-{{{x} choose n} choose {m}}$ a factor of $f(x)={{{x+1} choose n} choose {m}}$?



I fairly quickly realized that m=n=1 and m=n=2 both worked, and thus perhaps m=n in general will work, though I’m not sure. The quotient upon division must obviously be linear. I suppose we’d have to ensure that all roots of $f$ are also roots of $g$, but I’m not sure about how to do so. Any help would be appreciated
After a bit more thought, I realized it’s equivalent to having consecutive roots differing by one for $f(x)$, but I still don’t know how to proceed from there.







combinatorics algebra-precalculus polynomials factoring






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited yesterday

























asked 2 days ago









Don Jon

133




133












  • Tedious CAS computations show that $g(x)$ is not a factor of $f(x)$ for $m=n=3$. Nor is it when $left{m,nright} = left{2,3right}$.
    – darij grinberg
    2 days ago












  • Are you sure $m=n=2$ works? If we set x=9, I get ${{10 choose 2} choose 2} - {{9 choose 2} choose 2} = 360$, while ${{10 choose 2} choose 2} = 990$, which doesn't have 360 as a factor.
    – Todor Markov
    16 hours ago












  • Yes— the quotient is just $frac{x+2}{4}$, which won’t always give an integer for a fixed $x$.
    – Don Jon
    11 hours ago


















  • Tedious CAS computations show that $g(x)$ is not a factor of $f(x)$ for $m=n=3$. Nor is it when $left{m,nright} = left{2,3right}$.
    – darij grinberg
    2 days ago












  • Are you sure $m=n=2$ works? If we set x=9, I get ${{10 choose 2} choose 2} - {{9 choose 2} choose 2} = 360$, while ${{10 choose 2} choose 2} = 990$, which doesn't have 360 as a factor.
    – Todor Markov
    16 hours ago












  • Yes— the quotient is just $frac{x+2}{4}$, which won’t always give an integer for a fixed $x$.
    – Don Jon
    11 hours ago
















Tedious CAS computations show that $g(x)$ is not a factor of $f(x)$ for $m=n=3$. Nor is it when $left{m,nright} = left{2,3right}$.
– darij grinberg
2 days ago






Tedious CAS computations show that $g(x)$ is not a factor of $f(x)$ for $m=n=3$. Nor is it when $left{m,nright} = left{2,3right}$.
– darij grinberg
2 days ago














Are you sure $m=n=2$ works? If we set x=9, I get ${{10 choose 2} choose 2} - {{9 choose 2} choose 2} = 360$, while ${{10 choose 2} choose 2} = 990$, which doesn't have 360 as a factor.
– Todor Markov
16 hours ago






Are you sure $m=n=2$ works? If we set x=9, I get ${{10 choose 2} choose 2} - {{9 choose 2} choose 2} = 360$, while ${{10 choose 2} choose 2} = 990$, which doesn't have 360 as a factor.
– Todor Markov
16 hours ago














Yes— the quotient is just $frac{x+2}{4}$, which won’t always give an integer for a fixed $x$.
– Don Jon
11 hours ago




Yes— the quotient is just $frac{x+2}{4}$, which won’t always give an integer for a fixed $x$.
– Don Jon
11 hours ago















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
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997833%2fcombinatorial-function-factoring%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997833%2fcombinatorial-function-factoring%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Plaza Victoria

Puebla de Zaragoza

Musa