From 2015 National Countdown Round
- Author:
- Kevin Hopkins
This is a variation of the final countdown question (as reported at http://learninglab.wbur.org/2015/05/08/national-math-competition-comes-to-boston/) in the 2015 National MATHCOUNTS (http://www.mathcounts.org) competition.
This isn't much different from the handshake problem (http://tube.geogebra.org/student/b138355#material/142499). If there are n terms, then there are n*(n-1) places in the arithmetic progression that the two given numbers could go. The requirement that the terms be increasing (or it could be decreasing), means only half of these options will work.