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 rightmost a (an) varying fastest.
A051854
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 rightmost a (an) varying fastest.
Terms
- a(0) =1a(1) =1a(2) =5a(3) =1a(4) =7a(5) =13a(6) =19a(7) =11a(8) =17a(9) =23a(10) =29a(11) =1a(12) =121a(13) =31a(14) =151a(15) =61a(16) =181a(17) =127a(18) =37a(19) =157a(20) =67a(21) =187a(22) =97a(23) =43a(24) =163a(25) =73a(26) =193a(27) =103a(28) =13a(29) =169
External references
- oeis: A051854