There is a straight solution for difference equation $f(x+1)=beta(x)f(x)$ such that $beta(1)=a$ and $x>1$?
$begingroup$
Recently, I stock in find a general or special solution of a difference equation $f(x+1)=beta(x)f(x)$ such that $beta(1)=a$ and $x>1$. I do not know much about this group of equations so any name, link, paper,... can helpful to me. I want to know more about this equations.
functions numerical-methods recurrence-relations
$endgroup$
add a comment |
$begingroup$
Recently, I stock in find a general or special solution of a difference equation $f(x+1)=beta(x)f(x)$ such that $beta(1)=a$ and $x>1$. I do not know much about this group of equations so any name, link, paper,... can helpful to me. I want to know more about this equations.
functions numerical-methods recurrence-relations
$endgroup$
$begingroup$
Do you assume anything about the solutions? Because as written, it is easy to construct solution by defining it piecewise on intervals $(n,n+1]$.
$endgroup$
– Wojowu
Jan 15 at 10:24
$begingroup$
You have $f(n)=a f(1)prodlimits_{i=2}^{n-1} beta(i)$
$endgroup$
– Henry
Jan 15 at 10:27
$begingroup$
I need a continuous function solution, so can I interpolate this?
$endgroup$
– Jamal Farokhi
Jan 15 at 10:38
$begingroup$
There are infinitely many such functions. Simply consider $f(x)=cos(2pi x)g(x)$ for example.
$endgroup$
– Simply Beautiful Art
Jan 15 at 14:53
add a comment |
$begingroup$
Recently, I stock in find a general or special solution of a difference equation $f(x+1)=beta(x)f(x)$ such that $beta(1)=a$ and $x>1$. I do not know much about this group of equations so any name, link, paper,... can helpful to me. I want to know more about this equations.
functions numerical-methods recurrence-relations
$endgroup$
Recently, I stock in find a general or special solution of a difference equation $f(x+1)=beta(x)f(x)$ such that $beta(1)=a$ and $x>1$. I do not know much about this group of equations so any name, link, paper,... can helpful to me. I want to know more about this equations.
functions numerical-methods recurrence-relations
functions numerical-methods recurrence-relations
asked Jan 15 at 10:21
Jamal FarokhiJamal Farokhi
454210
454210
$begingroup$
Do you assume anything about the solutions? Because as written, it is easy to construct solution by defining it piecewise on intervals $(n,n+1]$.
$endgroup$
– Wojowu
Jan 15 at 10:24
$begingroup$
You have $f(n)=a f(1)prodlimits_{i=2}^{n-1} beta(i)$
$endgroup$
– Henry
Jan 15 at 10:27
$begingroup$
I need a continuous function solution, so can I interpolate this?
$endgroup$
– Jamal Farokhi
Jan 15 at 10:38
$begingroup$
There are infinitely many such functions. Simply consider $f(x)=cos(2pi x)g(x)$ for example.
$endgroup$
– Simply Beautiful Art
Jan 15 at 14:53
add a comment |
$begingroup$
Do you assume anything about the solutions? Because as written, it is easy to construct solution by defining it piecewise on intervals $(n,n+1]$.
$endgroup$
– Wojowu
Jan 15 at 10:24
$begingroup$
You have $f(n)=a f(1)prodlimits_{i=2}^{n-1} beta(i)$
$endgroup$
– Henry
Jan 15 at 10:27
$begingroup$
I need a continuous function solution, so can I interpolate this?
$endgroup$
– Jamal Farokhi
Jan 15 at 10:38
$begingroup$
There are infinitely many such functions. Simply consider $f(x)=cos(2pi x)g(x)$ for example.
$endgroup$
– Simply Beautiful Art
Jan 15 at 14:53
$begingroup$
Do you assume anything about the solutions? Because as written, it is easy to construct solution by defining it piecewise on intervals $(n,n+1]$.
$endgroup$
– Wojowu
Jan 15 at 10:24
$begingroup$
Do you assume anything about the solutions? Because as written, it is easy to construct solution by defining it piecewise on intervals $(n,n+1]$.
$endgroup$
– Wojowu
Jan 15 at 10:24
$begingroup$
You have $f(n)=a f(1)prodlimits_{i=2}^{n-1} beta(i)$
$endgroup$
– Henry
Jan 15 at 10:27
$begingroup$
You have $f(n)=a f(1)prodlimits_{i=2}^{n-1} beta(i)$
$endgroup$
– Henry
Jan 15 at 10:27
$begingroup$
I need a continuous function solution, so can I interpolate this?
$endgroup$
– Jamal Farokhi
Jan 15 at 10:38
$begingroup$
I need a continuous function solution, so can I interpolate this?
$endgroup$
– Jamal Farokhi
Jan 15 at 10:38
$begingroup$
There are infinitely many such functions. Simply consider $f(x)=cos(2pi x)g(x)$ for example.
$endgroup$
– Simply Beautiful Art
Jan 15 at 14:53
$begingroup$
There are infinitely many such functions. Simply consider $f(x)=cos(2pi x)g(x)$ for example.
$endgroup$
– Simply Beautiful Art
Jan 15 at 14:53
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If you know nothing about $beta$, then $f(n)$ can be just about any sequence you want, so long as $f(2)=acdot f(1)$.
More strictly, the following is true:
Let $f_n$ be a piecewise constant nonzero function on all intervals $[n,n+1)$, that is, let $a_n$ be a sequence of real numbers, and let $f(x)$ equal $a_n$ on $[n,n+1)$. Let $a_2=acdot a_1$. Then, there exists a function $beta$ such that $f(x+1)=beta(x)cdot f(x)$ for all $x$.
You can easily see this is true by simply defining $beta(x)$ to equal $frac{a_{n+1}}{a_n}$ on $[n,n+1)$
$endgroup$
$begingroup$
$beta(x)$ can be any function and in a special case, for instance, if $beta(x)=s$, so $f(x)=Gamma(x)$. I want to find welldefind solutions.
$endgroup$
– Jamal Farokhi
Jan 15 at 10:40
$begingroup$
@JamalFarokhi If $beta$ can be any function, then $f$ can also be any function.
$endgroup$
– 5xum
Jan 15 at 10:48
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%2f3074289%2fthere-is-a-straight-solution-for-difference-equation-fx1-betaxfx-such%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$
If you know nothing about $beta$, then $f(n)$ can be just about any sequence you want, so long as $f(2)=acdot f(1)$.
More strictly, the following is true:
Let $f_n$ be a piecewise constant nonzero function on all intervals $[n,n+1)$, that is, let $a_n$ be a sequence of real numbers, and let $f(x)$ equal $a_n$ on $[n,n+1)$. Let $a_2=acdot a_1$. Then, there exists a function $beta$ such that $f(x+1)=beta(x)cdot f(x)$ for all $x$.
You can easily see this is true by simply defining $beta(x)$ to equal $frac{a_{n+1}}{a_n}$ on $[n,n+1)$
$endgroup$
$begingroup$
$beta(x)$ can be any function and in a special case, for instance, if $beta(x)=s$, so $f(x)=Gamma(x)$. I want to find welldefind solutions.
$endgroup$
– Jamal Farokhi
Jan 15 at 10:40
$begingroup$
@JamalFarokhi If $beta$ can be any function, then $f$ can also be any function.
$endgroup$
– 5xum
Jan 15 at 10:48
add a comment |
$begingroup$
If you know nothing about $beta$, then $f(n)$ can be just about any sequence you want, so long as $f(2)=acdot f(1)$.
More strictly, the following is true:
Let $f_n$ be a piecewise constant nonzero function on all intervals $[n,n+1)$, that is, let $a_n$ be a sequence of real numbers, and let $f(x)$ equal $a_n$ on $[n,n+1)$. Let $a_2=acdot a_1$. Then, there exists a function $beta$ such that $f(x+1)=beta(x)cdot f(x)$ for all $x$.
You can easily see this is true by simply defining $beta(x)$ to equal $frac{a_{n+1}}{a_n}$ on $[n,n+1)$
$endgroup$
$begingroup$
$beta(x)$ can be any function and in a special case, for instance, if $beta(x)=s$, so $f(x)=Gamma(x)$. I want to find welldefind solutions.
$endgroup$
– Jamal Farokhi
Jan 15 at 10:40
$begingroup$
@JamalFarokhi If $beta$ can be any function, then $f$ can also be any function.
$endgroup$
– 5xum
Jan 15 at 10:48
add a comment |
$begingroup$
If you know nothing about $beta$, then $f(n)$ can be just about any sequence you want, so long as $f(2)=acdot f(1)$.
More strictly, the following is true:
Let $f_n$ be a piecewise constant nonzero function on all intervals $[n,n+1)$, that is, let $a_n$ be a sequence of real numbers, and let $f(x)$ equal $a_n$ on $[n,n+1)$. Let $a_2=acdot a_1$. Then, there exists a function $beta$ such that $f(x+1)=beta(x)cdot f(x)$ for all $x$.
You can easily see this is true by simply defining $beta(x)$ to equal $frac{a_{n+1}}{a_n}$ on $[n,n+1)$
$endgroup$
If you know nothing about $beta$, then $f(n)$ can be just about any sequence you want, so long as $f(2)=acdot f(1)$.
More strictly, the following is true:
Let $f_n$ be a piecewise constant nonzero function on all intervals $[n,n+1)$, that is, let $a_n$ be a sequence of real numbers, and let $f(x)$ equal $a_n$ on $[n,n+1)$. Let $a_2=acdot a_1$. Then, there exists a function $beta$ such that $f(x+1)=beta(x)cdot f(x)$ for all $x$.
You can easily see this is true by simply defining $beta(x)$ to equal $frac{a_{n+1}}{a_n}$ on $[n,n+1)$
answered Jan 15 at 10:28
5xum5xum
91.8k394161
91.8k394161
$begingroup$
$beta(x)$ can be any function and in a special case, for instance, if $beta(x)=s$, so $f(x)=Gamma(x)$. I want to find welldefind solutions.
$endgroup$
– Jamal Farokhi
Jan 15 at 10:40
$begingroup$
@JamalFarokhi If $beta$ can be any function, then $f$ can also be any function.
$endgroup$
– 5xum
Jan 15 at 10:48
add a comment |
$begingroup$
$beta(x)$ can be any function and in a special case, for instance, if $beta(x)=s$, so $f(x)=Gamma(x)$. I want to find welldefind solutions.
$endgroup$
– Jamal Farokhi
Jan 15 at 10:40
$begingroup$
@JamalFarokhi If $beta$ can be any function, then $f$ can also be any function.
$endgroup$
– 5xum
Jan 15 at 10:48
$begingroup$
$beta(x)$ can be any function and in a special case, for instance, if $beta(x)=s$, so $f(x)=Gamma(x)$. I want to find welldefind solutions.
$endgroup$
– Jamal Farokhi
Jan 15 at 10:40
$begingroup$
$beta(x)$ can be any function and in a special case, for instance, if $beta(x)=s$, so $f(x)=Gamma(x)$. I want to find welldefind solutions.
$endgroup$
– Jamal Farokhi
Jan 15 at 10:40
$begingroup$
@JamalFarokhi If $beta$ can be any function, then $f$ can also be any function.
$endgroup$
– 5xum
Jan 15 at 10:48
$begingroup$
@JamalFarokhi If $beta$ can be any function, then $f$ can also be any function.
$endgroup$
– 5xum
Jan 15 at 10:48
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.
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%2f3074289%2fthere-is-a-straight-solution-for-difference-equation-fx1-betaxfx-such%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
$begingroup$
Do you assume anything about the solutions? Because as written, it is easy to construct solution by defining it piecewise on intervals $(n,n+1]$.
$endgroup$
– Wojowu
Jan 15 at 10:24
$begingroup$
You have $f(n)=a f(1)prodlimits_{i=2}^{n-1} beta(i)$
$endgroup$
– Henry
Jan 15 at 10:27
$begingroup$
I need a continuous function solution, so can I interpolate this?
$endgroup$
– Jamal Farokhi
Jan 15 at 10:38
$begingroup$
There are infinitely many such functions. Simply consider $f(x)=cos(2pi x)g(x)$ for example.
$endgroup$
– Simply Beautiful Art
Jan 15 at 14:53