Generate A Sequence Of Cousin Primes In C++

In this post, we will explore several cousin prime pairs and develop a method that can generate these distinct pairs. We will also include a C++ illustration to showcase effective techniques for identifying and displaying cousin prime pairs.

Cousin Prime and the Prime Number Concept

Prime Numbers: A prime number is a positive integer greater than 1 that cannot be formed by multiplying two smaller positive integers. This means that a prime number is only divisible by 1 and itself. The sequence of prime numbers starts with the values: 2, 3, 5, 7, 11, 13, 17, 19, 23...

Examples of Cousin Primes: In the context of cousin primes, p and q refer to a pair of prime numbers where the difference between them is exactly four (\(\epsilon = 4\)). These pairs are characterized by the unique property that they are separated by a gap of four.

For example:

The pair(3, 7) meets the criteria because both numbers are prime, and their difference is 4, calculated as \(7 – 3 = 4\).

Another point lies at (7, 11).

Cousin Primes Generation Algorithm Steps:

• ✅ Create a List of Prime Numbers: It can be initiated by creating a list of prime numbers less than a certain number using the Sieve of Eratosthenes method or even a simple trial-and-error method.
• ✅ Finding Cousin Pairs: After the list is made, there is a need to search for gaps of four units that are specific to certain pairs.
• ✅ Examine Output: In the final stage, all cousin prime pairs need to be written out and displayed for checking.

Advanced Attributes of Cousin Primes:

• ✅ Definition: Cousins primes are those prime number pairs whose gap is exactly four. For example, (3,7) or (7,11) illustrate these pairs.
• ✅ Prime Nature: A cousin prime pair does have members that are not prime, but each element is a prime by definition. This means that these numbers have no positive factors other than one and themselves.
• ✅ Pairing Mechanism: Algorithms can be created to locate these pairs, considering their primality and the difference between them.

Example:

//Program to implement how to find cousin primes in C++
#include <iostream>
#include <vector>
#include <cmath>
// Function to check if a number is prime or not
bool isPrimeNumber(int number) {
    if (number <= 1) return false;
    if (number <= 3) return true;
    if (number % 2 == 0 || number % 3 == 0) return false;
    for (int i = 5; i * i <= number; i += 6) {
        if (number % i == 0 || number % (i + 2) == 0) return false;
    }
    return true;
}
//Function for generating the cousin primes
std::vector<std::pair<int, int>> generateCousinNums(int lmt) {
    std::vector<std::pair<int, int>> cousinPrimeNum;

    for (int i = 2; i <= lmt - 4; ++i) {
        if (isPrimeNumber(i) && isPrimeNumber(i + 4)) {
            cousinPrimeNum.push_back({i, i + 4});
        }
    }
    return cousinPrimeNum;
}
int main() {
    int lmt;

    //User Input
    std::cout << "Please enter the upper limit: ";
    std::cin >> lmt;
    std::vector<std::pair<int, int>> cousinPrimeNum = generateCousinNums(lmt);

    // Result
    std::cout << "The Cousin Prime Pairs:\n";
    for (const auto& pairs : cousinPrimeNum) {
        std::cout << "(" << pairs.first << ", " << pairs.second << ")\n";
    }

    return 0;
}

Output:

Please enter the upper limit: 25
The Cousin Prime Pairs:
(3, 7)
(7, 11)
(13, 17)
(19, 23)

Explanation:

The subsequent C++ script aims to identify cousin primes, defined as two prime numbers with a gap of four between them. Through the implementation of specific functions, the script encompasses input/output operations and vectors. Notably, it incorporates a function named isPrimeNumber, which verifies if a given integer is a prime number. This verification involves establishing base cases comparing the integer with values less than or equal to one, along with the prime numbers 2 and 3. Eliminating even numbers and multiples of three, the function proceeds to evaluate factors less than the square root of the integer before displaying the identified prime numbers on the console.

Conclusion:

In summary, cousin primes not only contribute to the field of number theory but also showcase the fusion of mathematics and coding. The C++ algorithm provided here illustrates the discovery of cousin prime pairs, highlighting the ingenuity of the concept and the application of computational capabilities in tackling mathematical problems. This software, leveraging sophisticated algorithms for testing pairwise primes, serves as a valuable resource for beginner and seasoned developers intrigued by prime numbers.

Furthermore, cousin prime numbers that have been examined serve as a foundation for additional research on the distribution of prime tails and their application in encryption and the generation of random numbers. The existing setup is relatively manageable within limited parameters, but upcoming endeavors aim to enhance the efficiency of the primality assessment and reduce the memory footprint for large datasets.