Re: Finding unique sums.

From: Proginoskes (proginoskes_at_email.msn.com)
Date: 11/20/04 

Date: 20 Nov 2004 14:08:52 -0800

pradt@yahoo.com (pradeep) 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..

What about f(n) = 1/2^n (or 1/a^n, where a >= 2)? Does that count?
     -- Christopher Heckman