If a sequence converges to a, prove the squares of its terms converge to a^2












2












$begingroup$


Given:
$$a_nto a$$
That means :
For all $epsilon^*:=frac{epsilon }{2|a|+1} $ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+1}$



I have to prove
$$(a_n)^2 to a^2 $$



At first we guess
$left |a_n+a right |=left |a_n-a+a+a right |<frac{epsilon }{2|a|+1 }+2|a | $



Now we can prove



$$(a_n)^2 to a^2 $$
$left |(a_n)^2- a^2 right |=left |(a_n-a)(a_n+a)right |=left |a_n-a right |left |a_n+a right |<frac{epsilon }{2|a|+1}(frac{epsilon }{2|a|+1}+2|a |)<epsilon^2+epsilon$



I changed my epsilon and i think it works now??
any suggestion ?






real-analysis







share|cite|improve this question











$endgroup$












  • $begingroup$
    Your question isn't clear. Are you trying to prove that if some sequence $a_ninmathbb R$ converges to $a$, then its square converges to $a^2$?
    $endgroup$
    – fonini
    Feb 1 '15 at 22:54










  • $begingroup$
    i have to prove if a_n converges to a, then (a_n)^2 convergens to a^2
    $endgroup$
    – Beginner
    Feb 1 '15 at 22:56












  • $begingroup$
    $lim_{nto infty} a_n = a$ means that for all $epsilon gt 0$ there exists natural number $N$ such that for all $n gt N$, $|a_n - a| lt epsilon$.
    $endgroup$
    – hardmath
    Feb 1 '15 at 22:58












  • $begingroup$
    This is good, but to finish you need to show that you can make $epsilon^*$ as small as you want. It is not difficult, but it is the essence of the proof.
    $endgroup$
    – copper.hat
    Feb 1 '15 at 23:16












  • $begingroup$
    @Beginner how is $frac{epsilon}{2|a| + epsilon}(frac{epsilon}{2|a|} + 2|a|) < epsilon$? Putting aside the fact that $a$ can be zero (in which case $epsilon/|a|$ is undefined), if $epsilon = 2$ and $a = 1/4$, then the left hand side of the inequality is equal to $45/8$, but the right hand side is equal to $2$, which is less than $45/8$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:52
















2












$begingroup$


Given:
$$a_nto a$$
That means :
For all $epsilon^*:=frac{epsilon }{2|a|+1} $ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+1}$



I have to prove
$$(a_n)^2 to a^2 $$



At first we guess
$left |a_n+a right |=left |a_n-a+a+a right |<frac{epsilon }{2|a|+1 }+2|a | $



Now we can prove



$$(a_n)^2 to a^2 $$
$left |(a_n)^2- a^2 right |=left |(a_n-a)(a_n+a)right |=left |a_n-a right |left |a_n+a right |<frac{epsilon }{2|a|+1}(frac{epsilon }{2|a|+1}+2|a |)<epsilon^2+epsilon$



I changed my epsilon and i think it works now??
any suggestion ?






real-analysis







share|cite|improve this question











$endgroup$












  • $begingroup$
    Your question isn't clear. Are you trying to prove that if some sequence $a_ninmathbb R$ converges to $a$, then its square converges to $a^2$?
    $endgroup$
    – fonini
    Feb 1 '15 at 22:54










  • $begingroup$
    i have to prove if a_n converges to a, then (a_n)^2 convergens to a^2
    $endgroup$
    – Beginner
    Feb 1 '15 at 22:56












  • $begingroup$
    $lim_{nto infty} a_n = a$ means that for all $epsilon gt 0$ there exists natural number $N$ such that for all $n gt N$, $|a_n - a| lt epsilon$.
    $endgroup$
    – hardmath
    Feb 1 '15 at 22:58












  • $begingroup$
    This is good, but to finish you need to show that you can make $epsilon^*$ as small as you want. It is not difficult, but it is the essence of the proof.
    $endgroup$
    – copper.hat
    Feb 1 '15 at 23:16












  • $begingroup$
    @Beginner how is $frac{epsilon}{2|a| + epsilon}(frac{epsilon}{2|a|} + 2|a|) < epsilon$? Putting aside the fact that $a$ can be zero (in which case $epsilon/|a|$ is undefined), if $epsilon = 2$ and $a = 1/4$, then the left hand side of the inequality is equal to $45/8$, but the right hand side is equal to $2$, which is less than $45/8$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:52














