Browse Groups

• 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
View Source
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 1 of 4 , Jun 27
View Source
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 1 of 4 , Jun 27
View Source
--- 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 1 of 4 , Jun 27
View Source
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.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.