Nonlinear Recursion Solution Process for $x_{n+1}=Sigma_{i=1}^{n} x_{i}x_{n-i}$ (Known Solution)












0












$begingroup$


I want to solve the equation $x_{n+1}=Sigma_{i=1}^{n} x_{i}x_{n-i}$. Plugging the equation into Mathematica gives me $x_n=(-1)^{n}2^{2n+1} Binomial(1/2, n+1)x_0^{n+1}$. How might I derive this?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    With generating functions?
    $endgroup$
    – Somos
    Jan 18 at 17:52












  • $begingroup$
    @Somos I'm not entirely sure how to use generating functions, but thank you, I will see if I can read about them and understand how to use them.
    $endgroup$
    – BJParks
    Jan 18 at 18:15






  • 2




    $begingroup$
    See Catalan number first proof for an example.
    $endgroup$
    – Somos
    Jan 18 at 18:17












  • $begingroup$
    @Somos Thank you! That's exactly what I'm looking for, and it really helps me learn the process so I can try extending it to other situations. Thanks so much!
    $endgroup$
    – BJParks
    Jan 18 at 18:27
















0












$begingroup$


I want to solve the equation $x_{n+1}=Sigma_{i=1}^{n} x_{i}x_{n-i}$. Plugging the equation into Mathematica gives me $x_n=(-1)^{n}2^{2n+1} Binomial(1/2, n+1)x_0^{n+1}$. How might I derive this?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    With generating functions?
    $endgroup$
    – Somos
    Jan 18 at 17:52












  • $begingroup$
    @Somos I'm not entirely sure how to use generating functions, but thank you, I will see if I can read about them and understand how to use them.
    $endgroup$
    – BJParks
    Jan 18 at 18:15






  • 2




    $begingroup$
    See Catalan number first proof for an example.
    $endgroup$
    – Somos
    Jan 18 at 18:17












  • $begingroup$
    @Somos Thank you! That's exactly what I'm looking for, and it really helps me learn the process so I can try extending it to other situations. Thanks so much!
    $endgroup$
    – BJParks
    Jan 18 at 18:27














0












0








0





$begingroup$


I want to solve the equation $x_{n+1}=Sigma_{i=1}^{n} x_{i}x_{n-i}$. Plugging the equation into Mathematica gives me $x_n=(-1)^{n}2^{2n+1} Binomial(1/2, n+1)x_0^{n+1}$. How might I derive this?










share|cite|improve this question









$endgroup$




I want to solve the equation $x_{n+1}=Sigma_{i=1}^{n} x_{i}x_{n-i}$. Plugging the equation into Mathematica gives me $x_n=(-1)^{n}2^{2n+1} Binomial(1/2, n+1)x_0^{n+1}$. How might I derive this?







recurrence-relations recursion quadratic-forms nonlinear-system






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 18 at 17:23









BJParksBJParks

296




296








  • 1




    $begingroup$
    With generating functions?
    $endgroup$
    – Somos
    Jan 18 at 17:52












  • $begingroup$
    @Somos I'm not entirely sure how to use generating functions, but thank you, I will see if I can read about them and understand how to use them.
    $endgroup$
    – BJParks
    Jan 18 at 18:15






  • 2




    $begingroup$
    See Catalan number first proof for an example.
    $endgroup$
    – Somos
    Jan 18 at 18:17












  • $begingroup$
    @Somos Thank you! That's exactly what I'm looking for, and it really helps me learn the process so I can try extending it to other situations. Thanks so much!
    $endgroup$
    – BJParks
    Jan 18 at 18:27














  • 1




    $begingroup$
    With generating functions?
    $endgroup$
    – Somos
    Jan 18 at 17:52












  • $begingroup$
    @Somos I'm not entirely sure how to use generating functions, but thank you, I will see if I can read about them and understand how to use them.
    $endgroup$
    – BJParks
    Jan 18 at 18:15






  • 2




    $begingroup$
    See Catalan number first proof for an example.
    $endgroup$
    – Somos
    Jan 18 at 18:17












  • $begingroup$
    @Somos Thank you! That's exactly what I'm looking for, and it really helps me learn the process so I can try extending it to other situations. Thanks so much!
    $endgroup$
    – BJParks
    Jan 18 at 18:27








1




1




$begingroup$
With generating functions?
$endgroup$
– Somos
Jan 18 at 17:52






$begingroup$
With generating functions?
$endgroup$
– Somos
Jan 18 at 17:52














$begingroup$
@Somos I'm not entirely sure how to use generating functions, but thank you, I will see if I can read about them and understand how to use them.
$endgroup$
– BJParks
Jan 18 at 18:15




$begingroup$
@Somos I'm not entirely sure how to use generating functions, but thank you, I will see if I can read about them and understand how to use them.
$endgroup$
– BJParks
Jan 18 at 18:15




2




2




$begingroup$
See Catalan number first proof for an example.
$endgroup$
– Somos
Jan 18 at 18:17






$begingroup$
See Catalan number first proof for an example.
$endgroup$
– Somos
Jan 18 at 18:17














$begingroup$
@Somos Thank you! That's exactly what I'm looking for, and it really helps me learn the process so I can try extending it to other situations. Thanks so much!
$endgroup$
– BJParks
Jan 18 at 18:27




$begingroup$
@Somos Thank you! That's exactly what I'm looking for, and it really helps me learn the process so I can try extending it to other situations. Thanks so much!
$endgroup$
– BJParks
Jan 18 at 18:27










0






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


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3078531%2fnonlinear-recursion-solution-process-for-x-n1-sigma-i-1n-x-ix-n-i%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3078531%2fnonlinear-recursion-solution-process-for-x-n1-sigma-i-1n-x-ix-n-i%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

MongoDB - Not Authorized To Execute Command

How to fix TextFormField cause rebuild widget in Flutter

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith