Should i ignore a as given by ncsupanda. I don't think that ignoring 'a' is right.
Also, is this the right formula? If so, A=a?
Mathematically as long as the "a" value remains constant during each new iteration then the effect it has is constant - it's not unnecessary, it just doesn't need to be evaluated for, so it should be fine to set as any integer and leave it alone.
Also, is this the right formula? If so, A=a?
I think 'a' is an arbitrary constant provided by Evil-Knievel
From the problem description "Being a some constant," I think is meant to be interpreted as
Code:
'a' being some constant
Quote
How often do you have to perform this operation to get a specific x (basically getting the new_x and feeding it back into the formula to get another new_x, and so on)?
that is the exact operation I did. So I was not wrong?
Here's my thinking on the question...
x_0 is always 9
a is an arbitrary constant
G is the end goal, also an arbitrary number chosen by Evil-Knievel
_i is the number of steps through the recursive function you must take to reach G
Evil-Knievel is looking for a way to solve '_i' provided any 'a' and any 'G'
EDIT: That's not just standard division, it's as he mentioned using inverse modular multiplication, but visually it's depicted as division.