{
"topic": "primes-in-range",
"input_types": [
"int",
"int"
],
"input_labels": [
"m",
"n"
],
"input_values": [
"13",
"100"
],
"type": "Calculate",
"title": "Prime Numbers in Range",
"category": "Arithmetic",
"function": "function myFunc(arr) {\n let m = arr[0];\n let n = arr[1];\n if (m > n || m < 2) {\n return \"Invalid range. Please make sure m <= n, m > 2.\";\n }\n \n const isPrime = (number) => {\n if (number < 2) {\n return false;\n }\n \n for (let i = 2; i <= Math.sqrt(number); i++) {\n if (number % i === 0) {\n return false;\n }\n }\n \n return true;\n };\n \n const primes = [];\n \n for (let i = m; i <= n; i++) {\n if (isPrime(i)) {\n primes.push(i);\n }\n }\n \n return primes.join(\", \");\n }",
"op_label": "Prime Numbers in [m,n]",
"explanation": "An integer is a Prime number if it has only two factors: one and itself."
}