doronshadmi
Penultimate Amazing
- Joined
- Mar 15, 2008
- Messages
- 13,320
Dear jsfisher are there finitely or infinitely many elements in sequence (0.910, 0.0910, 0.00910, ...) that all of them are used in order to construct 0.910+0.0910+0.00910+ ... = 0.999...10 (such that 0.999...10 is not less than the sum over all (0.910, 0.0910, 0.00910, ...) elements) ?Look at the definition for 'limit' as the domain variable tends to "infinity". No where does "infinity" of any form find its way into the definition, and no where does "infinity" of any form find its way into the proof.
-------------------------
Once again:
for all ε > 0, there exists a natural number N in N such that for all n ≥ N, |an - L| < ε.
So |an - L| must be = 0 in order to conclude that the sum over an = L.
It must be stressed that if infinity is not involved here, then |an - L| > 0 and we can't conclude that the sum over an = L.
For example, where is the rigorous proof that the sum over all (0.910, 0.0910, 0.00910,...) = L = 1?
(My solution is given in http://www.internationalskeptics.com/forums/showpost.php?p=10617467&postcount=316).
Last edited: