Write a java program to check whether the given number is neon number or not.

Example:

A Neon number is that number whose sum of digits of its square is equal to the original number. Example 9.

Neon Number Test

  1. Take input a number(num).
  2. Find square (sqr) of the number.
  3. Compute sum of digits of square (sum).
  4. If sum == num then its Neon Number else not.

Here is the java implementation of the above-described steps.

Output

Print all Neon Numbers in the Range

We need to print all Neon number in the given range using java. For this, we will loop through all numbers in the range and will individually check whether it is Neon number or not.

Output

If you have any suggestions or doubts then comment below.

Leave a Reply

Close Menu