{ "crt": { "congruences": [ { "remainder": 27, "modulus": 30 }, { "remainder": 27, "modulus": 35 }, { "remainder": 6, "modulus": 77 }, { "remainder": 7, "modulus": 20 } ], "question": "smallest x >= 0 satisfying x = remainder (mod modulus) for every congruence, and the modulus of the full solution set" }, "inverse": { "a": 345202631, "p": 1000000007, "question": "the integer y in [1, p-1] with a*y = 1 (mod p)" }, "coprime": { "N": 950822278567, "M": 2546940747, "question": "how many integers n with 1 <= n <= N have gcd(n, M) = 1" }, "divisor_sum": { "n": 80972119207, "question": "the sum of all positive divisors of n (including 1 and n)" } }