liveBook · Manning

Multiplicative inverse

A multiplicative inverse of an element is another element whose product with it equals the multiplicative identity.

How 2 Manning books explain it

Hacking Cryptography

A multiplicative inverse of an element is another element whose product with it equals the multiplicative identity in the relevant group.

How it is used
Recovers an LCG multiplier from outputs and derives the RSA private exponent from a public exponent.
How deep it goes
Works through modular inversion with a clock example and Go call, while deferring big-number-library detail and RSA correctness proof.
Examples
Uses 7 modulo 12, LCG output differences, Go’s ModInverse call, and an RSA keypair with p = 193 and q = 727.
What you can do after
Apply it via Go’s math/big library to recover an LCG multiplier or calculate an RSA private exponent.

Read how Hacking Cryptography explains multiplicative inverse →

Modern C, Third Edition

A multiplicative inverse of a nonzero number is a number whose product with it equals one.

How it is used
Uses inverse approximation to demonstrate while, for, break, and continue iteration patterns.
How deep it goes
Explains the stopping test and update formula, but stops short of deriving Heron approximation mathematically.
Examples
Demonstrates inverses for 0.07, 5, and 6E+23, reporting approximations whose products approach one.
What you can do after
Build it from scratch in C using scaling, Heron updates, precision checks, and iteration safeguards.

Read how Modern C, Third Edition explains multiplicative inverse →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.