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