Download samples/math-modular-l1/problems.json from iskyforce/rulebook-desk: direct link, hf CLI and curl.
- Browser
- Download file 627 Bytes
-
https://huggingface.co/datasets/iskyforce/rulebook-desk/resolve/main/samples/math-modular-l1/problems.json
- Command line
-
hf download hf://datasets/iskyforce/rulebook-desk/samples/math-modular-l1/problems.json
-
curl -L -o problems.json https://huggingface.co/datasets/iskyforce/rulebook-desk/resolve/main/samples/math-modular-l1/problems.json
627 Bytes
| { | |
| "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" | |
| } | |
| } | |