function Solve(arr) { var start = arr[0]; var end = arr[1]; function isFib(val) { var prev = 0; var curr = 1; while (prev <= val) { if (prev === val) { return true; } curr = prev + curr; prev = curr - prev; } } var result = "\n\n"; for (var i = start; i <= end; i++) { if (isFib(i) === true) { result += "\n"; } else { result += "\n"; } } result += "
NumSquareFib
" + i + "" + Math.pow(i, 2) + "" + "yes" + "
" + i + "" + Math.pow(i, 2) + "" + "no" + "
"; //console.log(result); return result; }