I'm having trouble setting up a case and proving through induction or whether there is a better way to prove this.
3 Answers
Every multiple of 4 works:
$$ 4n = (2n-1)+(2n+1) $$
Every odd composite number works. If $1<a<b$, then $$ ab = (b-a+1)+(b-a+3)+\ldots+(b+a-3)+(b+a-1) $$ and the terms are odd if $a$ and $b$ are both odd.
Primes don't work, because the sum of an arithmetic series is the product of its length and its average term, and when the step size is 2 the average term is an integer.
Twice an odd number doesn't work, because then the series must either have an odd number of terms and an even average, or an even number of terms and an odd average. In both cases, the terms will be even rather than odd.
- 286,031
-
I need clarification for prime cases and the "twice an odd number case" – user61646 Feb 10 '13 at 18:56
-
@user61646: The sum is always the product of the length of the series and the average term. The length of series is explicitly specified to be greater than $1$ and the average term cannot be $1$ unless we're considering negative integers too. So the sum can never be prime. (Unless we are considering negative integers, in which every odd sum except $\pm 1$ can be produced by the $ab$ formula with $b=\pm1$). What don't you understand about the twice-and-odd-number case? – hmakholm left over Monica Feb 10 '13 at 19:02
Hint: Fix some $n$. Find the sum of the first $n$ odd numbers, i.e. $$1+3+\cdots+(2n-1)$$ (induction is useful for this). Then the numbers that can be written as a sum of $n$ consecutive odd numbers are the number you found above, plus $2kn$ for some integer $k$, because $$(2k+1)+(2k+3)+\cdots+(2k+2n-1)=2kn+1+3+\cdots+(2n-1).$$
- 129,973
Clearly a sum of consecutive odd numbers is of the form $$o \,+\, o\!+\!2 \,+\, o\!+\!4 \,+\, \ldots \,+\, o\!+\!2k = ok + 2T(k) = o(k+1) + \frac{k(k+1)}{2}$$ and since every odd number is of the form $2h+1$ we find the numbers expressive as a sum of consecutive odd numbers are exactly the numbers $$\frac{(4h+k+2)(k+1)}{2}.$$