{
"topic": "check-prime",
"input_types": [
"int"
],
"input_labels": [
"n"
],
"input_values": [
"13"
],
"type": "Check",
"title": "Prime Number",
"category": "Arithmetic",
"function": "function myFunc(arr) {\n let n = arr[0];\n if (n <= 1) {\n return n+' is not Prime number.';\n }\n \n for (let i = 2; i <= Math.sqrt(n); i++) {\n if (n % i === 0) {\n return n+' is not Prime number.';\n }\n }\n \n return n+' is Prime number.';\n }",
"op_label": "Result",
"explanation": "Given number is a Prime number if it has only two factors: one and itself."
}