Weird Numbers In C++

In this guide, we will discuss Odd Numbers with their historical background, characteristics, computational methods, illustrations, benefits, drawbacks, and practical uses.

What are Weird Numbers?

Weird numbers are defined as numbers that are odd integers resulting from the multiplication of four prime numbers. A number is classified as a weird number if it satisfies two criteria:

• ✅ It is categorized as an abundant number: The count of proper divisors, which includes all numbers dividing the given number apart from the number itself, exceeds the number.
• ✅ It is not classified as a semiperfect number: It is impossible for any combination of proper divisors to sum up to the number itself.

For instance, the initial peculiar number is 70. This number possesses the correct divisors 1, 2, 5, 7, 10, 14, and 35, resulting in a total sum of 74; thus making it an abundant number. Nonetheless, it is worth noting that no combination of these divisors can result in a sum of 70. These specific numbers are uncommon and hold computational intrigue due to their distinctive classification as a threshold between abundant and perfect numbers.

History of Weird Numbers

According to the examination of the text, strange numbers are a category of numbers established within number theory to explore additional facets of integers beyond perfect, deficient, and abundant numbers. While numbers with abundant properties have been extensively studied, the classification of numbers that are somewhat abundant yet not semiperfect has continued to captivate mathematicians. It became evident to researchers that, akin to the y-axis, the realm of these sophisticated Z's becomes increasingly intricate, less common, and presents a greater mathematical challenge to identify.

Properties of Weird Numbers:

Several properties of Weird Numbers in C++ are as follows:

• ✅ Proper divisors: According to the definition, the proper divisors of a number are the numbers by which it must be divided to get an exact quotient without exceeding the number itself.
• ✅ Abundance: An integer is an abundant number if the great rational divisor sum of the integer is greater than the integer.
• ✅ Non-semi-perfect: If a subset of the proper divisors cannot make the number we are considering, it is not a semi-perfect number.
• ✅ Rarity: The appearance of the weird numbers is also rather low, and it decreases as numbers become larger.
• ✅ Odd and even: Almost all classes of known weird numbers are even though some constructions allow the possibility of odd weird numbers.

Algorithm to Check for Weird Numbers

To decide whether a number is weird:

Step 1: Identify its proper divisors.

Step 2: When a number equals the total of its proper divisors, it is classified as an abundant number.

To verify the divisors, we can once more apply the subset_sum algorithm. If the algorithm does not identify any suitable subset, then the number is considered unusual.

Example:

Let's consider an example to demonstrate the concept of the Weird Number in C++.

//Program to check whether a given number is a Weird number or not
#include <bits/stdc++.h>
using namespace std;

// Function to find the proper divisors of the number
vector<int> getProperDivisors(int num) {
    vector<int> div;
    for (int i = 1; i <= num / 2; ++i) {
        if (num % i == 0) {
            div.push_back(i);
        }
    }
    return div;
}

// function to find the sum value of divisors
bool isSubSum(const vector<int>& div, int num) {
    int subsetval = 1 << div.size(); // 2^size subsets
    for (int mask = 1; mask < subsetval; ++mask) {
        int subsetval = 0;
        for (int i = 0; i < div.size(); ++i) {
            if (mask & (1 << i)) { // to check the sum
                subsetval += div[i];
            }
        }
        if (subsetval == num) {
            return true; // return the subset sum which is equal to n
        }
    }
    return false;
}

// Function to validate whether the number i weird or not
bool isWeird(int num) {
    vector<int> div = getProperDivisors(num);

    // check the num
    int sumOfDiv = accumulate(div.begin(), div.end(), 0);
    if (sumOfDiv <= num) {
        return false; // Not an abundant number, so not weird
    }

    // to check for subsets
    if (isSubSum(div, num)) {
        return false; 
    }

    return true; // the number is weird
}

// Main function
int main() {
    int num;
    cout << "Enter a number: ";
    cin >> num;

    if (isWeird(num)) {
        cout <<"The given num " <<num << " is a weird number." << endl;
    } else {
        cout << "The given num " << num << " is not a weird number." << endl;
    }
    return 0;
}

Output:

Enter a number: 65
The given num 65 is not a weird number.

