Neon Number in a Range Using Iteration
In this approach, we iterate through each number in the given range and check if it’s a Neon number by calculating the sum of digits of the square of the number.
Example: The below code example Uses the simple iteration Method to find a Neon number in a Range in JavaScript.
Javascript
function isNeon(number) { let square = number * number; let sum = 0; while (square > 0) { sum += square % 10; square = Math.floor(square / 10); } return sum === number;}function findNeonNumbersInRange(start, end) { let neonNumbers = []; for (let i = start; i <= end; i++) { if (isNeon(i)) { neonNumbers.push(i); } } return neonNumbers;}console.log(findNeonNumbersInRange(1, 100)); |
Output
[ 1, 9 ]
JavaScript Program to Find Neon Number in a Range
A Neon number is a number where the sum of digits of the square of the number is equal to the number itself. For example, 9 is a Neon number because 9^2 = 81 and the sum of digits of 81 is 8 + 1 = 9, which is the number itself. We want to find all the Neon numbers within a given range.
Below are the approaches to find Neon Numbers in a Range:
Table of Content
- Using Iteration
- Using recursion
- Using JavaScript built-in methods
Contact Us