Given an integer N, the task is to check if it is a star number or not.
Star number is a centered figurate number that represents a centered hexagram (six-pointed star) similar to Chinese checker game. The first few Star numbers are 1, 13, 37, 73 …
Input: N = 13
Second star number is 13.
Second star number is 13, where as 37 is third.
Therefore, 14 is not a star number.
- The Kth term of the star number is given as
- As we have to check that the given number can be expressed as a star number or not. This can be checked as follows –
- Finally, check the value of computed using this formulae is an integer, which means that N is a star number.
Below is the implementation of the above approach:
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Program to find Star number
- Program to print number with star pattern
- Program for Arrow Star Pattern
- Program to print diagonal star patterns
- Program to print half Diamond star pattern
- Program to print hollow rectangle or square star patterns
- Program to check whether a number is Proth number or not
- Program to check whether the given number is Buzz Number or not
- Program to check if N is a Decagonal Number
- Program to check if N is an Icosikaioctagonal Number
- Program to check if N is a Octagonal Number
- Program to check if N is a Octadecagon number
- Program to check if N is a Tetradecagonal Number
- Program to check if N is a Nonagonal Number
- Program to check if N is a Enneadecagonal Number
- Program to check if N is a Dodecagonal Number
- Program to check Plus Perfect Number
- Program to check if N is a Hexadecagonal Number
- Program to check if N is a Myriagon Number
- Program to check if N is a Heptagonal Number
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.