Given a number N, the task is to find Nth Enneacontagon number.
A Enneacontagon number. is class of figurate number. It has 90 – sided polygon called enneacontagon. The N-th enneacontagon number count’s the 90 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few enneacontagonol numbers are 1, 90, 267, 532 …
Input: N = 2
The second enneacontagonol number is 90.
Input: N = 3
Approach: The N-th enneacontagon number is given by the formula:
- Nth term of s sided polygon =
- Therefore Nth term of 90 sided polygon is
Below is the implementation of the above approach:
3rd enneacontagon Number is = 267
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.
- Number of factors of very large number N modulo M where M is any prime number
- Count number of triplets with product equal to given number with duplicates allowed
- Find the largest number smaller than integer N with maximum number of set bits
- Find minimum number to be divided to make a number a perfect square
- Count number of trailing zeros in Binary representation of a number using Bitset
- Largest number dividing maximum number of elements in the array
- Given number of matches played, find number of teams in tournament
- Number of ways to split a binary number such that every part is divisible by 2
- Previous perfect square and cube number smaller than number N
- Smallest number dividing minimum number of elements in the array | Set 2
- Smallest number dividing minimum number of elements in the Array
- Number of distinct ways to represent a number as sum of K unique primes
- Find the number of positive integers less than or equal to N that have an odd number of digits
- Minimum divisor of a number to make the number perfect cube
- Number of possible permutations when absolute difference between number of elements to the right and left are given
- Minimum number of swaps required to make a number divisible by 60
- Number of times the largest perfect square number can be subtracted from N
- Find the minimum number to be added to N to make it a prime number
- Find smallest possible Number from a given large Number with same count of digits
- Count number of ways to divide a number in 4 parts
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.