- what is the best way to calculate (per hand) x of

1009 is factor of ( x * 577 +233 ).

12 years ago I found a solution for every combination but maybe it is not the fastest way.

Example:

328932709163239949 is factor of ( x * 7891274897124871191 + 741111)

I need maybe <<50 steps to find x.

Thanks.

[Non-text portions of this message have been removed] - --- In primenumbers@yahoogroups.com,

Norman Luhn <n.luhn@...> wrote:

> 328932709163239949 is factor of ( x * 7891274897124871191 + 741111)

In one line:

> I need maybe <<50 steps to find x.

print("x=",(-741111/7891274897124871191)%328932709163239949)

x=228005203696384724

David - --- In primenumbers@yahoogroups.com, Norman Luhn <n.luhn@...> wrote:

> what is the best way to calculate (per hand)

By hand, uses Euclid:

http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm

David - PS: To do this by hand, use

http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm

> print("x=",(-741111/7891274897124871191)%328932709163239949)

>

> x=228005203696384724