Suppose that a positive integer can be expressed as the sum of consecutive positive integers for but for no other values of . Considering all positive integers with this property, what is the smallest positive integer that occurs in any of these expressions?
Solution
We prove that the smallest value of is 16. Note that the expression for can be rewritten as , so that . In this expression, by requirement; because ; and obviously and have opposite parity. Conversely, for any factorization with and of opposite parity, we obtain an expression of in the desired form by taking , . We now note that is prime. (On the exam, solvers would have had to verify this by hand. Since , this can be done by trial division by the primes up to 43.) For not to have another expression of the specified form, it must be the case that has no odd divisor greater than 1; that is, must be a power of 2. This first occurs for , yielding the claimed result.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.