Triacontakaidigon Number
Last Updated :
22 Jun, 2021
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 =
- Therefore Nth term of 32 sided polygon is
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int triacontakaidigonNum( int n)
{
return (30 * n * n - 28 * n) / 2;
}
int main()
{
int n = 3;
cout << "3rd triacontakaidigon Number is = "
<< triacontakaidigonNum(n);
return 0;
}
|
C
#include <stdio.h>
#include <stdlib.h>
int triacontakaidigonNum( int n)
{
return (30 * n * n - 28 * n) / 2;
}
int main()
{
int n = 3;
printf ( "3rd triacontakaidigon Number is = %d" ,
triacontakaidigonNum(n));
return 0;
}
|
Java
class GFG{
public static int triacontakaidigonNum( int n)
{
return ( 30 * n * n - 28 * n) / 2 ;
}
public static void main(String[] args)
{
int n = 3 ;
System.out.println( "3rd triacontakaidigon Number is = " +
triacontakaidigonNum(n));
}
}
|
Python3
def triacontakaidigonNum(n):
return ( 30 * n * n - 28 * n) / / 2
n = 3
print ( "3rd triacontakaidigon Number is = " ,
triacontakaidigonNum(n))
|
C#
using System;
class GFG{
public static int triacontakaidigonNum( int n)
{
return (30 * n * n - 28 * n) / 2;
}
public static void Main(String[] args)
{
int n = 3;
Console.WriteLine( "3rd triacontakaidigon Number is = " +
triacontakaidigonNum(n));
}
}
|
Javascript
<script>
function triacontakaidigonNum( n)
{
return (30 * n * n - 28 * n) / 2;
}
let n = 3;
document.write( "3rd triacontakaidigon Number is " + triacontakaidigonNum(n));
</script>
|
Output: 3rd triacontakaidigon Number is = 93
Time Complexity: O(1)
Auxiliary Space: O(1)
Reference: https://en.wikipedia.org/wiki/Triacontadigon
Share your thoughts in the comments
Please Login to comment...