Chinese remainder theorem: Difference between revisions
→{{header|Frink}}
(Frink) |
|||
Line 973:
=={{header|Frink}}==
This example solves an extended version of the Chinese Remainder theorem by allowing an optional third parameter <CODE>d</CODE> which is an integer. The solution returned is the smallest solution >= d. This program also works with arbitrarily-large integers.
<lang frink>/** arguments:
[r, m, d=0] where r and m are arrays of the remainder terms r and the
| |||