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++
// C++ implementation for // above approach#include <bits/stdc++.h>using namespace std;// Function to find the // nth 257-gon Numberint gonNum257(int n){ return (255 * n * n - 253 * n) / 2;}// Driver Codeint main(){ int n = 3; cout << gonNum257(n); return 0;} |
Java
// Java program for above approachclass GFG{ // Function to find the // nth 257-gon Numberstatic int gonNum257(int n) { return (255 * n * n - 253 * n) / 2;} // Driver code public static void main(String[] args) { int n = 3; System.out.print(gonNum257(n)); } } // This code is contributed by shubham |
Python3
# Python3 implementation for # above approach# Function to find the # nth 257-gon Numberdef gonNum257(n): return (255 * n * n - 253 * n) // 2;# Driver Coden = 3;print(gonNum257(n));# This code is contributed by Code_Mech |
C#
// C# program for above approachusing System;class GFG{ // Function to find the // nth 257-gon Numberstatic int gonNum257(int n) { return (255 * n * n - 253 * n) / 2;} // Driver code public static void Main(String[] args) { int n = 3; Console.Write(gonNum257(n)); } }// This code is contributed by sapnasingh4991 |
Javascript
<script>// JavaScript implementation for // above approach// Function to find the // nth 257-gon Numberfunction gonNum257(n){ return (255 * n * n - 253 * n) / 2;}// Driver Codevar n = 3;document.write(gonNum257(n));</script> |
Output:
768
Reference: https://en.wikipedia.org/wiki/257-gon
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Share your thoughts in the comments