Content deleted Content added
Filled in 1 bare reference(s) with reFill 2 |
No edit summary |
||
Line 69:
## Interpret next ''b'' bits as a binary number ''r'''. If <math>r' < 2^{b+1}-M</math> holds, then the reminder <math> r = r' </math>
## Otherwise interpret ''b + 1'' bits as a binary number ''r''', the reminder is given by <math>r = r' - 2^{b+1} + M</math>
# Compute <math>N = q *
== Example ==
| |||