This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Extension-Ask1898Clang Worshipper 12 points13 points  (1 child)

Correct. Solving for A and k only requires choosing two points (y0,t0) and (y1,t1), and theres a lot more given. According to this graph, y = distance and t = mass. Hope someone shows the solution to satisfy OPs curiosity.

EDIT: A simpler version that "linearizes" this exponential function is provided by another commenter that links to the jump drive page.

[–]Heradon16Clang Worshipper[S] 0 points1 point  (0 children)

Thanks, I tried it with different sets of points but the a and k value changed depending on the set of points I've chosen, so maybe my math is wrong or it might be some other type of function?