Proving divergence of the fraction of the square root












2












$begingroup$


I saw this question somewhere and was having a hard time proving it so I would love to get some help.



Prove using $varepsilon$ and $N$ that the following sequence is divergent



$$(a_n)=sqrt n - lfloor sqrt n rfloor$$
$$lim_{ntoinfty} (a_n) neq L$$



I have managed to prove it for $ L neq 0 $ but can't manage to do so for $L=0$.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Hint: look at subsequence $a_{n^2-1}$ and show it converges to $1$.
    $endgroup$
    – Wojowu
    Nov 15 '15 at 21:10










  • $begingroup$
    didn't really understand,can't really see the connection between the 2 sequences
    $endgroup$
    – user290361
    Nov 15 '15 at 21:32
















2












$begingroup$


I saw this question somewhere and was having a hard time proving it so I would love to get some help.



Prove using $varepsilon$ and $N$ that the following sequence is divergent



$$(a_n)=sqrt n - lfloor sqrt n rfloor$$
$$lim_{ntoinfty} (a_n) neq L$$



I have managed to prove it for $ L neq 0 $ but can't manage to do so for $L=0$.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Hint: look at subsequence $a_{n^2-1}$ and show it converges to $1$.
    $endgroup$
    – Wojowu
    Nov 15 '15 at 21:10










  • $begingroup$
    didn't really understand,can't really see the connection between the 2 sequences
    $endgroup$
    – user290361
    Nov 15 '15 at 21:32














2












2








2





$begingroup$


I saw this question somewhere and was having a hard time proving it so I would love to get some help.



Prove using $varepsilon$ and $N$ that the following sequence is divergent



$$(a_n)=sqrt n - lfloor sqrt n rfloor$$
$$lim_{ntoinfty} (a_n) neq L$$



I have managed to prove it for $ L neq 0 $ but can't manage to do so for $L=0$.










share|cite|improve this question











$endgroup$




I saw this question somewhere and was having a hard time proving it so I would love to get some help.



Prove using $varepsilon$ and $N$ that the following sequence is divergent



$$(a_n)=sqrt n - lfloor sqrt n rfloor$$
$$lim_{ntoinfty} (a_n) neq L$$



I have managed to prove it for $ L neq 0 $ but can't manage to do so for $L=0$.







sequences-and-series divergent-series epsilon-delta






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 14 '16 at 18:55









gebruiker

5,00851963




5,00851963










asked Nov 15 '15 at 18:21









user290361user290361

112




112








  • 1




    $begingroup$
    Hint: look at subsequence $a_{n^2-1}$ and show it converges to $1$.
    $endgroup$
    – Wojowu
    Nov 15 '15 at 21:10










  • $begingroup$
    didn't really understand,can't really see the connection between the 2 sequences
    $endgroup$
    – user290361
    Nov 15 '15 at 21:32














  • 1




    $begingroup$
    Hint: look at subsequence $a_{n^2-1}$ and show it converges to $1$.
    $endgroup$
    – Wojowu
    Nov 15 '15 at 21:10










  • $begingroup$
    didn't really understand,can't really see the connection between the 2 sequences
    $endgroup$
    – user290361
    Nov 15 '15 at 21:32








1




1




$begingroup$
Hint: look at subsequence $a_{n^2-1}$ and show it converges to $1$.
$endgroup$
– Wojowu
Nov 15 '15 at 21:10




$begingroup$
Hint: look at subsequence $a_{n^2-1}$ and show it converges to $1$.
$endgroup$
– Wojowu
Nov 15 '15 at 21:10












$begingroup$
didn't really understand,can't really see the connection between the 2 sequences
$endgroup$
– user290361
Nov 15 '15 at 21:32




$begingroup$
didn't really understand,can't really see the connection between the 2 sequences
$endgroup$
– user290361
Nov 15 '15 at 21:32










1 Answer
1






active

oldest

votes


















1












$begingroup$

If $limlimits_{ntoinfty} (a_n)=L$, then for every $varepsilon>0$ there is an $N>0$, such that $vert a_n-Lvert <varepsilon$ if $n>N$.



We may always assume without loss of generality that $N>1$.



Now $Lneq0$ is impossible. We can see this by choosing $0<varepsilon<vert Lvert$ and $n=N^2$.



$L=0$ is also impossible. We can see this by choosing $$m=beta+2+2sqrt{2beta},quadtext{where }beta=2k^2text{, for some odd $k>N$.}$$

This way, we have $N<minmathbb N$ and $a_m=a_{beta} + a_2$.

If $(a_n)to 0$ then we must also have that $(a_m)to 0$. But if the subsequence $(a_m)to 0$ then $(a_ {beta})to -a_{2}$, whereas it should converge to $0$. This is a contradiction and so $L=0$ is not a limit.



