Description: X = LINCON(A,B,N) solves the system of linear congruences
A(1)* X == B(1) (mod N(1))
A(2)* X == B(2) (mod N(2))
...
A(m)* X == B(m) (mod N(m))
The solution, X, will be given as a vector [x1 x2] representing the general solution
X == x1 (mod x2)
Any specific answer can be found by letting X = x1+ x2* k for any integer value of k.
If no solution exists [NaN NaN] will be returned.
A scalar input functions as a constant vector of the same size as the other inputs.
Program is compatible with Variable Precision Integer Arithmetic Toolbox available on File Exchange (#22725) Use of VPI is recommended for large magnitude inputs or outputs. If VPI is not used and internal calculations exceed largest consecutive flint a warning will be given that results may be inaccurate, along with [NaN NaN].
To Search:
File list (Check if you may need any files):
lincon.m
license.txt
Download