Solving a Single Congruence Equation
|
04-18-2014, 05:24 PM
(This post was last modified: 07-25-2015 10:33 PM by Thomas Klemm.)
Post: #1
|
|||
|
|||
Solving a Single Congruence Equation
This program for the HP-42S solves for x in the equation:
A * x = B mod N Example: 5 * x = 3 mod 17 Solution: 5 ENTER 3 ENTER 17 XEQ "CONG" 4 Remark: Since overflow is avoided it's possible to solve: 999,999,999,989 * x = 1 mod 999,999,999,999 Solution: 899,999,999,999 |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
Solving a Single Congruence Equation - Thomas Klemm - 04-18-2014 05:24 PM
RE: Solving a Single Congruence Equation - Gerald H - 12-21-2014, 11:31 AM
RE: Solving a Single Congruence Equation - Ángel Martin - 07-24-2015, 12:23 PM
RE: Solving a Single Congruence Equation - Thomas Klemm - 07-24-2015, 08:00 PM
RE: Solving a Single Congruence Equation - Bunuel66 - 07-25-2015, 12:54 PM
RE: Solving a Single Congruence Equation - Thomas Klemm - 07-25-2015, 02:58 PM
RE: Solving a Single Congruence Equation - Bunuel66 - 07-25-2015, 09:04 PM
RE: Solving a Single Congruence Equation - Gerald H - 07-25-2015, 05:09 PM
RE: Solving a Single Congruence Equation - Thomas Klemm - 07-25-2015, 10:31 PM
RE: Solving a Single Congruence Equation - Thomas Klemm - 07-26-2015, 05:33 PM
|
User(s) browsing this thread: 1 Guest(s)