Re: Problems I have with 1.999...=2


Kirby Cook wrote:
> stephen@xxxxxxxxxx wrote:
> > That is true. 1 is not a member of the set { .9, .99, .999, ... }.

> > But if .999.... is a set, then it is not a number,
> > and the question does 1=.999.... does not make much sense.
> > If you interpret .999.... as a number, which is what most people
> > do, then you really do not have a lot of choices about what number
> > it is.
> >
> > Stephen
>
> Since the preceding post could only be described as inattentive, I
was
> going to ignore it. But I won't, after all.
> My point, which I consider sufficient, is that .999... is a member of

> the described set, and 1 isn't.

Your "point" is incorrect. The set consists of strings of
9's which end. 0.999... does not. It's not a member of
the set.

- Randy

.

Relevant Pages

  • Re: large dimension with many member properties
    ... This is discussed in both the Analysis Services Perf and Operations Guides. ... Storage is dependent on the number of *independent* strings in a member ... if you had member property called "Gender" which contained one ... that the member property can be used as virtual dimension since the end-user ...
    (microsoft.public.sqlserver.olap)
  • Re: Orlow cardinality question
    ... >> Given a set of symbols with size S, we can produce a set of all strings using ... >> If we want to have an infinite ... > each member and thus injects S into a proper subset of itself. ... > largest member, it satisfies the Cantor definition of not-finite, too. ...
    (sci.math)
  • Re: Orlow cardinality question
    ... >> Given a set of symbols with size S, we can produce a set of all strings using ... >> If we want to have an infinite ... > each member and thus injects S into a proper subset of itself. ... Yep Cantor screwed up. ...
    (sci.math)
  • Re: Orlow cardinality question
    ... >> In the above TO makes the assumption that a set of finite strings ... > An infinite set of strings constructed from a finite set of symbols ... >> has a first member and last member relative to that ordering. ... member, and if the set is well-ordered as are tne naturals it, some ...
    (sci.math)
  • Re: Orlow cardinality question
    ... > Given a set of symbols with size S, we can produce a set of all strings using ... > If we want to have an infinite ... each member and thus injects S into a proper subset of itself. ... infinite string is shown to be false, at least by the Cantor standard of ...
    (sci.math)