Re: Finding unique sums.
From: Mike Terry (news.dead.person.stones_at_darjeeling.plus.com)
Date: 11/23/04
- Next message: Dave Rusin: "Re: Determination of sine frequency"
- Previous message: Lynn Kurtz: "Re: solid angle"
- Maybe in reply to: matt: "Re: Finding unique sums."
- Next in thread: Gerry Myerson: "Re: Finding unique sums."
- Reply: Gerry Myerson: "Re: Finding unique sums."
- Messages sorted by: [ date ] [ thread ]
Date: Tue, 23 Nov 2004 00:19:03 -0000
"pradeep" <pradt@yahoo.com> wrote in message
news:8198af42.0411191652.20eb5bf1@posting.google.com...
> Hi,
>
> I'm trying to find a series where the sum of a subset of that
> is unique. Or in other words, I can find the numbers from sum.
>
> An example would be f(n)=2^n, you add any number of elements
> in this set, you'll get a number with all those bits set.
> But I'm looking for a series that does not grow geometrically..
>
> Thanks,
> Pradeep
Something a bit different (not better) from the other answers given...
How about the sequence
0.4142135623730950488016887242...
0.8284271247461900976033774484...
0.6568542494923801952067548968...
0.3137084989847603904135097936...
0.6274169979695207808270195873...
0.2548339959390415616540391747...
0.5096679918780831233080783494...
....
(Puzzle - is the sequence dense in [0,1]? (The sequence is 2^(n + 1/2) mod
1).)
Regards,
Mike.
- Next message: Dave Rusin: "Re: Determination of sine frequency"
- Previous message: Lynn Kurtz: "Re: solid angle"
- Maybe in reply to: matt: "Re: Finding unique sums."
- Next in thread: Gerry Myerson: "Re: Finding unique sums."
- Reply: Gerry Myerson: "Re: Finding unique sums."
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|