
Last chance! 50% off unlimited learning
Sale ends in
Solves the modular equation a x = b mod n
.
modlin(a, b, n)
integer scalars
Returns a vector of integer solutions.
Solves the modular equation a x = b mod n
. This eqation is solvable
if and only if gcd(a,n)|b
. The function uses the extended greatest
common divisor approach.
# NOT RUN {
modlin(14, 30, 100) # 95 45
modlin(3, 4, 5) # 3
modlin(3, 5, 6) # []
modlin(3, 6, 9) # 2 5 8
# }
Run the code above in your browser using DataLab