20190619, 01:06  #1 
"Marv"
May 2009
near the TannhÃ¤user Gate
2A6_{16} Posts 
How does this compute
Can someone please explain how this Mod is computed?
TIA Code:
(20:02) gp > (Mod(2633043,8388607)/9) %1 = Mod(5884965, 8388607) (20:02) gp > lift(%1) %2 = 5884965] 
20190619, 01:15  #2  
Sep 2002
Database er0rr
7536_{8} Posts 
Quote:
Then 2633043/9 mod 8388607 Then "lifts" it to an integer. It does the division by some kind of extended euclidian algorithm. Note that gcd(8388607,9)==1 must be so. 9 * 5884965 == 2633043 mod 8388607 That is 8388607 divides 9 * 5884965  2633043 Last fiddled with by paulunderwood on 20190619 at 01:18 

20190619, 01:17  #3 
Apr 2019
315_{8} Posts 
https://en.wikipedia.org/wiki/Modula...cative_inverse
Code:
? Mod(2633043,8388607)/9 %5 = Mod(5884965, 8388607) ? Mod(9,8388607)^1 %6 = Mod(1864135, 8388607) ? Mod(1/9,8388607) %7 = Mod(1864135, 8388607) ? Mod(2633043*1864135, 8388607) %8 = Mod(5884965, 8388607) ? 
20190622, 14:48  #4 
"Marv"
May 2009
near the TannhÃ¤user Gate
2×3×113 Posts 
Thanks ! I appreciate your time.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Google compute engine  pepi37  Software  14  20180908 01:26 
New GPU Compute System  airsquirrels  GPU Computing  90  20171208 00:13 
Piddling Around With Big Compute Power  NBtarheel_33  GPU Computing  54  20130515 03:32 
New Compute Box  Christenson  Hardware  0  20110115 04:44 
My throughput does not compute...  petrw1  Hardware  9  20070813 14:38 