Hexacontagon Number
Last Updated :
23 Jun, 2021
Given a number N, the task is to find Nth Hexacontagon number.
A Hexacontagon number is class of figurate number. It has 60 – sided polygon called hexacontagon. The N-th hexacontagon number count’s the 60 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few hexacontagonol numbers are 1, 60, 177, 352 …
Examples:
Input: N = 2
Output: 60
Explanation:
The second hexacontagonol number is 60.
Input: N = 3
Output: 177
Approach: The N-th hexacontagon number is given by the formula:
- Nth term of s sided polygon =
- Therefore Nth term of 60 sided polygon is
Below is the implementation of the above approach:
C++
#include <iostream>
using namespace std;
int hexacontagonNum( int n)
{
return (58 * n * n - 56 * n) / 2;
}
int main()
{
int n = 3;
cout << "3rd hexacontagon Number is = "
<< hexacontagonNum(n);
return 0;
}
|
C
#include <stdio.h>
#include <stdlib.h>
int hexacontagonNum( int n)
{
return (58 * n * n - 56 * n) / 2;
}
int main()
{
int n = 3;
printf ( "3rd hexacontagon Number is = %d" ,
hexacontagonNum(n));
return 0;
}
|
Java
class GFG{
public static int hexacontagonNum( int n)
{
return ( 58 * n * n - 56 * n) / 2 ;
}
public static void main(String[] args)
{
int n = 3 ;
System.out.println( "3rd hexacontagon Number is = " +
hexacontagonNum(n));
}
}
|
Python3
def hexacontagonNum(n):
return ( 58 * n * n - 56 * n) / / 2
n = 3
print ( "3rd hexacontagon Number is = " ,
hexacontagonNum(n));
|
C#
using System;
class GFG{
public static int hexacontagonNum( int n)
{
return (58 * n * n - 56 * n) / 2;
}
public static void Main()
{
int n = 3;
Console.Write( "3rd hexacontagon Number is = " +
hexacontagonNum(n));
}
}
|
Javascript
<script>
function hexacontagonNum(n)
{
return (58 * n * n - 56 * n) / 2;
}
var n = 3;
document.write( "3rd hexacontagon Number is = " +hexacontagonNum(n));
</script>
|
Output: 3rd hexacontagon Number is = 177
Time Complexity: O(1)
Auxiliary Space: O(1)
Reference: https://en.wikipedia.org/wiki/Hexacontagon
Share your thoughts in the comments
Please Login to comment...