2












2








2





$begingroup$


Given:
$$a_nto a$$
That means :
For all $epsilon^*:=frac{epsilon }{2|a|+1} $ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+1}$



I have to prove
$$(a_n)^2 to a^2 $$



At first we guess
$left |a_n+a right |=left |a_n-a+a+a right |<frac{epsilon }{2|a|+1 }+2|a | $



Now we can prove



$$(a_n)^2 to a^2 $$
$left |(a_n)^2- a^2 right |=left |(a_n-a)(a_n+a)right |=left |a_n-a right |left |a_n+a right |<frac{epsilon }{2|a|+1}(frac{epsilon }{2|a|+1}+2|a |)<epsilon^2+epsilon$



I changed my epsilon and i think it works now??
any suggestion ?






real-analysis







share|cite|improve this question











$endgroup$




Given:
$$a_nto a$$
That means :
For all $epsilon^*:=frac{epsilon }{2|a|+1} $ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+1}$



I have to prove
$$(a_n)^2 to a^2 $$



At first we guess
$left |a_n+a right |=left |a_n-a+a+a right |<frac{epsilon }{2|a|+1 }+2|a | $



Now we can prove



$$(a_n)^2 to a^2 $$
$left |(a_n)^2- a^2 right |=left |(a_n-a)(a_n+a)right |=left |a_n-a right |left |a_n+a right |<frac{epsilon }{2|a|+1}(frac{epsilon }{2|a|+1}+2|a |)<epsilon^2+epsilon$



I changed my epsilon and i think it works now??
any suggestion ?






real-analysis




real-analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 1 '15 at 23:58







Beginner

















asked Feb 1 '15 at 22:47









BeginnerBeginner

284




284












  • $begingroup$
    Your question isn't clear. Are you trying to prove that if some sequence $a_ninmathbb R$ converges to $a$, then its square converges to $a^2$?
    $endgroup$
    – fonini
    Feb 1 '15 at 22:54










  • $begingroup$
    i have to prove if a_n converges to a, then (a_n)^2 convergens to a^2
    $endgroup$
    – Beginner
    Feb 1 '15 at 22:56












  • $begingroup$
    $lim_{nto infty} a_n = a$ means that for all $epsilon gt 0$ there exists natural number $N$ such that for all $n gt N$, $|a_n - a| lt epsilon$.
    $endgroup$
    – hardmath
    Feb 1 '15 at 22:58












  • $begingroup$
    This is good, but to finish you need to show that you can make $epsilon^*$ as small as you want. It is not difficult, but it is the essence of the proof.
    $endgroup$
    – copper.hat
    Feb 1 '15 at 23:16












  • $begingroup$
    @Beginner how is $frac{epsilon}{2|a| + epsilon}(frac{epsilon}{2|a|} + 2|a|) < epsilon$? Putting aside the fact that $a$ can be zero (in which case $epsilon/|a|$ is undefined), if $epsilon = 2$ and $a = 1/4$, then the left hand side of the inequality is equal to $45/8$, but the right hand side is equal to $2$, which is less than $45/8$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:52


















  • $begingroup$
    Your question isn't clear. Are you trying to prove that if some sequence $a_ninmathbb R$ converges to $a$, then its square converges to $a^2$?
    $endgroup$
    – fonini
    Feb 1 '15 at 22:54










  • $begingroup$
    i have to prove if a_n converges to a, then (a_n)^2 convergens to a^2
    $endgroup$
    – Beginner
    Feb 1 '15 at 22:56












  • $begingroup$
    $lim_{nto infty} a_n = a$ means that for all $epsilon gt 0$ there exists natural number $N$ such that for all $n gt N$, $|a_n - a| lt epsilon$.
    $endgroup$
    – hardmath
    Feb 1 '15 at 22:58












  • $begingroup$
    This is good, but to finish you need to show that you can make $epsilon^*$ as small as you want. It is not difficult, but it is the essence of the proof.
    $endgroup$
    – copper.hat
    Feb 1 '15 at 23:16












  • $begingroup$
    @Beginner how is $frac{epsilon}{2|a| + epsilon}(frac{epsilon}{2|a|} + 2|a|) < epsilon$? Putting aside the fact that $a$ can be zero (in which case $epsilon/|a|$ is undefined), if $epsilon = 2$ and $a = 1/4$, then the left hand side of the inequality is equal to $45/8$, but the right hand side is equal to $2$, which is less than $45/8$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:52
