Explanation:

• ✅ The program is written in C++, and its function is to find out if a particular number is a weird number by checking two conditions: the first condition is that the number must be abundant, and the second condition is that it should not equal semiperfect. The first function is called getProperDivisors, which gives proper divisors of the input number num. Proper divisors are those integers that divide num without leaving a remainder, excluding the number itself. This function executes a loop from 1 to num/2 because no divisors will be larger than half of the number except num. Proper divisors are stored in a vector with a return to process later.
• ✅ After that, the function isSubSum checks whether the sum of any subset is equal to the number. This check is critical in confirming that a number is truly weird. Bit manipulation is used to find any subsets of divisors. The number of subsets equals 2n, where n is attributed to the size of the divisor vector. The loop traverses through every index bitwise equivalent to the subset index-mask and checks whether the ith bit in the mask is set; that means the divisor corresponding to this is included in the subset-sum. If there's any subset that equals the input number, true is returned, implying that the number is semiperfect; otherwise false.
• ✅ The main function combines all the previous concepts to find the weirdity of the number under concern. It calls the getProperDivisors function for the proper divisor, after which the function is used to compute the total of all divisors. If the total of the divisors is less than or equal to the input number, it cannot be weird. Therefore, it can't be abundant.
• ✅ If the number succeeds the abundance test, the function calls isSubSum to determine if any subset of the divisors equals the number itself. In the event of a subset-sum that is valid, it is semiperfect and thus disqualified as weird. The function would return true. Therefore, the number in question is really weird, provided both conditions are met.

Advantages of Weird Numbers:

Several advantages of Weird Numbers in C++ are as follows:

• ✅ Theoretical Significance: The study of weird numbers increases the theoretical knowledge of the classification of integers and the abundance and semi-perfect consideration.
• ✅ Algorithmic Challenges: Just exploring this class of numbers brings up several computational obstacles, such as the subset-sum problem, which is NP-complete.
• ✅ Practical Usage: The study of weird numbers provides avenues for students in studies on divisors, set theory, and manipulation of bits.
• ✅ Cryptography: The associations between weird numbers and the subset-sum problem make this particularly significant in terms of cryptography.

Disadvantages of Weird Numbers:

Several disadvantages of Weird Numbers in C++ are as follows:

• ✅ Rarity: Weird numbers are very rare, which reduces their functionality in things that matter most.
• ✅ Computationally Exhaustive: It is too computationally expensive for larger numbers to determine whether a number is weird, which requires the computation of its divisors and the subset-sum problem.
• ✅ Limited Applicability: Although it is of great theoretical magnitude, the application of weird numbers in engineering and science is limited.

Applications of Weird Numbers:

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

• ✅ The study of weird numbers introduces number theory among properties and classifications of integers.
• ✅ They serve as teaching tools for a sequence of mathematical topics that range from divisors to subsets and recursion.
• ✅ The design of algorithms: The subset-sum problem of weird numbers is related to problems employed in computer science and cryptography.

Conclusion:

In summary, Eccentric numbers represent a unique subset within the realm of Number Theory, showcasing peculiar characteristics of being plentiful and non-semi-complete. A digit earns the label of an eccentric number if the total of its proper divisors surpasses the digit itself, while no combination of those divisors can sum up to match that digit (non-semi-complete). These digits are atypical; their exploration significantly enriches the mathematical domain and aids in tackling computational challenges, especially when delving into the analysis of divisors, combinations, and notably NP-complete issues like solving a subset-sum problem. For instance, 70, as the primary eccentric number, elegantly embodies these dual attributes.

Studying unusual numbers offers an intriguing exploration into categorizing integers according to their divisors. Additionally, these numbers play a significant role in cryptographic and computational challenges. Despite the complexity involved in calculating them, owing to their scarcity and intricate nature, weird numbers remain valuable primarily for their ability to spark curiosity and fascination. Despite their drawbacks, these numbers serve as excellent tools for illustrating concepts in mathematical logic, recursion, and bitwise operations, effectively connecting theoretical mathematics with computational principles. Furthermore, as research progresses, mathematicians and computer scientists continue to leverage weird numbers, showcasing the intricate beauty and complexity of mathematical constructs.