MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Hi, Is there any known sequence such that the sum of a combination of one subsequence never equals another subsequence sum. The subsequences should have elements only from the parent sequence.

Thanks Sundi

share|cite|improve this question

closed as off-topic by Ricardo Andrade, Evan Jenkins, Steven Landsburg, Andrés Caicedo, Andrey Rekalo Oct 19 '13 at 7:39

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question does not appear to be about research level mathematics within the scope defined in the help center." – Ricardo Andrade, Evan Jenkins, Steven Landsburg, Andrés Caicedo, Andrey Rekalo
If this question can be reworded to fit the rules in the help center, please edit the question.

The sequence $.1, .01, .001, .0001,\ldots$ will do the trick. – Barry Cipra May 9 '13 at 13:53

got it, thanks, just a gp series would do. 1,2,4,8,16...

share|cite|improve this answer

Other sequences that immediately come to mind are vector-like expressions $$(1, 0, 0, 0, 0, ...), (0, 1, 0, 0, 0, ...) , (0, 0, 1, 0, 0, ...), ...$$ (or matrices or tensors) or the sequence $(a_n)$ of approximations of transcendentals like Liouville's number $$a_n = \sum_{k=0}^{n} \frac{1}{k!}$$ or just terminating rationals with different points of termination behind the decimal point $$0.1, 0.11, 0.111, ...$$ or before$$1, 10, 100, ... $$

But that's already very close to the first answer.

share|cite|improve this answer
Thanks a lot Sundi – jyotirmoy sundi Apr 26 '13 at 1:34

Not the answer you're looking for? Browse other questions tagged or ask your own question.