Triacontakaidigon Number

Given a number N, the task is to find Nth Triacontakaidigon number.

A Triacontakaidigon number is class of figurate number. It has 32 – sided polygon called triacontakaidigon. The N-th triacontakaidigon number count’s the 32 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few triacontakaidigonol numbers are 1, 32, 93, 184 …

Examples:

Input: N = 2
Output: 32
Explanation:
The second triacontakaidigonol number is 32.

Input: N = 3
Output: 93



Approach: The N-th triacontakaidigon number is given by the formula:

  • Nth term of s sided polygon = \frac{((s-2)n^2 - (s-4)n)}{2}
  • Therefore Nth term of 32 sided polygon is

    Tn =\frac{((32-2)n^2 - (32-4)n)}{2} =\frac{(30n^2 - 28n)}{2}

Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program for above approach
#include <bits/stdc++.h>
using namespace std;
  
// Finding the nth triacontakaidigon Number
int triacontakaidigonNum(int n)
{
    return (30 * n * n - 28 * n) / 2;
}
  
// Driver Code
int main()
{
    int n = 3;
    cout << "3rd triacontakaidigon Number is = "
         << triacontakaidigonNum(n);
  
    return 0;
}
  
// This code is contributed by Akanksha_Rai

chevron_right


C

filter_none

edit
close

play_arrow

link
brightness_4
code

// C program for above approach
#include <stdio.h>
#include <stdlib.h>
  
// Finding the nth triacontakaidigon Number
int triacontakaidigonNum(int n)
{
    return (30 * n * n - 28 * n) / 2;
}
  
// Driver program to test above function
int main()
{
    int n = 3;
    printf("3rd triacontakaidigon Number is = %d",
           triacontakaidigonNum(n));
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program for above approach
class GFG{
      
// Finding the nth triacontakaidigon number 
public static int triacontakaidigonNum(int n) 
    return (30 * n * n - 28 * n) / 2
}
  
// Driver code    
public static void main(String[] args)
{
    int n = 3
      
    System.out.println("3rd triacontakaidigon Number is = "
                                    triacontakaidigonNum(n));
}
}
  
// This code is contributed by divyeshrabadiya07    

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 program for above approach 
  
# Finding the nth triacontakaidigon Number 
def triacontakaidigonNum(n): 
      
    return (30 * n * n - 28 * n) // 2
  
# Driver Code
n = 3
print("3rd triacontakaidigon Number is = "
                   triacontakaidigonNum(n)) 
  
# This code is contributed by divyamohan123

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program for above approach
using System;
class GFG{
      
// Finding the nth triacontakaidigon number 
public static int triacontakaidigonNum(int n) 
    return (30 * n * n - 28 * n) / 2; 
}
  
// Driver code 
public static void Main(String[] args)
{
    int n = 3; 
      
    Console.WriteLine("3rd triacontakaidigon Number is = "
                                   triacontakaidigonNum(n));
}
}
  
// This code is contributed by 29AjayKumar

chevron_right


Output:

3rd triacontakaidigon Number is = 93

Reference: https://en.wikipedia.org/wiki/Triacontadigon

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.




My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.