The Greatest Common Divisor (GCD) of two or more integers is the largest positive integer that divides each of the given numbers without leaving a remainder.
{
"topic": "gcd",
"input_types": [
"text"
],
"input_labels": [
"numbers"
],
"input_values": [
"10, 40, 15"
],
"type": "Calculate",
"title": "GCD",
"category": "Arithmetic",
"function": "function myFunc(arr) {\n let ip = arr[0];\n if (!ip) return \"No values provided.\";\n const numbers = ip.split(',').filter(value => value.trim() !== '').map(value => Number(value.trim()));\n if (numbers.some(isNaN)) return \"Please provide a valid list of numbers.\";\n const calculateGCD = (x, y) => (y === 0 ? x : calculateGCD(y, x % y));\n let gcd = numbers[0];\n for (let i = 1; i < numbers.length; i++) {\n gcd = calculateGCD(gcd, numbers[i]);\n }\n return gcd;\n }",
"op_label": "GCD",
"explanation": "The Greatest Common Divisor (GCD) of two or more integers is the largest positive integer that divides each of the given numbers without leaving a remainder."
}