Prove Xn->x is Integer if Xn is Sequence of Real Numbers

  • Thread starter Thread starter sleventh
  • Start date Start date
  • Tags Tags
    Integers Sequence
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
8 replies · 3K views
sleventh
Messages
61
Reaction score
0
if Xn is a sequence of integers and Xn--->x as n----> infinity and x is an element of the reals. show that x must be an integer.

i know that since the sequence is convergent it will be bounded. i don't however see how i can prove the above. thank you very much for any help.
 
on Phys.org
im not exactly sure what you mean by ''bounded away'', is this the same as will not converge? it seems to me that even if x were a real value that |Xn-x|<e given that e>0. is this wrong?
 
If [itex]x_n\to x[/itex], then, given any [itex]\epsilon[/itex], there exist N such that if n> N, [itex]|x- x_n|< \epsilon[/itex]. Take [itex]\epsilon[/itex] to be less than 1 and remember that [itex]x_n[/itex] is an integer.
 
using what you said in that a convergent sequence has a cauchy sequence, and from hallsofly, could the argument go as follows:
the sequence Xn converges and therefore is a cauchy sequence, by definition for any value n,m>N where N is a natural number |Xn-Xm|<e, given e>0 must be true. each element of Xn,m however is an integer and by the commutative ring of integers Xn-Xm will also produce an integer. if x were a real number it would then be between to integer values. The nearest value Xn can assume are these two integers, therefore taking e<1 |Xn-Xm|<e will not hold
 
it seems like i need to show that x must be an integer in order for the |Xn-x| to equal zero, but i do not see why |Xn-x|<e would not hold if Xn was an integer and x Real. is it because there is a set distance between a integer and a real value, and if epsilon was set to be this value, |Xn-x|could not be less then epsilon?
 
sleventh said:
it seems like i need to show that x must be an integer in order for the |Xn-x| to equal zero, but i do not see why |Xn-x|<e would not hold if Xn was an integer and x Real. is it because there is a set distance between a integer and a real value, and if epsilon was set to be this value, |Xn-x|could not be less then epsilon?
Integers are real numbers! The converse is not necessarily true, though.

If you have a sequence of integers, it either doesn't converge or converges to an integer. Examples of each kind:
{1, 2, 3, 4, ..., n, ...}
{4, 3, 2, 1, 0, 0, 0, ..., 0, ...}
 
assuming x is a value between two successive integers, there will be a finite distance E between x and the nearest integer. if e<E then |Xn-x|<e will not hold. therefore by contradiction x must be an integer. This also shows that |Xn-x|=0, and therefore Xn will eventually be a constant value.
How does that sound?