Saturday, December 28, 2024
Google search engine
HomeData Modelling & AIProgram to check if N is a Icositetragonal number

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.

icositetragonal number
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, …

Examples: 

Input: N = 24 
Output: Yes 
Explanation: 
Second icositetragonal number is 24.

Input: N = 30 
Output: No 

Approach: 

1. The Kth term of the icositetragonal number is given as
K^{th} Term = \frac{22*K^{2} - 20*K}{2}

2. As we have to check that the given number can be expressed as a icositetragonal number or not. This can be checked as follows – 

=> N = \frac{22*K^{2} - 20*K}{2}
=> K = \frac{10 + \sqrt{44*N + 100}}{22}
 

3. Finally, check the value computed using this formula is an integer, which means that N is a icositetragonal number.

Below is the implementation of the above approach:

C++




// C++ implementation to check that
// a number is icositetragonal number or not
 
#include <bits/stdc++.h>
 
using namespace std;
 
// Function to check that the
// number is a icositetragonal number
bool isicositetragonal(int N)
{
    float n
        = (10 + sqrt(44 * N + 100))
          / 22;
 
    // Condition to check if the
    // number is a icositetragonal number
    return (n - (int)n) == 0;
}
 
// Driver Code
int main()
{
    int i = 24;
 
    // Function call
    if (isicositetragonal(i)) {
        cout << "Yes";
    }
    else {
        cout << "No";
    }
    return 0;
}


Java




// Java implementation to check that
// a number is icositetragonal number or not
class GFG{
 
// Function to check that the
// number is a icositetragonal number
static boolean isicositetragonal(int N)
{
    float n = (float)((10 + Math.sqrt(44 * N +
                                      100)) / 22);
 
    // Condition to check if the
    // number is a icositetragonal number
    return (n - (int)n) == 0;
}
 
// Driver Code
public static void main(String[] args)
{
    int i = 24;
 
    // Function call
    if (isicositetragonal(i))
    {
        System.out.print("Yes");
    }
    else
    {
        System.out.print("No");
    }
}
}
 
// This code is contributed by 29AjayKumar


Python3




# Python3 implementation to check that
# a number is icositetragonal number
# or not
import math
 
# Function to check that the number
# is a icositetragonal number
def isicositetragonal(N):
 
    n = (10 + math.sqrt(44 * N + 100)) / 22
 
    # Condition to check if the number
    # is a icositetragonal number
    return (n - int(n)) == 0
 
# Driver Code
i = 24
 
# Function call
if (isicositetragonal(i)):
    print("Yes")
else:
    print("No")
 
# This code is contributed by divyamohan123


C#




// C# implementation to check that
// a number is icositetragonal number or not
using System;
class GFG{
 
// Function to check that the
// number is a icositetragonal number
static bool isicositetragonal(int N)
{
    float n = (float)((10 + Math.Sqrt(44 * N +
                                      100)) / 22);
 
    // Condition to check if the
    // number is a icositetragonal number
    return (n - (int)n) == 0;
}
 
// Driver Code
public static void Main()
{
    int i = 24;
 
    // Function call
    if (isicositetragonal(i))
    {
        Console.Write("Yes");
    }
    else
    {
        Console.Write("No");
    }
}
}
 
// This code is contributed by Akanksha_Rai


Javascript




<script>
 
// JavaScript implementation to check that
// a number is icositetragonal number or not
 
// Function to check that the
// number is a icositetragonal number
function isicositetragonal(N)
{
    var n = (10 + Math.sqrt(44 * N + 100))
          / 22;
 
    // Condition to check if the
    // number is a icositetragonal number
    return (n - parseInt(n)) == 0;
}
 
// Driver Code
var i = 24;
// Function call
if (isicositetragonal(i)) {
    document.write("Yes");
}
else {
    document.write("No");
}
     
</script>


Output

Yes

Time Complexity: O(log N), it is time taken by inbuilt sqrt() function
Auxiliary Space: O(1)

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

Commit to GfG’s Three-90 Challenge! Purchase a course, complete 90% in 90 days, and save 90% cost click here to explore.

Last Updated :
30 Nov, 2022
Like Article
Save Article


Previous

<!–

8 Min Read | Java

–>


Next


<!–

8 Min Read | Java

–>

Share your thoughts in the comments

RELATED ARTICLES

Most Popular

Recent Comments