Evaluating Summation of Infinite Series
$begingroup$
Let $a_{1},a_{2},...,a_{n}$ be a monotone increasing sequence of numbers satisfying $sin(a_{k}) = frac{k}{n}$ and $a_{k} leq frac{pi}{2}$ for all $1leq k leq n$. I would like to calculate $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$.
This is my attempt so far. First, fix $ninmathbb{N}$. Then, we have the upper bound as follows :
$$frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$$
Therefore, $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}leq frac{pi}{2}$
On the other hand, I also have the following inequality:
begin{align*}
frac{1}{n}sum_{k=1}^{n}sin(a_{k})leq frac{1}{n}sum_{k=1}^{n}a_{k}
end{align*}
Moreover, we know that $sin(a_{k}) =frac{k}{n}$ and therefore $frac{1}{n}sum_{k=1}^{n}sin(a_{k})=frac{n+1}{2n}$
Hence, we have $frac{n+1}{2n}leq frac{1}{n}sum_{k=1}^{n}a_{k}$ which implies $$ frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$$
Therefore, I obtain $frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$.
Now, I am confused how to find a better bound of this sum to apply the squeeze theorem. Any help or hint will be much appreciated! Thank you!
calculus sequences-and-series limits summation-method
$endgroup$
add a comment |
$begingroup$
Let $a_{1},a_{2},...,a_{n}$ be a monotone increasing sequence of numbers satisfying $sin(a_{k}) = frac{k}{n}$ and $a_{k} leq frac{pi}{2}$ for all $1leq k leq n$. I would like to calculate $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$.
This is my attempt so far. First, fix $ninmathbb{N}$. Then, we have the upper bound as follows :
$$frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$$
Therefore, $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}leq frac{pi}{2}$
On the other hand, I also have the following inequality:
begin{align*}
frac{1}{n}sum_{k=1}^{n}sin(a_{k})leq frac{1}{n}sum_{k=1}^{n}a_{k}
end{align*}
Moreover, we know that $sin(a_{k}) =frac{k}{n}$ and therefore $frac{1}{n}sum_{k=1}^{n}sin(a_{k})=frac{n+1}{2n}$
Hence, we have $frac{n+1}{2n}leq frac{1}{n}sum_{k=1}^{n}a_{k}$ which implies $$ frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$$
Therefore, I obtain $frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$.
Now, I am confused how to find a better bound of this sum to apply the squeeze theorem. Any help or hint will be much appreciated! Thank you!
calculus sequences-and-series limits summation-method
$endgroup$
add a comment |
$begingroup$
Let $a_{1},a_{2},...,a_{n}$ be a monotone increasing sequence of numbers satisfying $sin(a_{k}) = frac{k}{n}$ and $a_{k} leq frac{pi}{2}$ for all $1leq k leq n$. I would like to calculate $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$.
This is my attempt so far. First, fix $ninmathbb{N}$. Then, we have the upper bound as follows :
$$frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$$
Therefore, $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}leq frac{pi}{2}$
On the other hand, I also have the following inequality:
begin{align*}
frac{1}{n}sum_{k=1}^{n}sin(a_{k})leq frac{1}{n}sum_{k=1}^{n}a_{k}
end{align*}
Moreover, we know that $sin(a_{k}) =frac{k}{n}$ and therefore $frac{1}{n}sum_{k=1}^{n}sin(a_{k})=frac{n+1}{2n}$
Hence, we have $frac{n+1}{2n}leq frac{1}{n}sum_{k=1}^{n}a_{k}$ which implies $$ frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$$
Therefore, I obtain $frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$.
Now, I am confused how to find a better bound of this sum to apply the squeeze theorem. Any help or hint will be much appreciated! Thank you!
calculus sequences-and-series limits summation-method
$endgroup$
Let $a_{1},a_{2},...,a_{n}$ be a monotone increasing sequence of numbers satisfying $sin(a_{k}) = frac{k}{n}$ and $a_{k} leq frac{pi}{2}$ for all $1leq k leq n$. I would like to calculate $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$.
This is my attempt so far. First, fix $ninmathbb{N}$. Then, we have the upper bound as follows :
$$frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$$
Therefore, $limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}leq frac{pi}{2}$
On the other hand, I also have the following inequality:
begin{align*}
frac{1}{n}sum_{k=1}^{n}sin(a_{k})leq frac{1}{n}sum_{k=1}^{n}a_{k}
end{align*}
Moreover, we know that $sin(a_{k}) =frac{k}{n}$ and therefore $frac{1}{n}sum_{k=1}^{n}sin(a_{k})=frac{n+1}{2n}$
Hence, we have $frac{n+1}{2n}leq frac{1}{n}sum_{k=1}^{n}a_{k}$ which implies $$ frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k}$$
Therefore, I obtain $frac{1}{2} leq limlimits_{ntoinfty}frac{1}{n}sum_{k=1}^{n}a_{k} leq frac{pi}{2}$.
Now, I am confused how to find a better bound of this sum to apply the squeeze theorem. Any help or hint will be much appreciated! Thank you!
calculus sequences-and-series limits summation-method
calculus sequences-and-series limits summation-method
asked Jan 11 at 6:42
Evan William ChandraEvan William Chandra
628313
628313
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hint. Let $y=sin(x)$, then your sum is a Riemann sum with respect to the interval $[0,1]$ along the $y$-axis:
$$frac{1}{n}sum_{k=1}^{n}a_{k}=frac{1}{n}sum_{k=1}^{n}arcsin(k/n).$$
So what is the limit you are looking for?
$endgroup$
$begingroup$
I feel so stupid now! How could I not realise this earlier? Thank you so much! Now this becomes easy thanks to your hint!
$endgroup$
– Evan William Chandra
Jan 11 at 6:58
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%2f3069541%2fevaluating-summation-of-infinite-series%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$
Hint. Let $y=sin(x)$, then your sum is a Riemann sum with respect to the interval $[0,1]$ along the $y$-axis:
$$frac{1}{n}sum_{k=1}^{n}a_{k}=frac{1}{n}sum_{k=1}^{n}arcsin(k/n).$$
So what is the limit you are looking for?
$endgroup$
$begingroup$
I feel so stupid now! How could I not realise this earlier? Thank you so much! Now this becomes easy thanks to your hint!
$endgroup$
– Evan William Chandra
Jan 11 at 6:58
add a comment |
$begingroup$
Hint. Let $y=sin(x)$, then your sum is a Riemann sum with respect to the interval $[0,1]$ along the $y$-axis:
$$frac{1}{n}sum_{k=1}^{n}a_{k}=frac{1}{n}sum_{k=1}^{n}arcsin(k/n).$$
So what is the limit you are looking for?
$endgroup$
$begingroup$
I feel so stupid now! How could I not realise this earlier? Thank you so much! Now this becomes easy thanks to your hint!
$endgroup$
– Evan William Chandra
Jan 11 at 6:58
add a comment |
$begingroup$
Hint. Let $y=sin(x)$, then your sum is a Riemann sum with respect to the interval $[0,1]$ along the $y$-axis:
$$frac{1}{n}sum_{k=1}^{n}a_{k}=frac{1}{n}sum_{k=1}^{n}arcsin(k/n).$$
So what is the limit you are looking for?
$endgroup$
Hint. Let $y=sin(x)$, then your sum is a Riemann sum with respect to the interval $[0,1]$ along the $y$-axis:
$$frac{1}{n}sum_{k=1}^{n}a_{k}=frac{1}{n}sum_{k=1}^{n}arcsin(k/n).$$
So what is the limit you are looking for?
edited Jan 11 at 6:52
answered Jan 11 at 6:46
Robert ZRobert Z
99.8k1068140
99.8k1068140
$begingroup$
I feel so stupid now! How could I not realise this earlier? Thank you so much! Now this becomes easy thanks to your hint!
$endgroup$
– Evan William Chandra
Jan 11 at 6:58
add a comment |
$begingroup$
I feel so stupid now! How could I not realise this earlier? Thank you so much! Now this becomes easy thanks to your hint!
$endgroup$
– Evan William Chandra
Jan 11 at 6:58
$begingroup$
I feel so stupid now! How could I not realise this earlier? Thank you so much! Now this becomes easy thanks to your hint!
$endgroup$
– Evan William Chandra
Jan 11 at 6:58
$begingroup$
I feel so stupid now! How could I not realise this earlier? Thank you so much! Now this becomes easy thanks to your hint!
$endgroup$
– Evan William Chandra
Jan 11 at 6:58
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%2f3069541%2fevaluating-summation-of-infinite-series%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