File size: 627 Bytes
cf39142
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
{
  "crt": {
    "congruences": [
      {
        "remainder": 4,
        "modulus": 11
      },
      {
        "remainder": 8,
        "modulus": 9
      },
      {
        "remainder": 9,
        "modulus": 19
      }
    ],
    "question": "smallest x >= 0 satisfying x = remainder (mod modulus) for every congruence, and the modulus of the full solution set"
  },
  "inverse": {
    "a": 728485659,
    "p": 998244353,
    "question": "the integer y in [1, p-1] with a*y = 1 (mod p)"
  },
  "coprime": {
    "N": 983018907,
    "M": 4058005,
    "question": "how many integers n with 1 <= n <= N have gcd(n, M) = 1"
  }
}