Program to check if N is a Icositetragonal number
Given an integer N, the task is to check if it is a icositetragonal number or not.
s a class of figurate number. It has a 24-sided polygon called Icositetragon. The N-th Icositetragonal number count’s the number of dots and all others dots are surrounding with a common sharing corner and make a pattern
The first few icositetragonal numbers are 1, 24, 69, 136, 225, 336, …
Input: N = 24
Second icositetragonal number is 24.
Input: N = 30
- The Kth term of the icositetragonal number is given as
- As we have to check that the given number can be expressed as a icositetragonal 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 icositetragonal number.
Below is the implementation of the above approach:
Time Complexity: O(1)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.