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