Difference between revisions of "2006 AIME A Problems/Problem 13"
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | How many | + | How many [[integer]]s <math> N </math> less than 1000 can be written as the sum of <math> j </math> consecutive [[positive integer | positive]] [[odd integer]]s for exactly 5 values of <math> j\ge 1 </math>? |
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
| + | *[[2006 AIME II Problems/Problem 14 | Next problem]] | ||
| + | *[[2006 AIME II Problems/Problem 12 | Previous problem]] | ||
*[[2006 AIME II Problems]] | *[[2006 AIME II Problems]] | ||
| + | [[Category:Intermediate Number Theory Problems]] | ||
[[Category:Intermediate Combinatorics Problems]] | [[Category:Intermediate Combinatorics Problems]] | ||
Revision as of 16:02, 12 October 2006
Problem
How many integers 
less than 1000 can be written as the sum of 
consecutive positive odd integers for exactly 5 values of 
?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
