Table of solutions to all possible Chinese Remainder Equations x = a1 mod p1, x = a2 mod p2, ..., x = an mod pn, where p1 - pn are the first n primes and each a1 - an varies between 1 and (its respective) p-1, with the leftmost a varying fastest.

A051853

Table of solutions to all possible Chinese Remainder Equations x = a1 mod p1, x = a2 mod p2, ..., x = an mod pn, where p1 - pn are the first n primes and each a1 - an varies between 1 and (its respective) p-1, with the leftmost a varying fastest.

Terms

    a(0) =1a(1) =1a(2) =5a(3) =1a(4) =11a(5) =7a(6) =17a(7) =13a(8) =23a(9) =19a(10) =29a(11) =1a(12) =71a(13) =127a(14) =197a(15) =43a(16) =113a(17) =169a(18) =29a(19) =121a(20) =191a(21) =37a(22) =107a(23) =163a(24) =23a(25) =79a(26) =149a(27) =31a(28) =101a(29) =157

External references