Robert1986
- 825
- 2
epr2008 said:Any number c in the real numbers has the form x.{c_1}{c_2}...{c_n}, in which x is an integer and 0 \le {c_n} \le 9 is a natural number. From the way that we have enumerated the decimal places, clearly number of decimal places is countable. Then there is a bijection from the indexes of the decimal places onto the set of the first n natural numbers. Consider the irrational numbers, namely \mathop {\lim }\limits_{n \to \infty } (x.{c_1}{c_2}...{c_n}). The infinity in the enumeration of decimal places must then be the same infinity as that of the natural numbers. Then, \mathop {\lim }\limits_{n \to \infty } [\frac{{{{10}^n}}}{{{{10}^n}}}(x.{c_1}{c_2}...{c_n})] = \frac{{\mathop {\lim }\limits_{n \to \infty } ({{10}^n} \times x.{c_1}{c_2}...{c_n})}}{{\mathop {\lim }\limits_{n \to \infty } {{10}^n}}} = {\lim }\limits_{n \to \infty } (x.{c_1}{c_2}...{c_n}). Is a rational expression in which the numerator and denominator are both integers.
If we consider Euclid's argument and acknowledge that the factor in the numerator is not unique in yielding an integer multiple then we can understand Euclid's flaw. The numerators and denominators will have infinite prime factorizations and therefore it would be impossible to simplify the fraction.
As an additional response to this already completely debunked, completely asinine post, I'll point out that it is absolutely no surprise that it is possible to express irrational numbers as an infinite sum, which is exactly what you have done.
As a side note, assuming that what you have written actually makes any sense, I would really like to know what you have allegedly proven about prime numbers