(If you like things simple, than take Wojowu's advice form the comments and just show that $(a_{n^2-1})$ converges to $1$. )



Since no $L$ will do, we must conclude that $(a_n)$ diverges.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You're right. I will edit.
    $endgroup$
    – gebruiker
    Dec 1 '18 at 14:22










  • $begingroup$
    @matan129 Should work now
    $endgroup$
    – gebruiker
    Dec 1 '18 at 15:20











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%2f1530554%2fproving-divergence-of-the-fraction-of-the-square-root%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









1












$begingroup$

If $limlimits_{ntoinfty} (a_n)=L$, then for every $varepsilon>0$ there is an $N>0$, such that $vert a_n-Lvert <varepsilon$ if $n>N$.



We may always assume without loss of generality that $N>1$.



Now $Lneq0$ is impossible. We can see this by choosing $0<varepsilon<vert Lvert$ and $n=N^2$.



$L=0$ is also impossible. We can see this by choosing $$m=beta+2+2sqrt{2beta},quadtext{where }beta=2k^2text{, for some odd $k>N$.}$$

This way, we have $N<minmathbb N$ and $a_m=a_{beta} + a_2$.

If $(a_n)to 0$ then we must also have that $(a_m)to 0$. But if the subsequence $(a_m)to 0$ then $(a_ {beta})to -a_{2}$, whereas it should converge to $0$. This is a contradiction and so $L=0$ is not a limit.



(If you like things simple, than take Wojowu's advice form the comments and just show that $(a_{n^2-1})$ converges to $1$. )



Since no $L$ will do, we must conclude that $(a_n)$ diverges.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You're right. I will edit.
    $endgroup$
    – gebruiker
    Dec 1 '18 at 14:22










  • $begingroup$
    @matan129 Should work now
    $endgroup$
    – gebruiker
    Dec 1 '18 at 15:20
















1












$begingroup$

If $limlimits_{ntoinfty} (a_n)=L$, then for every $varepsilon>0$ there is an $N>0$, such that $vert a_n-Lvert <varepsilon$ if $n>N$.



We may always assume without loss of generality that $N>1$.



Now $Lneq0$ is impossible. We can see this by choosing $0<varepsilon<vert Lvert$ and $n=N^2$.



$L=0$ is also impossible. We can see this by choosing $$m=beta+2+2sqrt{2beta},quadtext{where }beta=2k^2text{, for some odd $k>N$.}$$

This way, we have $N<minmathbb N$ and $a_m=a_{beta} + a_2$.

If $(a_n)to 0$ then we must also have that $(a_m)to 0$. But if the subsequence $(a_m)to 0$ then $(a_ {beta})to -a_{2}$, whereas it should converge to $0$. This is a contradiction and so $L=0$ is not a limit.



(If you like things simple, than take Wojowu's advice form the comments and just show that $(a_{n^2-1})$ converges to $1$. )



Since no $L$ will do, we must conclude that $(a_n)$ diverges.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You're right. I will edit.
    $endgroup$
    – gebruiker
    Dec 1 '18 at 14:22










  • $begingroup$
    @matan129 Should work now
    $endgroup$
    – gebruiker
    Dec 1 '18 at 15:20














1












1








1





$begingroup$

If $limlimits_{ntoinfty} (a_n)=L$, then for every $varepsilon>0$ there is an $N>0$, such that $vert a_n-Lvert <varepsilon$ if $n>N$.



We may always assume without loss of generality that $N>1$.



Now $Lneq0$ is impossible. We can see this by choosing $0<varepsilon<vert Lvert$ and $n=N^2$.



$L=0$ is also impossible. We can see this by choosing $$m=beta+2+2sqrt{2beta},quadtext{where }beta=2k^2text{, for some odd $k>N$.}$$

This way, we have $N<minmathbb N$ and $a_m=a_{beta} + a_2$.

If $(a_n)to 0$ then we must also have that $(a_m)to 0$. But if the subsequence $(a_m)to 0$ then $(a_ {beta})to -a_{2}$, whereas it should converge to $0$. This is a contradiction and so $L=0$ is not a limit.



(If you like things simple, than take Wojowu's advice form the comments and just show that $(a_{n^2-1})$ converges to $1$. )



Since no $L$ will do, we must conclude that $(a_n)$ diverges.






share|cite|improve this answer











$endgroup$



If $limlimits_{ntoinfty} (a_n)=L$, then for every $varepsilon>0$ there is an $N>0$, such that $vert a_n-Lvert <varepsilon$ if $n>N$.



We may always assume without loss of generality that $N>1$.



Now $Lneq0$ is impossible. We can see this by choosing $0<varepsilon<vert Lvert$ and $n=N^2$.



$L=0$ is also impossible. We can see this by choosing $$m=beta+2+2sqrt{2beta},quadtext{where }beta=2k^2text{, for some odd $k>N$.}$$

This way, we have $N<minmathbb N$ and $a_m=a_{beta} + a_2$.

If $(a_n)to 0$ then we must also have that $(a_m)to 0$. But if the subsequence $(a_m)to 0$ then $(a_ {beta})to -a_{2}$, whereas it should converge to $0$. This is a contradiction and so $L=0$ is not a limit.



(If you like things simple, than take Wojowu's advice form the comments and just show that $(a_{n^2-1})$ converges to $1$. )



Since no $L$ will do, we must conclude that $(a_n)$ diverges.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 1 '18 at 14:47

























answered Jan 14 '16 at 18:54









gebruikergebruiker

5,00851963




5,00851963












  • $begingroup$
    You're right. I will edit.
    $endgroup$
    – gebruiker
    Dec 1 '18 at 14:22










  • $begingroup$
    @matan129 Should work now
    $endgroup$
    – gebruiker
    Dec 1 '18 at 15:20


















  • $begingroup$
    You're right. I will edit.
    $endgroup$
    – gebruiker
    Dec 1 '18 at 14:22










  • $begingroup$
    @matan129 Should work now
    $endgroup$
    – gebruiker
    Dec 1 '18 at 15:20
















$begingroup$
You're right. I will edit.
$endgroup$
– gebruiker
Dec 1 '18 at 14:22




$begingroup$
You're right. I will edit.
$endgroup$
– gebruiker
Dec 1 '18 at 14:22












$begingroup$
@matan129 Should work now
$endgroup$
– gebruiker
Dec 1 '18 at 15:20




$begingroup$
@matan129 Should work now
$endgroup$
– gebruiker
Dec 1 '18 at 15:20


















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%2f1530554%2fproving-divergence-of-the-fraction-of-the-square-root%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

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Aardman Animations

Are they similar matrix