$begingroup$
Your question isn't clear. Are you trying to prove that if some sequence $a_ninmathbb R$ converges to $a$, then its square converges to $a^2$?
$endgroup$
– fonini
Feb 1 '15 at 22:54




$begingroup$
Your question isn't clear. Are you trying to prove that if some sequence $a_ninmathbb R$ converges to $a$, then its square converges to $a^2$?
$endgroup$
– fonini
Feb 1 '15 at 22:54












$begingroup$
i have to prove if a_n converges to a, then (a_n)^2 convergens to a^2
$endgroup$
– Beginner
Feb 1 '15 at 22:56






$begingroup$
i have to prove if a_n converges to a, then (a_n)^2 convergens to a^2
$endgroup$
– Beginner
Feb 1 '15 at 22:56














$begingroup$
$lim_{nto infty} a_n = a$ means that for all $epsilon gt 0$ there exists natural number $N$ such that for all $n gt N$, $|a_n - a| lt epsilon$.
$endgroup$
– hardmath
Feb 1 '15 at 22:58






$begingroup$
$lim_{nto infty} a_n = a$ means that for all $epsilon gt 0$ there exists natural number $N$ such that for all $n gt N$, $|a_n - a| lt epsilon$.
$endgroup$
– hardmath
Feb 1 '15 at 22:58














$begingroup$
This is good, but to finish you need to show that you can make $epsilon^*$ as small as you want. It is not difficult, but it is the essence of the proof.
$endgroup$
– copper.hat
Feb 1 '15 at 23:16






$begingroup$
This is good, but to finish you need to show that you can make $epsilon^*$ as small as you want. It is not difficult, but it is the essence of the proof.
$endgroup$
– copper.hat
Feb 1 '15 at 23:16














$begingroup$
@Beginner how is $frac{epsilon}{2|a| + epsilon}(frac{epsilon}{2|a|} + 2|a|) < epsilon$? Putting aside the fact that $a$ can be zero (in which case $epsilon/|a|$ is undefined), if $epsilon = 2$ and $a = 1/4$, then the left hand side of the inequality is equal to $45/8$, but the right hand side is equal to $2$, which is less than $45/8$.
$endgroup$
– kobe
Feb 1 '15 at 23:52




$begingroup$
@Beginner how is $frac{epsilon}{2|a| + epsilon}(frac{epsilon}{2|a|} + 2|a|) < epsilon$? Putting aside the fact that $a$ can be zero (in which case $epsilon/|a|$ is undefined), if $epsilon = 2$ and $a = 1/4$, then the left hand side of the inequality is equal to $45/8$, but the right hand side is equal to $2$, which is less than $45/8$.
$endgroup$
– kobe
Feb 1 '15 at 23:52










1 Answer
1






active

oldest

votes


















2












$begingroup$

Given $varepsilon > 0$, let $eta := min{1, frac{varepsilon}{(1 + 2|a|)}} > 0$.



So since $a_n to a$, there exists a positive integer $N$ such that $|a_n - a| < eta$ for all $n ge N$.



Now if $n ge N$, then in particular, $|a_n - a| < 1$, which implies
$$
|a_n + a| = |(a_n - a) + 2a| le |a_n -a| + 2|a| < 1 + 2|a|
$$
Thus
$$
|a_n^2 - a^2| = |a_n + a||a_n - a| < (1 + 2|a|) frac{varepsilon}{1 + 2|a|} = varepsilon$$
Since $varepsilon$ was arbitrary, $~a_n^2 to a^2$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thanks for the answer and can you tell me please, is my solution correct?
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:11










  • $begingroup$
    It's not correct. For one, $a$ can be zero, so $varepsilon/a$ may be undefined.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:15










  • $begingroup$
    For all $frac{epsilon }{2|a|+frac{epsilon}}$ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+frac{epsilon}}$
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:19










  • $begingroup$
    Your statement does not make sense. Even if you just have $|a_n - a| < varepsilon/(text{something})$ for all $n > N$, you cannot find an upper bound for $|a_n + a|$ that is independent of $varepsilon$ for $n > N$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:25













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%2f1129634%2fif-a-sequence-converges-to-a-prove-the-squares-of-its-terms-converge-to-a2%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









