Expand Messages
• 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
Message 1 of 4 , Jun 26 11:23 PM
• 0 Attachment
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 one line: print( x= ,(-741111/7891274897124871191)%328932709163239949) x=228005203696384724 David
Message 2 of 4 , Jun 27 12:41 PM
• 0 Attachment
Norman Luhn <n.luhn@...> wrote:

> 328932709163239949 is factor of ( x * 7891274897124871191 + 741111)
> I need maybe <<50 steps to find x.

In one line:

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

x=228005203696384724

David
• ... By hand, uses Euclid: http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm David
Message 3 of 4 , Jun 27 12:59 PM
• 0 Attachment
--- 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
Message 4 of 4 , Jun 27 1:20 PM
• 0 Attachment
PS: To do this by hand, use
http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm

> print("x=",(-741111/7891274897124871191)%328932709163239949)
>
> x=228005203696384724
Your message has been successfully submitted and would be delivered to recipients shortly.