Icosagonal Number In C++

In this post, we will explore Icosagonal Numbers in C++. Prior to delving into Icosagonal Numbers in C++, it is essential to understand the formula, an illustrative example, time complexity, space complexity, and practical applications.

What is the Icosagonal Number?

A polygon with 20 sides, known as a 20-gon, serves as the basis for defining an icosagonal number. This concept falls within the realm of figurate numbers and symbolizes a symmetrical arrangement of points that can be organized to create a polygon containing 20 sides. These numerical values are part of a mathematical sequence where each element is depicted by a pattern of dots arranged in specific and measurable configurations.

The layout of the dots in an icosagonal number displays a unique configuration. This pattern is upheld by a central shared point positioned at the midpoint of the illustration. A methodical process involves adding successive layers of dots around this central point. Each dot within the i-th layer maintains a fixed geometric connection with specific dots in neighboring layers. The dots are organized in such a manner that they form a structure resembling a polygon with 20 sides.

Icosagonal figures are computed and structured based on a specific equation derived from the characteristics of the polygon. These numbers find applications in various fields such as geometry, combinatorics, and artistic endeavors, showcasing not just their mathematical elegance but also their practical utility. The inherent symmetry and orderliness observed when examining these numerical values contribute to their appeal as a captivating topic for both mathematical exploration and design investigations.

Formula:

The formula for the nth Icosagonal number is:

I(n)= (18.n^2 −16.n)/2

• ✅ N: It is the term's position within the sequence that is indicated by the letter n.
• ✅ I(n) is the number of dots in the icosagonal arrangement at position n.
• ✅ For the given position n, the formula determines how many dots or points are needed to form an icosagon, or 20-sided polygon.
• ✅ It comes from how the dots are arranged geometrically in the polygonal shape.

This equation enables the direct calculation of the nth Icosagonal number without the need for iterative processes.

Examples:

1. For n=4:

Substitute n=4 into the formula:

(4) = (184^2 − 164)/2

=(18*16 − 64)/2

=(288 − 64)/2

=224/2

The fourth icosagonal number is equal to 112.

1. When n is equal to 6:

Substitute n=6 into the formula:

(6) = (186^2 − 166)/2

=(18*36 −96)/2

= (648−96)/2

=552/2

Code Implementation:

Let's consider an example to demonstrate the Icosagonal number in C++.

#include <iostream>
using namespace std;
int calculateIcosagonalNumber(long int position)
{
    return (18 * position * position - 16 * position) / 2;
}
int main() 
{
    long int termPosition;
    cout << "Enter the position of the term to find the Icosagonal number: ";
    cin >> termPosition;
    if (termPosition <= 0)
    {
        cout << "Invalid input! Position must be a positive integer." << endl;
    } 
    else
    {
        long int icosagonalNumber = calculateIcosagonalNumber(termPosition);
        cout << "The " << termPosition << "th Icosagonal number is: " 
             << icosagonalNumber << endl;
    }
    return 0;
}

Output:

Enter the position of the term to find the Icosagonal number: 9
The 9th Icosagonal number is: 657

Explanation:

This C++ software identifies the Icosagonal value corresponding to a specific location within the sequence. An Icosagonal number is a member of a series of figurative numbers derived from a 20-sided shape. The calculateIcosagonalNumber function leverages the formula "(18⋅n^2-16⋅n)/2" to accurately compute the Icosagonal number, with 'n' representing the position in the sequence. Users are prompted to input the desired position (termPosition). In case of non-positive integer input, the program promptly notifies the user about the invalid entry. Otherwise, the program efficiently computes and displays the Icosagonal number for the specified position. By adapting the output dynamically based on user input, the software ensures clear communication. This design maintains the program's simplicity and effectiveness, enhancing its interactivity and user-friendliness.

Complexity Analysis:

• ✅ Time Complexity - O(1): A simple mathematical formula involving the fundamental arithmetic operations of multiplication, subtraction, division, and n^2 is used to calculate the Icosagonal number. The calculation is constant-time regardless of the size of the input because neither recursive nor iterative methods are used.
• ✅ Auxiliary Space - O(1): Variables like the input termPosition and the result icosagonalNumber are stored in a fixed amount of space by the program. A fixed amount of auxiliary space is used because no additional data structures or dynamic memory allocation are required.

Applications of Icosagonal Numbers:

Several applications of Icosagonal Numbers in C++ are as follows:

• ✅ Polygonal Number Theory: Icosagonal numbers are a subset of figurative numbers, which are used to examine the connections between geometric shapes and numbers. Their properties, including their divisibility, relationships with other polygonal numbers, and their appearance in a variety of mathematical problems, are the reasons behind their study.
• ✅ Algorithmic Problem Solving: Icosagonal numbers are frequently employed in challenges involving number sequences, pattern recognition, or geometric problem-solving in algorithmic challenges or competitive programming. In optimization or combinatorial situations where certain polygonal numbers are required to simulate complex scenarios, the method for producing icosagonal numbers is helpful.
• ✅ Shape Visualization: The collection of points in a 20-sided polygon can be represented using icosagonal numbers. In the field of computer graphics, architecture, or geometric art, it is particularly helpful when generating simulations or visualizations of regular polygons.