Difference between revisions of "2006 AIME II Problems/Problem 13"
m |
m (→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | How many integers <math> N </math> less than 1000 can be written as the sum of <math> j </math> consecutive positive odd integers from exactly 5 values of <math> j\ge 1 | + | How many integers <math> N </math> less than 1000 can be written as the sum of <math> j </math> consecutive positive odd integers from exactly 5 values of <math> j\ge 1 </math>? |
== Solution == | == Solution == | ||
Revision as of 10:28, 15 November 2007
Problem
How many integers 
less than 1000 can be written as the sum of 
consecutive positive odd integers from exactly 5 values of 
?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2006 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 12 |
Followed by Problem 14 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