2












$begingroup$

Given $varepsilon > 0$, let $eta := min{1, frac{varepsilon}{(1 + 2|a|)}} > 0$.



So since $a_n to a$, there exists a positive integer $N$ such that $|a_n - a| < eta$ for all $n ge N$.



Now if $n ge N$, then in particular, $|a_n - a| < 1$, which implies
$$
|a_n + a| = |(a_n - a) + 2a| le |a_n -a| + 2|a| < 1 + 2|a|
$$
Thus
$$
|a_n^2 - a^2| = |a_n + a||a_n - a| < (1 + 2|a|) frac{varepsilon}{1 + 2|a|} = varepsilon$$
Since $varepsilon$ was arbitrary, $~a_n^2 to a^2$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thanks for the answer and can you tell me please, is my solution correct?
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:11










  • $begingroup$
    It's not correct. For one, $a$ can be zero, so $varepsilon/a$ may be undefined.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:15










  • $begingroup$
    For all $frac{epsilon }{2|a|+frac{epsilon}}$ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+frac{epsilon}}$
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:19










  • $begingroup$
    Your statement does not make sense. Even if you just have $|a_n - a| < varepsilon/(text{something})$ for all $n > N$, you cannot find an upper bound for $|a_n + a|$ that is independent of $varepsilon$ for $n > N$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:25


















2












$begingroup$

Given $varepsilon > 0$, let $eta := min{1, frac{varepsilon}{(1 + 2|a|)}} > 0$.



So since $a_n to a$, there exists a positive integer $N$ such that $|a_n - a| < eta$ for all $n ge N$.



Now if $n ge N$, then in particular, $|a_n - a| < 1$, which implies
$$
|a_n + a| = |(a_n - a) + 2a| le |a_n -a| + 2|a| < 1 + 2|a|
$$
Thus
$$
|a_n^2 - a^2| = |a_n + a||a_n - a| < (1 + 2|a|) frac{varepsilon}{1 + 2|a|} = varepsilon$$
Since $varepsilon$ was arbitrary, $~a_n^2 to a^2$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thanks for the answer and can you tell me please, is my solution correct?
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:11










  • $begingroup$
    It's not correct. For one, $a$ can be zero, so $varepsilon/a$ may be undefined.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:15










  • $begingroup$
    For all $frac{epsilon }{2|a|+frac{epsilon}}$ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+frac{epsilon}}$
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:19










  • $begingroup$
    Your statement does not make sense. Even if you just have $|a_n - a| < varepsilon/(text{something})$ for all $n > N$, you cannot find an upper bound for $|a_n + a|$ that is independent of $varepsilon$ for $n > N$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:25
















2












2








2





$begingroup$

Given $varepsilon > 0$, let $eta := min{1, frac{varepsilon}{(1 + 2|a|)}} > 0$.



So since $a_n to a$, there exists a positive integer $N$ such that $|a_n - a| < eta$ for all $n ge N$.



Now if $n ge N$, then in particular, $|a_n - a| < 1$, which implies
$$
|a_n + a| = |(a_n - a) + 2a| le |a_n -a| + 2|a| < 1 + 2|a|
$$
Thus
$$
|a_n^2 - a^2| = |a_n + a||a_n - a| < (1 + 2|a|) frac{varepsilon}{1 + 2|a|} = varepsilon$$
Since $varepsilon$ was arbitrary, $~a_n^2 to a^2$.






share|cite|improve this answer











$endgroup$



Given $varepsilon > 0$, let $eta := min{1, frac{varepsilon}{(1 + 2|a|)}} > 0$.



