Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

Possible Duplicate:
Prove that all even integers $n \neq 2^k$ are expressible as a sum of consecutive positive integers

Some natural numbers can be expressed as a sum of consecutive natural numbers in more than one way. For example, $7$ can get expressed both as $7$, and $(3+4).$ In terms of a sum of consecutive numbers, $4$ and $8$ can only get expressed as $4$, and $8$ respectively. Call such numbers consecutive-primes. How many consecutive-primes exist? Given all previous consecutive-primes, is there a way to compute the next consecutive-prime?

share|cite|improve this question

marked as duplicate by Ross Millikan, ShreevatsaR, Chris Eagle, t.b., Zev Chonoles May 19 '12 at 18:32

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

The powers of $2$ are the only ones. The problem has been solved on this site, probably repeatedly. Here is a link. – André Nicolas May 2 '12 at 13:57

Only powers of 2 have exactly 1 odd divisor.

share|cite|improve this answer
Huh? What do you mean by "odd divisor"? I mean, 3 only has one divisor (discounting 1), which is odd, if by "odd divisor" you mean a divisor which is odd. Also, how does the notion of "divisor" end up relating here? – Doug Spoonwood May 2 '12 at 12:38
@DougSpoonwood Can you see how to use an odd divisor to create a sum of consecutive numbers? Hint: 3=0+1+2 – Mark Bennet May 2 '12 at 12:49

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