Triacontakaidigon Number

Given a number N, the task is to find N^th 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 = 
  
• Therefore Nth term of 32 sided polygon is
  

• 
  

Below is the implementation of the above approach: 

C++

// 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

C

// 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;
}

Java

// 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

Python3

# 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

C#

// 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

Javascript

<script>

// javascript program for above approach


// Finding the nth triacontakaidigon Number
function triacontakaidigonNum( n)
{
    return (30 * n * n - 28 * n) / 2;
}


// Driver code
let n = 3;
document.write("3rd triacontakaidigon Number is " + triacontakaidigonNum(n));

// This code contributed by gauravrajput1

</script>

Output:

3rd triacontakaidigon Number is = 93

Time Complexity: O(1)

Auxiliary Space: O(1)

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