Centred Heptagonal Number In C++

A centred heptagonal number is a special type of centred polygonal number that forms the shape of a heptagon with a central dot. Unlike regular heptagonal numbers that increase by adding complete layers to create a heptagon, centred heptagonal numbers expand symmetrically outward from a single central point. Each successive term in the centred heptagonal number sequence introduces an additional heptagon around the preceding term. These numbers share connections with triangular numbers, square numbers, pentagonal numbers, and hexagonal numbers.

The equation provided demonstrates the method for determining the nth centred heptagonal number:

C(n) = (7 n (n - 1)) / 2 + 1

In this equation, n represents the index of a term within the sequence.

The first few centred heptagonal numbers are:

1, 8, 22, 43, 71, 106, 148, 197, 253, 316, ...

If we closely examine the pattern mentioned earlier, it becomes evident that with each increment of n, the values grow larger. Connecting the points (i.e., numbers) each time results in forming a heptagon with a central dot consistently.

These specific numbers, known as centred heptagonal numbers, hold mathematical importance as they aid in systematically counting arrangements:

Nonetheless, centred heptagonal numbers are not limited to just arranging objects; they also play a role in various mathematical studies that involve these specific numbers. Understanding how objects can be symmetrically arranged is crucial in different mathematical hypotheses, highlighting the significance of centred heptagonal numbers in mathematical research. Exploring patterns in problems often leads to new insights and discoveries. While some patterns are self-evident and require no explanation, there are common patterns that defy easy explanation. The numerical series serves as a clear example of such patterns.

Properties of Centred Heptagonal Numbers:

One key observation regarding centered heptagonal numbers is their specific growth pattern. The values within the series exhibit incremental or decremental changes that adhere to a consistent and predictable pattern.

If consecutive numbers are subtracted from each other, the resulting values are as follows:

The variance among the numbers is increasing by increments of seven in each sequence: 7, 14, 21, 28, 35, and so forth.

Other types of polygonal numbers have a unique relationship with centred heptagonal numbers. These polygonal numbers are referred to as centred because they can all be depicted by dots arranged in the form of regular polygons with a dot positioned at the center. The additional members of this group include centred triangular, square, pentagonal, hexagonal, and octagonal numbers. Similar to heptagonal numbers, each of these can be computed using its specific formula. The rate at which these numbers increase varies based on the polygonal shape (triangles with three sides, squares with four sides, etc.) the formula is derived from. Centred heptagonal numbers exhibit a slower growth rate compared to centred octagonal numbers but a faster growth rate compared to centred pentagonal numbers. By conducting these comparisons, we can gain valuable insights into the systematic development of different patterns.

In the field of number theory, there are fascinating observations to make regarding centred heptagonal numbers. Upon examining a sequence of these numbers, it becomes evident that certain terms within the sequence are prime numbers. A prime number is a numerical entity that is indivisible by any other numbers apart from one and itself.

Algorithm and Implementation:

The calculation of centred heptagonal numbers is easy because of their simple mathematical formula. In languages like C++ , we can find these numbers by creating a function that will give us the expected results when we give it any number (nth term). The formula is quadratic, which means it does not take long for the computer to get the results.

• ✅ There is more than one-way to find these numbers but all of them use iteration or repetition structures but not recursion because it can be inefficient sometimes.
• ✅ If we want to display these numbers, one by one as they are gotten without using the formula for each new number we get (finding the nth term first before using its value), then we have to use a loop.
• ✅ Another thing to note is that the difference between any heptagonal number and the one that comes after it is always going to be an arithmetic sequence (a sequence with a common difference)
• ✅ Finding centred heptagonal numbers can be helpful in solving problems related to putting objects together in specific shapes and making models or patterns.

Employing a recursive strategy provides an alternate technique for calculating centred heptagonal numbers. By establishing a recursive function that determines the current term from the preceding one, it becomes possible to define the series based on a specific pattern observed in the variance between each term and its successive counterpart. While this computational approach may not offer the same level of speed, it effectively illustrates the underlying structure of the series.

