Wednesday, July 3, 2024

65537-gon Number

Given a number N, the task is to find Nth 65537-gon number.
 

A 65537-gon number is a class of figurate numbers. It has a 65537-sided polygon called 65537-gon. The N-th 65537-gon number count’s the 65537 number of dots and all other dots are surrounding with a common sharing corner and make a pattern. The first few 65537-gon numbers are 1, 65537, 196608, 393214, 655355, 983031, … 
 

Examples: 
 

Input: N = 2 
Output: 65537 
Explanation: 
The second 65537-gonol number is 65537. 
Input: N = 3 
Output: 196608 
 

 

Approach: The N-th 65537-gon number is given by the formula:
 

  • Nth term of s sided polygon = \frac{((s-2)n^2 - (s-4)n)}{2}
     
  • Therefore Nth term of 65537 sided polygon is
     

Tn =\frac{((65537-2)n^2 - (65537-4)n)}{2} =\frac{(65535^2 - 65533)}{2}

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 65537-gon Number
int gonNum65537(int n)
{
    return (65535 * n * n - 65533 * n) / 2;
}
 
// Driver Code
int main()
{
    int n = 3;
    cout << gonNum65537(n);
 
    return 0;
}


Java




// Java program for above approach
class GFG{
 
// Function to find the
// nth 65537-gon Number
static int gonNum65537(int n)
{
    return (65535 * n * n - 65533 * n) / 2;
}
 
// Driver code
public static void main(String[] args)
{
    int n = 3;
     
    System.out.print(gonNum65537(n));
}
}
 
// This code is contributed by shubham


Python3




# Python3 implementation for
# above approach
 
# Function to find the
# nth 65537-gon Number
def gonNum65537(n):
 
    return (65535 * n * n - 65533 * n) // 2;
 
# Driver Code
n = 3;
print(gonNum65537(n));
 
# This code is contributed by Code_Mech


C#




// C# program for above approach
using System;
class GFG{
 
// Function to find the
// nth 65537-gon Number
static int gonNum65537(int n)
{
    return (65535 * n * n - 65533 * n) / 2;
}
 
// Driver code
public static void Main(String[] args)
{
    int n = 3;
     
    Console.Write(gonNum65537(n));
}
}
 
// This code is contributed by sapnasingh4991


Javascript




<script>
 
// Javascript program for above approach
 
 
    // Function to find the
    // nth 65537-gon Number
    function gonNum65537( n) {
        return (65535 * n * n - 65533 * n) / 2;
    }
 
    // Driver code
      
        let n = 3;
 
        document.write(gonNum65537(n));
 
// This code contributed by aashish1995
 
</script>


Output: 

196608

 

Reference: https://en.wikipedia.org/wiki/65537-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!

Commit to GfG’s Three-90 Challenge! Purchase a course, complete 90% in 90 days, and save 90% cost click here to explore.

Last Updated :
23 Mar, 2021
Like Article
Save Article


Previous

<!–

8 Min Read | Java

–>


Next


<!–

8 Min Read | Java

–>

Share your thoughts in the comments

Shaida Kate Naidoo
am passionate about learning the latest technologies available to developers in either a Front End or Back End capacity. I enjoy creating applications that are well designed and responsive, in addition to being user friendly. I thrive in fast paced environments. With a diverse educational and work experience background, I excel at collaborating with teams both local and international. A versatile developer with interests in Software Development and Software Engineering. I consider myself to be adaptable and a self motivated learner. I am interested in new programming technologies, and continuous self improvement.
RELATED ARTICLES

LEAVE A REPLY

Please enter your comment!
Please enter your name here

Most Popular

Recent Comments