CRApackage(R)

cra.spad line 1 [edit on github]

• R : EuclideanDomain

This package implements asymptotically efficient Chinese reconstruction

chineseRemainder : (List(R), List(R)) -> R

chineseRemainder(lv, lm) returns a value v such that, if x is lv.i modulo lm.i for all i, then x is v modulo lm(1)*lm(2)*...*lm(n).

chineseRemainder : (List(List(R)), List(R)) -> List(R)

chineseRemainder(llv, lm) returns a list of values, each of which corresponds to the Chinese remainder of the associated element of llv and lm. This is more efficient than applying chineseRemainder several times.

modTree : (R, List(R)) -> List(R)

modTree(r, l) is undocumented

multiEuclideanTree : (List(R), R) -> List(R)

multiEuclideanTree(l, r) is undocumented