I am working on a computer program that determines the minimum time it will take for a subway train to go from one station to the next based on a few parameters: The parameters to the problem are all positive integers not greater than 1000. * d - the distance between stations, in metres * m - the maximum allowable speed of the train, in metres/sec * a - the maximum absolute acceleration of the train, in metres/sec2 * j - the maximum absolute jerk, in metres/sec3 The train must be completely stopped at each station and must move in one direction at speeds not exceeding m. Acceleration can be positive (forward) or negative (backwards) but its absolute value must not exceed a. The last parameter, jerk, is the rate of change of acceleration in either direction. That is, acceleration cannot increase or decrease at greater than this rate. This parameter prevents toppling the standing passengers. For example, if the inputs are: d = 1000 m = 70 a = 20 j = 1 The correct answer to 3 sig figs is 31.7 I have gotten close to this, but I am missing something. Basically, I am looking for the math to figure out the problem. Thanks in advance.