How to solve $ab\bmod c = d$

Asked Aug 03 '17 at 01:06

Active Aug 03 '17 at 02:51

Viewed 64 times

How can $ab\bmod c = d$ be solved, if $b$, $c$ and $d$ are known?

A similar algorithm is used by LCGs (weak PRNG) to give random values. To solve this, I used WolframAlpha which quickly solved, but shown nothing about process.

What is the process to solve such problems?

edited Aug 03 '17 at 02:51

Michael Hardy

asked Aug 03 '17 at 01:06

iovoid

See this answer for a handful of ways to solve $\ bx\equiv d\pmod{!c}\ \ $ – Bill Dubuque Aug 03 '17 at 01:14
How can that be applied here? If I am not wrong, d mod c is constant. – iovoid Aug 03 '17 at 01:44
The usual notation for this is $$ab \equiv d \pmod c$$ – Théophile Aug 03 '17 at 02:55

How to solve $ab\bmod c = d$

0 Answers0