Can $int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(nx)dx=frac{pi}{n!}$ be extened to non-integers?
It is well known that the fourier series for $e^{cos(theta)}sin(sin(theta))$ is $sum_{n=1}^infty frac{sin(ntheta)}{n!}$ which implies that
$$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(ntheta)dx=frac{pi}{n!}$$ for $n>0$. My question is if this identity can be extended to fractional values such as $$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(frac{theta}{2})dtheta=2sqrt{pi} $$
definite-integrals fourier-series gamma-function
add a comment |
It is well known that the fourier series for $e^{cos(theta)}sin(sin(theta))$ is $sum_{n=1}^infty frac{sin(ntheta)}{n!}$ which implies that
$$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(ntheta)dx=frac{pi}{n!}$$ for $n>0$. My question is if this identity can be extended to fractional values such as $$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(frac{theta}{2})dtheta=2sqrt{pi} $$
definite-integrals fourier-series gamma-function
No! Try expanding with the half-angle formulas
– TheOscillator
Nov 29 at 15:59
Numerical evidence suggests that $$ int_{-pi}^pi e^{costheta} sin(sintheta)sin(ntheta),dtheta simeq fracpi{n!} - frac34frac{sin((n-1)pi)}{n^2+1}, $$ where of course $n!=Gamma(n+1)$
– Federico
Nov 29 at 16:33
Sorry, it should be $+tfrac34dots$, not $-$.
– Federico
Nov 29 at 16:43
add a comment |
It is well known that the fourier series for $e^{cos(theta)}sin(sin(theta))$ is $sum_{n=1}^infty frac{sin(ntheta)}{n!}$ which implies that
$$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(ntheta)dx=frac{pi}{n!}$$ for $n>0$. My question is if this identity can be extended to fractional values such as $$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(frac{theta}{2})dtheta=2sqrt{pi} $$
definite-integrals fourier-series gamma-function
It is well known that the fourier series for $e^{cos(theta)}sin(sin(theta))$ is $sum_{n=1}^infty frac{sin(ntheta)}{n!}$ which implies that
$$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(ntheta)dx=frac{pi}{n!}$$ for $n>0$. My question is if this identity can be extended to fractional values such as $$int_{-pi}^pi e^{cos(theta)}sin(sin(theta))sin(frac{theta}{2})dtheta=2sqrt{pi} $$
definite-integrals fourier-series gamma-function
definite-integrals fourier-series gamma-function
asked Nov 29 at 15:50
aleden
1,725411
1,725411
No! Try expanding with the half-angle formulas
– TheOscillator
Nov 29 at 15:59
Numerical evidence suggests that $$ int_{-pi}^pi e^{costheta} sin(sintheta)sin(ntheta),dtheta simeq fracpi{n!} - frac34frac{sin((n-1)pi)}{n^2+1}, $$ where of course $n!=Gamma(n+1)$
– Federico
Nov 29 at 16:33
Sorry, it should be $+tfrac34dots$, not $-$.
– Federico
Nov 29 at 16:43
add a comment |
No! Try expanding with the half-angle formulas
– TheOscillator
Nov 29 at 15:59
Numerical evidence suggests that $$ int_{-pi}^pi e^{costheta} sin(sintheta)sin(ntheta),dtheta simeq fracpi{n!} - frac34frac{sin((n-1)pi)}{n^2+1}, $$ where of course $n!=Gamma(n+1)$
– Federico
Nov 29 at 16:33
Sorry, it should be $+tfrac34dots$, not $-$.
– Federico
Nov 29 at 16:43
No! Try expanding with the half-angle formulas
– TheOscillator
Nov 29 at 15:59
No! Try expanding with the half-angle formulas
– TheOscillator
Nov 29 at 15:59
Numerical evidence suggests that $$ int_{-pi}^pi e^{costheta} sin(sintheta)sin(ntheta),dtheta simeq fracpi{n!} - frac34frac{sin((n-1)pi)}{n^2+1}, $$ where of course $n!=Gamma(n+1)$
– Federico
Nov 29 at 16:33
Numerical evidence suggests that $$ int_{-pi}^pi e^{costheta} sin(sintheta)sin(ntheta),dtheta simeq fracpi{n!} - frac34frac{sin((n-1)pi)}{n^2+1}, $$ where of course $n!=Gamma(n+1)$
– Federico
Nov 29 at 16:33
Sorry, it should be $+tfrac34dots$, not $-$.
– Federico
Nov 29 at 16:43
Sorry, it should be $+tfrac34dots$, not $-$.
– Federico
Nov 29 at 16:43
add a comment |
1 Answer
1
active
oldest
votes
Incomplete answer: only numerical experiments.
Let me define
$$
s(n) = int_{-pi}^pi e^{costheta}sin(sintheta)sin(ntheta),dtheta
$$
and
$$
g(n) = frac{s(n)-frac{pi}{Gamma(n+1)}}{sinbigl((n-1)pibigr)}.
$$
Numerical evidence suggests that $g(n)to0$; but how fast? Let's try to extract some more information.
Here I plot $-logbigl(g(n)bigr)$ for $nin[1,20]$:
It looks like a logarithm, so it seems natural to try to fit it with
$$
-logbigl(g(n)bigr) = a+blog(n+c).
$$
By fiddling a bit (and looking at larger ranges of $n$) one can see that $b$ has to be $2$, so we have $a+2log(n+c)$. The value $g(1)$ seems to be around $0.5$, a bit less, so we impose $a+2log(1+b)=log(2)$. Moreover, by looking at large values, we deduce that $a=1-log(2)$ seems a good value. Therefore our approximation is
$$
g(n) simeq frac{2}{bigl(2+sqrt e(n-1)bigr)^2},
$$
which leads to
$$
s(n) simeq frac{pi}{Gamma(n+1)} + frac{2sinbigl((n-1)pibigr)}{bigl(2+sqrt e(n-1)bigr)^2} .
$$
I see, so at integer value it is equal to $frac{pi}{n!}$ but otherwise it is not.
– aleden
Nov 29 at 17:39
Yes. Even just at $n=1/2$, we get $s(1/2)=tfrac2e + sqrtpi mathrm{erf}(1)$ instead of $2sqrtpi$.
– Federico
Nov 29 at 17:42
I'm still intrigued to find a closed expression for $s(n)$
– Federico
Nov 29 at 17:43
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%2f3018807%2fcan-int-pi-pi-e-cos-theta-sin-sin-theta-sinnxdx-frac-pin%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
Incomplete answer: only numerical experiments.
Let me define
$$
s(n) = int_{-pi}^pi e^{costheta}sin(sintheta)sin(ntheta),dtheta
$$
and
$$
g(n) = frac{s(n)-frac{pi}{Gamma(n+1)}}{sinbigl((n-1)pibigr)}.
$$
Numerical evidence suggests that $g(n)to0$; but how fast? Let's try to extract some more information.
Here I plot $-logbigl(g(n)bigr)$ for $nin[1,20]$:
It looks like a logarithm, so it seems natural to try to fit it with
$$
-logbigl(g(n)bigr) = a+blog(n+c).
$$
By fiddling a bit (and looking at larger ranges of $n$) one can see that $b$ has to be $2$, so we have $a+2log(n+c)$. The value $g(1)$ seems to be around $0.5$, a bit less, so we impose $a+2log(1+b)=log(2)$. Moreover, by looking at large values, we deduce that $a=1-log(2)$ seems a good value. Therefore our approximation is
$$
g(n) simeq frac{2}{bigl(2+sqrt e(n-1)bigr)^2},
$$
which leads to
$$
s(n) simeq frac{pi}{Gamma(n+1)} + frac{2sinbigl((n-1)pibigr)}{bigl(2+sqrt e(n-1)bigr)^2} .
$$
I see, so at integer value it is equal to $frac{pi}{n!}$ but otherwise it is not.
– aleden
Nov 29 at 17:39
Yes. Even just at $n=1/2$, we get $s(1/2)=tfrac2e + sqrtpi mathrm{erf}(1)$ instead of $2sqrtpi$.
– Federico
Nov 29 at 17:42
I'm still intrigued to find a closed expression for $s(n)$
– Federico
Nov 29 at 17:43
add a comment |
Incomplete answer: only numerical experiments.
Let me define
$$
s(n) = int_{-pi}^pi e^{costheta}sin(sintheta)sin(ntheta),dtheta
$$
and
$$
g(n) = frac{s(n)-frac{pi}{Gamma(n+1)}}{sinbigl((n-1)pibigr)}.
$$
Numerical evidence suggests that $g(n)to0$; but how fast? Let's try to extract some more information.
Here I plot $-logbigl(g(n)bigr)$ for $nin[1,20]$:
It looks like a logarithm, so it seems natural to try to fit it with
$$
-logbigl(g(n)bigr) = a+blog(n+c).
$$
By fiddling a bit (and looking at larger ranges of $n$) one can see that $b$ has to be $2$, so we have $a+2log(n+c)$. The value $g(1)$ seems to be around $0.5$, a bit less, so we impose $a+2log(1+b)=log(2)$. Moreover, by looking at large values, we deduce that $a=1-log(2)$ seems a good value. Therefore our approximation is
$$
g(n) simeq frac{2}{bigl(2+sqrt e(n-1)bigr)^2},
$$
which leads to
$$
s(n) simeq frac{pi}{Gamma(n+1)} + frac{2sinbigl((n-1)pibigr)}{bigl(2+sqrt e(n-1)bigr)^2} .
$$
I see, so at integer value it is equal to $frac{pi}{n!}$ but otherwise it is not.
– aleden
Nov 29 at 17:39
Yes. Even just at $n=1/2$, we get $s(1/2)=tfrac2e + sqrtpi mathrm{erf}(1)$ instead of $2sqrtpi$.
– Federico
Nov 29 at 17:42
I'm still intrigued to find a closed expression for $s(n)$
– Federico
Nov 29 at 17:43
add a comment |
Incomplete answer: only numerical experiments.
Let me define
$$
s(n) = int_{-pi}^pi e^{costheta}sin(sintheta)sin(ntheta),dtheta
$$
and
$$
g(n) = frac{s(n)-frac{pi}{Gamma(n+1)}}{sinbigl((n-1)pibigr)}.
$$
Numerical evidence suggests that $g(n)to0$; but how fast? Let's try to extract some more information.
Here I plot $-logbigl(g(n)bigr)$ for $nin[1,20]$:
It looks like a logarithm, so it seems natural to try to fit it with
$$
-logbigl(g(n)bigr) = a+blog(n+c).
$$
By fiddling a bit (and looking at larger ranges of $n$) one can see that $b$ has to be $2$, so we have $a+2log(n+c)$. The value $g(1)$ seems to be around $0.5$, a bit less, so we impose $a+2log(1+b)=log(2)$. Moreover, by looking at large values, we deduce that $a=1-log(2)$ seems a good value. Therefore our approximation is
$$
g(n) simeq frac{2}{bigl(2+sqrt e(n-1)bigr)^2},
$$
which leads to
$$
s(n) simeq frac{pi}{Gamma(n+1)} + frac{2sinbigl((n-1)pibigr)}{bigl(2+sqrt e(n-1)bigr)^2} .
$$
Incomplete answer: only numerical experiments.
Let me define
$$
s(n) = int_{-pi}^pi e^{costheta}sin(sintheta)sin(ntheta),dtheta
$$
and
$$
g(n) = frac{s(n)-frac{pi}{Gamma(n+1)}}{sinbigl((n-1)pibigr)}.
$$
Numerical evidence suggests that $g(n)to0$; but how fast? Let's try to extract some more information.
Here I plot $-logbigl(g(n)bigr)$ for $nin[1,20]$:
It looks like a logarithm, so it seems natural to try to fit it with
$$
-logbigl(g(n)bigr) = a+blog(n+c).
$$
By fiddling a bit (and looking at larger ranges of $n$) one can see that $b$ has to be $2$, so we have $a+2log(n+c)$. The value $g(1)$ seems to be around $0.5$, a bit less, so we impose $a+2log(1+b)=log(2)$. Moreover, by looking at large values, we deduce that $a=1-log(2)$ seems a good value. Therefore our approximation is
$$
g(n) simeq frac{2}{bigl(2+sqrt e(n-1)bigr)^2},
$$
which leads to
$$
s(n) simeq frac{pi}{Gamma(n+1)} + frac{2sinbigl((n-1)pibigr)}{bigl(2+sqrt e(n-1)bigr)^2} .
$$
answered Nov 29 at 17:35
Federico
4,509513
4,509513
I see, so at integer value it is equal to $frac{pi}{n!}$ but otherwise it is not.
– aleden
Nov 29 at 17:39
Yes. Even just at $n=1/2$, we get $s(1/2)=tfrac2e + sqrtpi mathrm{erf}(1)$ instead of $2sqrtpi$.
– Federico
Nov 29 at 17:42
I'm still intrigued to find a closed expression for $s(n)$
– Federico
Nov 29 at 17:43
add a comment |
I see, so at integer value it is equal to $frac{pi}{n!}$ but otherwise it is not.
– aleden
Nov 29 at 17:39
Yes. Even just at $n=1/2$, we get $s(1/2)=tfrac2e + sqrtpi mathrm{erf}(1)$ instead of $2sqrtpi$.
– Federico
Nov 29 at 17:42
I'm still intrigued to find a closed expression for $s(n)$
– Federico
Nov 29 at 17:43
I see, so at integer value it is equal to $frac{pi}{n!}$ but otherwise it is not.
– aleden
Nov 29 at 17:39
I see, so at integer value it is equal to $frac{pi}{n!}$ but otherwise it is not.
– aleden
Nov 29 at 17:39
Yes. Even just at $n=1/2$, we get $s(1/2)=tfrac2e + sqrtpi mathrm{erf}(1)$ instead of $2sqrtpi$.
– Federico
Nov 29 at 17:42
Yes. Even just at $n=1/2$, we get $s(1/2)=tfrac2e + sqrtpi mathrm{erf}(1)$ instead of $2sqrtpi$.
– Federico
Nov 29 at 17:42
I'm still intrigued to find a closed expression for $s(n)$
– Federico
Nov 29 at 17:43
I'm still intrigued to find a closed expression for $s(n)$
– Federico
Nov 29 at 17:43
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3018807%2fcan-int-pi-pi-e-cos-theta-sin-sin-theta-sinnxdx-frac-pin%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
No! Try expanding with the half-angle formulas
– TheOscillator
Nov 29 at 15:59
Numerical evidence suggests that $$ int_{-pi}^pi e^{costheta} sin(sintheta)sin(ntheta),dtheta simeq fracpi{n!} - frac34frac{sin((n-1)pi)}{n^2+1}, $$ where of course $n!=Gamma(n+1)$
– Federico
Nov 29 at 16:33
Sorry, it should be $+tfrac34dots$, not $-$.
– Federico
Nov 29 at 16:43