Simple binary conversion, except as the problem is written, it would take 11
envelopes should the son be asked for 0 dollars ("no matter what number of
dollars I ask for, you can give me one or more envelopes"! The 11 envelopes
would contain 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, and 489 respectively!!!!

Signed,
        Just a "nit picking" Engineer!

> ----------
> From:         Bonnie Rowley[SMTP:[log in to unmask]]
> Reply To:     Parkinson's Information Exchange Network
> Sent:         Sunday, January 16, 2000 2:12 PM
> To:   [log in to unmask]
> Subject:      Is anyone on PIE bored? [sparkle] Riddle #8
>
> He used a shredder & then wrote IOU's.
>
> In a message dated 1/16/00 9:00:08 AM Eastern Standard Time,
> [log in to unmask] writes:
>
> > A man told his son that he would give him $1000 if he could accomplish
> the
> >  following task. The father gave his son ten envelopes and a thousand
> >  dollars, all in one dollar bills. He told his son, "Place the money in
> the
> >  envelopes in such a manner that no matter what number of dollars I ask
> for,
> >  you can give me one or more of the envelopes, containing the exact
> amount I
> >  asked for without having to open any of the envelopes. If you can do
> this,
> >  you will keep the $1000."
> >
> >  When the father asked for a sum of money, the son was able to give him
> >  envelopes containing the exact amount of money asked for. How did the
> son
> >  distribute the money among the ten envelopes?
> >
> >
>