freeCodeCamp/curriculum/math-challenges/45-cryptography/primality-testing.json

58 lines
950 B
JSON

{
"name": "Primality testing",
"order": 12,
"challenges": [
{
"id": "59a5801209a6acac5983b677",
"title": "Legendre and Jacobi symbols",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983b211",
"title": "Solovay-Strassen algorithm",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983b212",
"title": "Miller-Rabin algorithm",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983b213",
"title": "Square roots modulo n",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}