Ramanujan Nagell Conjecture In C++

In this tutorial, we will explore the Ramanujan-Nagell Conjecture in C++ through multiple illustrative instances.

The Ramanujan-Nagell Conjecture, formulated by Srinivasa Ramanujan and later expanded upon by Trygve Nagell, posits that the equation 2n-7 = x2 has solutions in natural numbers n and x only for specific values of n, which are 3, 4, 5, 7, and 15.

The standard formula is structured as x2+D = 2n.

Here "x" and "n" are positive integers.

"D" represents a positive integer that is not a perfect square, with the condition that "n" must be equal to or greater than 3.

When the value of "D" equals 7, the provided equation will yield a finite solution. Should "D" be lower than 7, speculation indicates that no solutions exist.

Example 1:

Let's consider a C++ program designed to identify the natural numbers that fulfill the Ramanujan-Nagell Equation.

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
// Function to find natural numbers satisfying the Ramanujan-Nagell Equation: 2^y - 7 = x^2
vector<int> findNaturalNumbers(const vector<int>& xValues) {
    vector<int> results;
    // y can be found as log2(x^2 + 7)
    for (int i = 0; i < xValues.size(); i++) {
        int temp = (xValues[i] * xValues[i]) + 7;
        results.push_back(log2(temp));
    }
    return results;
}
int main() {
    int n;
    cout << "Enter the number of x values: ";
    cin >> n;
    vector<int> xValues(n);
    cout << "Enter " << n << " values for x: ";
    for (int i = 0; i < n; i++) {
        cin >> xValues[i];
    }
    cout << "\nNatural numbers satisfying the Ramanujan-Nagell Equation: ";
    vector<int> numbers = findNaturalNumbers(xValues);
    for (int i = 0; i < numbers.size(); i++) {
        cout << numbers[i] << "  ";
    }
    return 0;
}

Output:

Explanation:

The program contains variables referred to as "values" that signify the x values set. "n" denotes the quantity of elements in xValue, while "results" is the array storing result values. This array holds natural numbers fulfilling the Ramanujan-Nagell equation. The function "findNaturalNumbers" is employed for determining the results vector.

At the start, within the primary function, the user is required to input the x values. Subsequently, the function "findNaturalNumbers" is invoked with the "xValues" vector supplied as parameters. Within this function, it loops through the "xValues" vector and computes the associated natural number that meets the conditions of the Ramanujan-Nagell equation, utilizing the equation y = log2(x^2 + 7).

The computed integer value is saved in the outcomes array, which is then sent back to the primary function. Following this, a for loop is employed to display the result.

Triangular Mersenne numbers:

Triangular Mersenne numbers are a specific group of numbers created by the overlap of triangular numbers and Mersenne numbers.

Triangular numbers are generated by adding consecutive natural numbers together. The sequence of triangular numbers consists of values created by arranging equilateral triangles in a sequential manner.

The sequence of triangular numbers begins with 1, and continues with 3, 6, 10, 15, 21...

The values denoted by the formula Mp = 2p-1 are known as Mersenne numbers, where p represents prime numbers. A Mersenne number is defined as being one less than a power of 2.

The connection between triangular Mersenne numbers and the Ramanujan-Nagell conjecture is found in the shared overlap with specific Diophantine equations.

2m-1 = n(n+1)/2

Where m and n are positive numbers.

Example 2:

Let's consider a C++ code to calculate the triangular Mersenne numbers.

#include <iostream>
#include <vector>
using namespace std;
// Function to find Triangular Mersenne numbers or Ramanujan-Nagell numbers
vector<int> findTriangularMersenneNumbers(const vector<int>& xValues) {
    vector<int> results;
    for (int i = 0; i < xValues.size(); i++) {
        // Applying the formula: 2n - 1 = x
        // 2^m - 1 = n(n+1)/2
        int n = (xValues[i] - 1) / 2;
        results.push_back((n * (n + 1)) / 2);
    }
    return results;
}
int main() {
    int n;
    cout << "Enter the number of values: ";
    cin >> n;
    vector<int> xValues(n);
    cout << "Enter " << n << " values: ";
    for (int i = 0; i < n; i++) {
        cin >> xValues[i];
    }
    cout << "Triangular Mersenne Numbers: ";
    vector<int> triMersenneNumbers = findTriangularMersenneNumbers(xValues);
    for (int i = 0; i < n; i++) {
        cout << triMersenneNumbers[i] << "  ";
    }
    return 0;
}

Output:

Explanation:

This software is designed to identify the triangular Mersenne numbers. The variables a and re represent "xValues", capturing the input x values. The array "results" is employed to hold the triangular Mersenne numbers. Within the function "findTriangularMersenneNumbers", a for loop is employed to cycle through the "values" array, computing the relevant Triangular Mersenne number, and then preserving it in the results array. Within the primary function, an additional for loop is utilized to display the results.