Is there a recurrence relation which has no closed formula?What is the term for the mathematical relationship between $mathbbZ_n$ and $mathbbZ$?If $p=4k+3$ then $mathbbZ_p[sqrt-1]$ is a fieldNo closed form for $sum_nin P frac1n^2$Logical explanation why exponentiation operation is not commutative and associativeStrong form of Dirichlet prime number theorem and the 'smallest' large setHow to add numbers represented as prime factorization vectors?Is there an elementary proof that $y^2=8x^4+1$ has no integral solution for $xge2$?Solving a recursive formula $a_0=2, a_n=n+sum_i=2^n-1a_i$ (Thabit numbers)Number Systems - Proof
Why does this image of Jupiter look so strange?
Does wetting a beer glass change the foam characteristics?
Why weren't the Death Star plans transmitted electronically?
what should be done first, handling missing data or dealing with data types?
Difference between types of yeast
What exactly did this mechanic sabotage on the American Airlines 737, and how dangerous was it?
Is there something that can completely prevent the effects of the Hold Person spell?
Tesla coil and Tesla tower
Do we have any particular tonal center in mind when we are NOT listening music?
Subverting the emotional woman and stoic man trope
Can an integer optimization problem be convex?
Late 1970's and 6502 chip facilities for operating systems
Why, even after his imprisonment, people keep calling Hannibal Lecter "Doctor"?
How to deal with a Homophobic PC
Do I have advantage with Riposte when moving away from a flanked enemy and triggering an opportunity attack?
What secular civic space would pioneers build for small frontier towns?
Is the mass of paint relevant in rocket design?
How can an attacker use robots.txt?
Is there any relation/leak between two sections of LM358 op-amp?
Is differentiation as a map discontinuous?
Clear text passwords in Unix
What is the meaning of word 'crack' in chapter 33 of A Game of Thrones?
Reorder a matrix, twice
My manager quit. Should I agree to defer wage increase to accommodate budget concerns?
Is there a recurrence relation which has no closed formula?
What is the term for the mathematical relationship between $mathbbZ_n$ and $mathbbZ$?If $p=4k+3$ then $mathbbZ_p[sqrt-1]$ is a fieldNo closed form for $sum_nin P frac1n^2$Logical explanation why exponentiation operation is not commutative and associativeStrong form of Dirichlet prime number theorem and the 'smallest' large setHow to add numbers represented as prime factorization vectors?Is there an elementary proof that $y^2=8x^4+1$ has no integral solution for $xge2$?Solving a recursive formula $a_0=2, a_n=n+sum_i=2^n-1a_i$ (Thabit numbers)Number Systems - Proof
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
From what I know, it is unknown whether $x_n=x_n-1^2 + 1$ has a closed form. Is there a recurrence relation which is known to have no closed form with a proof of inexistence?
Assuming a closed form is a non recursive description using the elementary operations of addition multiplication and power, or, assuming any other good definition of "closed form".
Edit
There are similar questions out there, but the answers are a little bit going around the question.
So is there one with proof or is it unknown? And if it depends on the definition of a closed form, then what are the (or some) options? How strong can a closed form definition be to still have a recursive relation that can be proved to not being able to have its form?
number-theory elementary-number-theory
asked 9 hours ago
AladinAladin
493 bronze badges
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment
|
$begingroup$
From what I know, it is unknown whether $x_n=x_n-1^2 + 1$ has a closed form. Is there a recurrence relation which is known to have no closed form with a proof of inexistence?
Assuming a closed form is a non recursive description using the elementary operations of addition multiplication and power, or, assuming any other good definition of "closed form".
Edit
There are similar questions out there, but the answers are a little bit going around the question.
So is there one with proof or is it unknown? And if it depends on the definition of a closed form, then what are the (or some) options? How strong can a closed form definition be to still have a recursive relation that can be proved to not being able to have its form?
number-theory elementary-number-theory
asked 9 hours ago
AladinAladin
493 bronze badges
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
2
$begingroup$
This example is a good candidate for an example without a closed form, but I am not aware of a proof either.
$endgroup$
– Peter
9 hours ago
3
$begingroup$
Take a look at cs.stackexchange.com/questions/27598/…
$endgroup$
– John Douma
9 hours ago
$begingroup$
Fix a language for closed forms, each a finite string in a countable alphabet. There are countably many forms, so enumerate them. In the spirit of Richard's paradox, define $a_n$ as the $n$th form's $n$th term $+1$. Clearly, $a_n$ is none of the original forms, but it looks like I've defined it as one. This can be resolved if you know about metalanguages, but the moral is we need to formalise what a closed form is, or at least which notation is legal in it, to properly consider some questions. I wonder whether your question is one of them.
$endgroup$
– J.G.
7 hours ago
$begingroup$
Much of the difficulty here depends on formalizing what a closed form is. I'm not aware of a generally accepted definition. In practice it turns out that closed forms aren't as big a deal as you might think.
$endgroup$
– Qiaochu Yuan
6 hours ago
add a comment
|
$begingroup$
From what I know, it is unknown whether $x_n=x_n-1^2 + 1$ has a closed form. Is there a recurrence relation which is known to have no closed form with a proof of inexistence?
Assuming a closed form is a non recursive description using the elementary operations of addition multiplication and power, or, assuming any other good definition of "closed form".
Edit
There are similar questions out there, but the answers are a little bit going around the question.
So is there one with proof or is it unknown? And if it depends on the definition of a closed form, then what are the (or some) options? How strong can a closed form definition be to still have a recursive relation that can be proved to not being able to have its form?
number-theory elementary-number-theory
asked 9 hours ago
AladinAladin
493 bronze badges
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
From what I know, it is unknown whether $x_n=x_n-1^2 + 1$ has a closed form. Is there a recurrence relation which is known to have no closed form with a proof of inexistence?
Assuming a closed form is a non recursive description using the elementary operations of addition multiplication and power, or, assuming any other good definition of "closed form".
Edit
There are similar questions out there, but the answers are a little bit going around the question.
So is there one with proof or is it unknown? And if it depends on the definition of a closed form, then what are the (or some) options? How strong can a closed form definition be to still have a recursive relation that can be proved to not being able to have its form?
number-theory elementary-number-theory
number-theory elementary-number-theory
asked 9 hours ago
AladinAladin
493 bronze badges
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 hours ago
AladinAladin
493 bronze badges
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 6 hours ago
Aladin
asked 9 hours ago
AladinAladin
493 bronze badges
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 hours ago
AladinAladin
493 bronze badges
asked 9 hours ago
AladinAladin
493 bronze badges
493 bronze badges
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Aladin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
2
$begingroup$
This example is a good candidate for an example without a closed form, but I am not aware of a proof either.
$endgroup$
– Peter
9 hours ago
3
$begingroup$
Take a look at cs.stackexchange.com/questions/27598/…
$endgroup$
– John Douma
9 hours ago
$begingroup$
Fix a language for closed forms, each a finite string in a countable alphabet. There are countably many forms, so enumerate them. In the spirit of Richard's paradox, define $a_n$ as the $n$th form's $n$th term $+1$. Clearly, $a_n$ is none of the original forms, but it looks like I've defined it as one. This can be resolved if you know about metalanguages, but the moral is we need to formalise what a closed form is, or at least which notation is legal in it, to properly consider some questions. I wonder whether your question is one of them.
$endgroup$
– J.G.
7 hours ago
$begingroup$
Much of the difficulty here depends on formalizing what a closed form is. I'm not aware of a generally accepted definition. In practice it turns out that closed forms aren't as big a deal as you might think.
$endgroup$
– Qiaochu Yuan
6 hours ago
add a comment
|
2
$begingroup$
This example is a good candidate for an example without a closed form, but I am not aware of a proof either.
$endgroup$
– Peter
9 hours ago
3
$begingroup$
Take a look at cs.stackexchange.com/questions/27598/…
$endgroup$
– John Douma
9 hours ago
$begingroup$
Fix a language for closed forms, each a finite string in a countable alphabet. There are countably many forms, so enumerate them. In the spirit of Richard's paradox, define $a_n$ as the $n$th form's $n$th term $+1$. Clearly, $a_n$ is none of the original forms, but it looks like I've defined it as one. This can be resolved if you know about metalanguages, but the moral is we need to formalise what a closed form is, or at least which notation is legal in it, to properly consider some questions. I wonder whether your question is one of them.
$endgroup$
– J.G.
7 hours ago
$begingroup$
Much of the difficulty here depends on formalizing what a closed form is. I'm not aware of a generally accepted definition. In practice it turns out that closed forms aren't as big a deal as you might think.
$endgroup$
– Qiaochu Yuan
6 hours ago
2
2
$begingroup$
This example is a good candidate for an example without a closed form, but I am not aware of a proof either.
$endgroup$
– Peter
9 hours ago
$begingroup$
This example is a good candidate for an example without a closed form, but I am not aware of a proof either.
$endgroup$
– Peter
9 hours ago
3
3
$begingroup$
Take a look at cs.stackexchange.com/questions/27598/…
$endgroup$
– John Douma
9 hours ago
$begingroup$
Take a look at cs.stackexchange.com/questions/27598/…
$endgroup$
– John Douma
9 hours ago
$begingroup$
Fix a language for closed forms, each a finite string in a countable alphabet. There are countably many forms, so enumerate them. In the spirit of Richard's paradox, define $a_n$ as the $n$th form's $n$th term $+1$. Clearly, $a_n$ is none of the original forms, but it looks like I've defined it as one. This can be resolved if you know about metalanguages, but the moral is we need to formalise what a closed form is, or at least which notation is legal in it, to properly consider some questions. I wonder whether your question is one of them.
$endgroup$
– J.G.
7 hours ago
$begingroup$
Fix a language for closed forms, each a finite string in a countable alphabet. There are countably many forms, so enumerate them. In the spirit of Richard's paradox, define $a_n$ as the $n$th form's $n$th term $+1$. Clearly, $a_n$ is none of the original forms, but it looks like I've defined it as one. This can be resolved if you know about metalanguages, but the moral is we need to formalise what a closed form is, or at least which notation is legal in it, to properly consider some questions. I wonder whether your question is one of them.
$endgroup$
– J.G.
7 hours ago
$begingroup$
Much of the difficulty here depends on formalizing what a closed form is. I'm not aware of a generally accepted definition. In practice it turns out that closed forms aren't as big a deal as you might think.
$endgroup$
– Qiaochu Yuan
6 hours ago
$begingroup$
Much of the difficulty here depends on formalizing what a closed form is. I'm not aware of a generally accepted definition. In practice it turns out that closed forms aren't as big a deal as you might think.
$endgroup$
– Qiaochu Yuan
6 hours ago
add a comment
|
1 Answer
1
active
oldest
votes
$begingroup$
This may be kind of weak, but in a certain sense, Liouville's theorem guarantees there is no closed formula for $a_0 =0$ and $a_n = a_n-1 + int_n-1^n e^-x^2 textdx$.
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
$endgroup$
$begingroup$
No closed formula with only elementary functions. Certainly a closed formula using erf.
$endgroup$
– marty cohen
7 hours ago
$begingroup$
And that's an important point in many ways. Closed is something like ill definited
$endgroup$
– Cade Reinberger
7 hours ago
add a comment
|
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/4.0/"u003ecc by-sa 4.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
);
);
Aladin is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3364729%2fis-there-a-recurrence-relation-which-has-no-closed-formula%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This may be kind of weak, but in a certain sense, Liouville's theorem guarantees there is no closed formula for $a_0 =0$ and $a_n = a_n-1 + int_n-1^n e^-x^2 textdx$.
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
$endgroup$
$begingroup$
No closed formula with only elementary functions. Certainly a closed formula using erf.
$endgroup$
– marty cohen
7 hours ago
$begingroup$
And that's an important point in many ways. Closed is something like ill definited
$endgroup$
– Cade Reinberger
7 hours ago
add a comment
|
$begingroup$
This may be kind of weak, but in a certain sense, Liouville's theorem guarantees there is no closed formula for $a_0 =0$ and $a_n = a_n-1 + int_n-1^n e^-x^2 textdx$.
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
$endgroup$
$begingroup$
No closed formula with only elementary functions. Certainly a closed formula using erf.
$endgroup$
– marty cohen
7 hours ago
$begingroup$
And that's an important point in many ways. Closed is something like ill definited
$endgroup$
– Cade Reinberger
7 hours ago
add a comment
|
$begingroup$
This may be kind of weak, but in a certain sense, Liouville's theorem guarantees there is no closed formula for $a_0 =0$ and $a_n = a_n-1 + int_n-1^n e^-x^2 textdx$.
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
$endgroup$
This may be kind of weak, but in a certain sense, Liouville's theorem guarantees there is no closed formula for $a_0 =0$ and $a_n = a_n-1 + int_n-1^n e^-x^2 textdx$.
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
answered 9 hours ago
Cade ReinbergerCade Reinberger
1,1273 silver badges11 bronze badges
1,1273 silver badges11 bronze badges
$begingroup$
No closed formula with only elementary functions. Certainly a closed formula using erf.
$endgroup$
– marty cohen
7 hours ago
$begingroup$
And that's an important point in many ways. Closed is something like ill definited
$endgroup$
– Cade Reinberger
7 hours ago
add a comment
|
$begingroup$
No closed formula with only elementary functions. Certainly a closed formula using erf.
$endgroup$
– marty cohen
7 hours ago
$begingroup$
And that's an important point in many ways. Closed is something like ill definited
$endgroup$
– Cade Reinberger
7 hours ago
$begingroup$
No closed formula with only elementary functions. Certainly a closed formula using erf.
$endgroup$
– marty cohen
7 hours ago
$begingroup$
No closed formula with only elementary functions. Certainly a closed formula using erf.
$endgroup$
– marty cohen
7 hours ago
$begingroup$
And that's an important point in many ways. Closed is something like ill definited
$endgroup$
– Cade Reinberger
7 hours ago
$begingroup$
And that's an important point in many ways. Closed is something like ill definited
$endgroup$
– Cade Reinberger
7 hours ago
add a comment
|
Aladin is a new contributor. Be nice, and check out our Code of Conduct.
Aladin is a new contributor. Be nice, and check out our Code of Conduct.
Aladin is a new contributor. Be nice, and check out our Code of Conduct.
Aladin is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3364729%2fis-there-a-recurrence-relation-which-has-no-closed-formula%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
2
$begingroup$
This example is a good candidate for an example without a closed form, but I am not aware of a proof either.
$endgroup$
– Peter
9 hours ago
3
$begingroup$
Take a look at cs.stackexchange.com/questions/27598/…
$endgroup$
– John Douma
9 hours ago
$begingroup$
Fix a language for closed forms, each a finite string in a countable alphabet. There are countably many forms, so enumerate them. In the spirit of Richard's paradox, define $a_n$ as the $n$th form's $n$th term $+1$. Clearly, $a_n$ is none of the original forms, but it looks like I've defined it as one. This can be resolved if you know about metalanguages, but the moral is we need to formalise what a closed form is, or at least which notation is legal in it, to properly consider some questions. I wonder whether your question is one of them.
$endgroup$
– J.G.
7 hours ago
$begingroup$
Much of the difficulty here depends on formalizing what a closed form is. I'm not aware of a generally accepted definition. In practice it turns out that closed forms aren't as big a deal as you might think.
$endgroup$
– Qiaochu Yuan
6 hours ago