Interactive Programming Education Platform

Logic Practice

Disarium numbers exhibit a unique property where the total of its digits, each elevated to the power of its position, results in the number itself.

For example, consider the integer 135. When we compute 1^1 + 3^2 + 5^3, the sum is 1 + 9 + 125 which equals 135. As a result, 135 is classified as a Disarium number.

Another instance could involve the digit 544. In this scenario, by computing 5^1 + 4^2 + 4^3, the result sums up to 5 + 64, totaling 544. This scenario also meets the criteria of being classified as a Disarium number.

These special figures possess a characteristic that distinguishes them from the rest. Despite their individuality, Disarium numbers follow a certain sequence that will be thoroughly examined in this piece.

We are going to delve into the concept of Disarium numbers and techniques for recognizing them. Furthermore, we will craft a C plus plus program to verify whether a given number is a Disarium number. Additionally, we will evaluate the time and space complexity of the algorithm employed for this purpose.

Mathematical background and definition of Disarium numbers:

Mathematical Background:

Disarium numbers are a mathematical concept categorized as "Pluperfect digital invariant numbers" due to their unique property concerning the values and positions of their digits. This property distinguishes them within the realm of numbers.

Definition of Disarium Numbers:

In mathematics, a Disarium number is defined as a number where each digit, when raised to the power of its position and then added together, results in the original number. For instance, if we denote a Disarium number as ' n ' with ' d ' digits, it can be expressed using the following formula;

n = d1^1 + d2^2 + d3^3 + ... + dd^d

Where:

✅ d1, d2, d3, ..., dd represent the individual digits of the number 'n'
✅ The exponents (1, 2, 3, ..., d) indicate the positions of these digits within the number.

For example:

✅ 135 is a Disarium number because 1^1 + 3^2 + 5^3 = 1 + 9 + 125 = 135
✅ 544 is a Disarium number because 5^1 + 4^2 + 4^3 = 5 + 16 + 64 = 544
✅ 89 is not a Disarium number because 8^1 + 9^2 = 8 + 81 = 89 ≠ 89

The term "Disarium" is derived from merging "digit" and "sum," emphasizing the relationship between numbers and their positions within digits.

The importance and applications of Disarium numbers:

Here are some key points that discuss the significance and practical uses of Disarium numbers;

✅ Mathematical Interest: Disarium numbers are intriguing because they have a property that links the digits of a number to their positions. This characteristic contributes to the array of patterns and wonders.
✅ Mathematics: Disarium numbers are part of mathematics, which encompasses puzzles, games and number sequences that engage the mind and nurture an admiration for the elegance and complexities of mathematics.
✅ Enhancing Problem-Solving Abilities: Engaging with Disarium numbers can serve as an exercise in problem-solving, aiding in the development of thinking, pattern recognition and problem-solving skills for students and enthusiasts.
✅ Contribution to Number Theory: Delving into Disarium numbers contributes to the field of number theory by exploring the characteristics and connections among numbers, leading to breakthroughs and progress in studies.
✅ Coding Challenges Opportunity: Crafting algorithms to identify Disarium numbers presents a coding challenge that allows programmers to enhance their expertise in logic, algorithm creation and implementation across programming languages.
✅ Cryptography: While not a direct application, exploring the concept of Disarium numbers and the patterns they exhibit might offer insights that could be useful in developing methods or algorithms since number sequences are frequently utilized in securing information.
✅ Educational Significance: Including Disarium numbers in math education can enhance student engagement by introducing them to these numbers, igniting their curiosity to delve deeper into the realm of numerical concepts.

Determining Disarium Numbers in C++

Here are the steps to determine whether a given number is a Disarium number, in C++, presented as a series of points along with a flowchart;

✅ Begin by receiving the number input from the user.
✅ Set up variables to hold the number, the sum of digit powers, and the number of digits in it.
✅ Figure out the total digits in the provided number using methods like logarithmic or iterative approaches.
✅ Break down each digit of the number using modulus and division operations.
✅ Calculate each digit's power based on its position (1st digit raised to 1, 2nd digit raised to 2).
✅ Sum up all calculated powers of digits into the sum of digit powers variable.
✅ Once all digits are processed, compare this sum with the number.
✅ If both match, then it's confirmed as a Disarium number; if not, it isn't considered one. Present the outcome to inform the user.

Flowchart for the logic:

This systematic approach, along with the visual representation in the form of a flowchart, offers a comprehensive insight into the process of verifying whether a specified number qualifies as a Disarium number in C++.

C++ code to check if a given number is a Disarium number:

Example


#include <iostream>
#include <cmath>

//Function to calculate the power of a number
int raiseToPower(int base, int exponent) {
    int result = 1;
    for (int i = 0; i < exponent; i++) {
        result *= base;
    }
    return result;
}

//Function to count the number of digits
int countDigits(int num) {
    int count = 0;
    int temp = num;
    while (temp != 0) {
        temp /= 10;
        count++;
    }
    return count;
}

//Function to check if a number is a Disarium number
bool isDisarium(int num) {
    int sum = 0;
    int temp = num;
    int digitCount = countDigits(num);
    int position = digitCount;

    while (temp != 0) {
        int digit = temp % 10;
        sum += raiseToPower(digit, position);
        temp /= 10;
        position--;
    }

    return (sum == num);
}

int main() {
    int number;
    std::cout << "Enter a number: ";
    std::cin >> number;

    if (isDisarium(number)) {
        std::cout << number << " is a Disarium number." << std::endl;
    } else {
        std::cout << number << " is not a Disarium number." << std::endl;
    }

    return 0;
}

Output:

Output


Enter a number: 135
135 is a Disarium number.

Explanation:

✅ In this example, the function raiseToPower computes the result of raising a number to a power with the base and exponent provided as inputs.
✅ The function countDigits can be utilized to determine the number of digits in a given numerical value.
✅ In order to ascertain whether a number qualifies as a Disarium number, the function 'isDisarium' scrutinizes each digit's position and calculates its powers accordingly.
✅ Within the Function, users are prompted to input a value for further evaluation.
✅ Subsequently, the 'isDisarium' function is invoked using the user-provided number for analysis.
✅ Depending on the output from the isDisarium function, the program displays whether or not the entered number meets the criteria of being classified as a Disarium number.

The programming methodology follows guidelines by breaking down tasks into functions with explicit names and detailed comments to improve understanding.

Disarium Number In C++