So since $a_n to a$, there exists a positive integer $N$ such that $|a_n - a| < eta$ for all $n ge N$.



Now if $n ge N$, then in particular, $|a_n - a| < 1$, which implies
$$
|a_n + a| = |(a_n - a) + 2a| le |a_n -a| + 2|a| < 1 + 2|a|
$$
Thus
$$
|a_n^2 - a^2| = |a_n + a||a_n - a| < (1 + 2|a|) frac{varepsilon}{1 + 2|a|} = varepsilon$$
Since $varepsilon$ was arbitrary, $~a_n^2 to a^2$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Apr 6 '18 at 11:15









Viktor Glombik

1,0101527




1,0101527










answered Feb 1 '15 at 23:02









kobekobe

35k22248




35k22248












  • $begingroup$
    Thanks for the answer and can you tell me please, is my solution correct?
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:11










  • $begingroup$
    It's not correct. For one, $a$ can be zero, so $varepsilon/a$ may be undefined.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:15










  • $begingroup$
    For all $frac{epsilon }{2|a|+frac{epsilon}}$ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+frac{epsilon}}$
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:19










  • $begingroup$
    Your statement does not make sense. Even if you just have $|a_n - a| < varepsilon/(text{something})$ for all $n > N$, you cannot find an upper bound for $|a_n + a|$ that is independent of $varepsilon$ for $n > N$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:25




















  • $begingroup$
    Thanks for the answer and can you tell me please, is my solution correct?
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:11










  • $begingroup$
    It's not correct. For one, $a$ can be zero, so $varepsilon/a$ may be undefined.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:15










  • $begingroup$
    For all $frac{epsilon }{2|a|+frac{epsilon}}$ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+frac{epsilon}}$
    $endgroup$
    – Beginner
    Feb 1 '15 at 23:19










  • $begingroup$
    Your statement does not make sense. Even if you just have $|a_n - a| < varepsilon/(text{something})$ for all $n > N$, you cannot find an upper bound for $|a_n + a|$ that is independent of $varepsilon$ for $n > N$.
    $endgroup$
    – kobe
    Feb 1 '15 at 23:25


















$begingroup$
Thanks for the answer and can you tell me please, is my solution correct?
$endgroup$
– Beginner
Feb 1 '15 at 23:11




$begingroup$
Thanks for the answer and can you tell me please, is my solution correct?
$endgroup$
– Beginner
Feb 1 '15 at 23:11












$begingroup$
It's not correct. For one, $a$ can be zero, so $varepsilon/a$ may be undefined.
$endgroup$
– kobe
Feb 1 '15 at 23:15




$begingroup$
It's not correct. For one, $a$ can be zero, so $varepsilon/a$ may be undefined.
$endgroup$
– kobe
Feb 1 '15 at 23:15












$begingroup$
For all $frac{epsilon }{2|a|+frac{epsilon}}$ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+frac{epsilon}}$
$endgroup$
– Beginner
Feb 1 '15 at 23:19




$begingroup$
For all $frac{epsilon }{2|a|+frac{epsilon}}$ we can find an N such that for all n>N $left |a_n-a right |<frac{epsilon }{2|a|+frac{epsilon}}$
$endgroup$
– Beginner
Feb 1 '15 at 23:19












$begingroup$
Your statement does not make sense. Even if you just have $|a_n - a| < varepsilon/(text{something})$ for all $n > N$, you cannot find an upper bound for $|a_n + a|$ that is independent of $varepsilon$ for $n > N$.
$endgroup$
– kobe
Feb 1 '15 at 23:25






$begingroup$
Your statement does not make sense. Even if you just have $|a_n - a| < varepsilon/(text{something})$ for all $n > N$, you cannot find an upper bound for $|a_n + a|$ that is independent of $varepsilon$ for $n > N$.
$endgroup$
– kobe
Feb 1 '15 at 23:25




















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%2f1129634%2fif-a-sequence-converges-to-a-prove-the-squares-of-its-terms-converge-to-a2%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

How to change which sound is reproduced for terminal bell?

Image
3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question
Read more

Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

Image
up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx
Read more

Can I use Tabulator js library in my java Spring + Thymeleaf project?

Image
0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"
Read more