MathDB
Sum of Differences

Source:

March 15, 2010

Problem Statement

Let there be 50 natural numbers ai a_i such that 0<a1<a2<...<a50<150 0 < a_1 < a_2 < ... < a_{50} < 150. What is the greatest possible sum of the differences dj d_j where each d_j \equal{} a_{j \plus{} 1} \minus{} a_j?