120-gon number
Last Updated :
13 Jul, 2021
Given a number N, the task is to find Nth 120-gon number.
A 120-gon number is a class of figurate numbers. It has 120 – sided polygon called 120-gon. The N-th 120-gon number count’s the 120 number of dots and all other dots are surrounding with a common sharing corner and make a pattern. The first few 120-gon numbers are 1, 120, 357, 712, 1185, 1776, …
Examples:
Input: N = 2
Output: 120
Explanation:
The second 120-gonol number is 120.
Input: N = 3
Output: 357
Approach: The N-th 120-gon number is given by the formula:
- Nth term of s sided polygon =
- Therefore Nth term of 120 sided polygon is
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int gonNum120( int n)
{
return (118 * n * n - 116 * n) / 2;
}
int main()
{
int n = 3;
cout << gonNum120(n);
return 0;
}
|
Java
class GFG{
static int gonNum120( int n)
{
return ( 118 * n * n - 116 * n) / 2 ;
}
public static void main(String[] args)
{
int n = 3 ;
System.out.print(gonNum120(n));
}
}
|
Python3
def gonNum120(n):
return ( 118 * n * n - 116 * n) / / 2 ;
n = 3 ;
print (gonNum120(n));
|
C#
using System;
class GFG{
static int gonNum120( int n)
{
return (118 * n * n - 116 * n) / 2;
}
public static void Main(String[] args)
{
int n = 3;
Console.Write(gonNum120(n));
}
}
|
Javascript
<script>
function gonNum120(n)
{
return (118 * n * n - 116 * n) / 2;
}
var n = 3;
document.write(gonNum120(n));
</script>
|
Time Complexity: O(1)
Reference: https://en.wikipedia.org/wiki/120-gon
Share your thoughts in the comments
Please Login to comment...