MathDB

A game involves jumping to the right on the real number line. If

a

and

b

are real numbers and

b>a,

the cost of jumping from

a

b

is b^3\minus{}ab^2. For what real numbers

c

can one travel from

0

1

in a finite number of jumps with total cost exactly

c?

Problem Statement