18 lines
499 B
OCaml
18 lines
499 B
OCaml
(** Chinese remainder theorem *)
|
|
|
|
open Builtin
|
|
open Basic_arithmetics
|
|
|
|
(** Image of the Chinese Remainder map
|
|
@param x positive integer of which you take image
|
|
@param l list of pairwise relatively prime positive integers.
|
|
*)
|
|
let crt_image x l = []
|
|
|
|
(** Inverse image of Chinese Remainder map
|
|
@para m a positive integer
|
|
@param l list of pairwise relatively prime factors of m
|
|
@param y list of remainders modulo pairwise relatively prime factors of m
|
|
*)
|
|
let crt_solver m l y = 0
|