While centred hexagonal numbers may not be a common concept in everyday calculations like percentages or fractions, they are valuable to investigate as they have applications across various mathematical domains. Understanding the evolution of these numbers over time can provide insights into underlying patterns. These numerical structures are not only analyzed in isolation but also exhibit relationships with various polygonal number sequences.

Example:

Let's consider an example to demonstrate the Centered Heptagonal Number concept using C++.

#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>

using namespace std;

long long centredHeptagonalNumber(int n) {
    return (7LL * n * (n - 1)) / 2 + 1;
}

vector<long long> generateCentredHeptagonalNumbers(int N) {
    vector<long long> numbers;
    for (int i = 1; i <= N; i++) {
        numbers.push_back(centredHeptagonalNumber(i));
    }
    return numbers;
}

bool isPrime(long long num) {
    if (num < 2) return false;
    if (num == 2 || num == 3) return true;
    if (num % 2 == 0) return false;
    for (long long i = 3; i * i <= num; i += 2) {
        if (num % i == 0) return false;
    }
    return true;
}

long long recursiveCentredHeptagonal(int n) {
    if (n == 1) return 1;
    return recursiveCentredHeptagonal(n - 1) + 7 * (n - 1);
}

void displaySequence(int N) {
    vector<long long> numbers = generateCentredHeptagonalNumbers(N);
    
    cout << setw(5) << "N" << setw(15) << "Number" << setw(15) << "Difference" << setw(10) << "Prime?" << endl;
    cout << "-------------------------------------------------------------" << endl;

    for (int i = 0; i < N; i++) {
        long long difference = (i == 0) ? 0 : numbers[i] - numbers[i - 1];
        cout << setw(5) << (i + 1) 
             << setw(15) << numbers[i] 
             << setw(15) << difference 
             << setw(10) << (isPrime(numbers[i]) ? "Yes" : "No") 
             << endl;
    }
}

int main() {
    int N;

    cout << "Enter the number of centred heptagonal numbers to generate: ";
    cin >> N;

    cout << "\nCentred Heptagonal Numbers Sequence:\n";
    displaySequence(N);

  
    cout << "\nComputing nth term using recursion (Example for N = " << N << "):\n";
    cout << "Recursive Centred Heptagonal Number (" << N << ") = " << recursiveCentredHeptagonal(N) << endl;

    return 0;
}

Output:

Enter the number of centred heptagonal numbers to generate: 10

Centred Heptagonal Numbers Sequence:
    N        Number      Difference     Prime?
-------------------------------------------------------------
    1             1              0        No
    2             8              7        No
    3            22             14        No
    4            43             21        Yes
    5            71             28        Yes
    6           106             35        No
    7           148             42        No
    8           197             49        Yes
    9           253             56        No
   10           316             63        No

Computing nth term using recursion (Example for N = 10):
Recursive Centred Heptagonal Number (10) = 316

Conclusion:

In summary, centered heptagonal numbers represent a distinct category of figurate numbers that expand upon the concept of representing numbers as shapes in mathematics. The equation used to determine these numbers is (7 n (n - 1)) / 2 + 1.

These numerical values hold significance due to specific characteristics. They are interconnected with various types of unique numbers that can also be represented geometrically. Occasionally, centred heptagonal numbers coincide with prime numbers. An efficient C++ program can be developed to swiftly identify centred heptagonal numbers. The implementation of this program can be approached through two methods: iterative and recursive.

However, employing the recursive method involves processing each item sequentially. In the case where the goal is solely to determine the primality of a centered heptagonal number, there is no necessity for a distinct function. This evaluation can be integrated within the primary function as well.

Not only in theoretical contexts, but these numbers with a heptagonal center hold significance in practical scenarios as well. They find applications across various domains such as mathematics, programming, data analysis, and more. When represented in a graphical format alongside the variances between consecutive terms, intriguing patterns come to light. The exploration of these patterns has captivated professionals across diverse sectors, offering valuable insights and inspiration.