. Day 3 - Challenge 3 - Armstrong Number Checker Skip to main content

Day 3 - Challenge 3 - Armstrong Number Checker

Exploring Armstrong Numbers: A Fascinating Mathematical Phenomenon

Have you ever encountered the term "Armstrong number" while diving into the world of programming or mathematics? If not, you're in for an intriguing journey of discovery! Armstrong numbers, also known as narcissistic numbers or pluperfect digital invariants, are a captivating mathematical phenomenon that can be explored through coding. In this blog post, we'll unravel the mystery behind Armstrong numbers and provide you with a JavaScript program to check whether a given number qualifies as an Armstrong number.

Understanding Armstrong Numbers

An Armstrong number (also referred to as a narcissistic number or pluperfect digital invariant) is a number that is equal to the sum of its own digits raised to the power of the number of digits. Let's break this down with an example:

Take the number 153. It has three digits. Now, let's compute the sum of its digits raised to the power of three (the number of digits):

1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153

As you can see, the sum of the digits raised to the power of three equals the original number itself, which makes 153 an Armstrong number.

Writing the JavaScript Program

Now that we understand what Armstrong numbers are, let's dive into writing a JavaScript program that checks whether a given number is an Armstrong number or not.


// Function to check if a number is an Armstrong number
function isArmstrongNumber(number) {
    const numStr = number.toString();
    const numDigits = numStr.length;
    let sum = 0;

    for (let digit of numStr) {
        sum += Math.pow(parseInt(digit), numDigits);
    }

    return sum === number;
}

// Test cases
const number1 = 153;
const number2 = 370;
const number3 = 371;
const number4 = 123;

console.log(`${number1} is an Armstrong number: ${isArmstrongNumber(number1)}`);
console.log(`${number2} is an Armstrong number: ${isArmstrongNumber(number2)}`);
console.log(`${number3} is an Armstrong number: ${isArmstrongNumber(number3)}`);
console.log(`${number4} is an Armstrong number: ${isArmstrongNumber(number4)}`);

In this program, the isArmstrongNumber function takes a number as an argument and checks whether it is an Armstrong number. It does so by converting the number to a string to extract its digits, calculating the sum of the digits raised to the power of the number of digits, and then comparing the sum with the original number.

Demo

Armstrong Number Checker

Enter a number to check if it's an Armstrong number:


Conclusion

Armstrong numbers offer a captivating glimpse into the world of number theory and programming. They showcase a unique property where the digits of a number interact in a fascinating way. By writing a JavaScript program to determine whether a given number is an Armstrong number, we've embarked on a journey that combines mathematical concepts with practical coding skills. So, the next time you encounter a number, consider exploring its Armstrong nature – you might just uncover a hidden gem of numerical intrigue!

Now write the same program in your favorite language in comment section. 

Other Challenges: 

  1. Day 1 Challenges
  2. Day 2 Challenges
  3. Day 3 Challenges

 

Labels:

Comments

Post a Comment

Popular posts from this blog

Day 7 - Challenge 2 - Valid Parentheses: A Guide to Checking Bracket Validity in JavaScript

Valid Parentheses: A Guide to Checking Bracket Validity in JavaScript Brackets are a fundamental part of programming languages and are used to group and structure code. In this blog post, we will explore the problem of determining whether a given string of brackets is valid or not using JavaScript. This problem is commonly referred to as the "Valid Parentheses" problem. Understanding the Problem: The problem statement provides a string that consists of three types of brackets: ( , ) , { , } , [ , and ] . The task is to determine whether the brackets in the string are arranged in a valid manner. For a string to be valid, each opening bracket must have a corresponding closing bracket of the same type, and they must be arranged in the correct order. For example, the strings "(){}[]" and "{[()]}" are valid, while "([)]" and "{{]}" are not. Approach: To solve this problem, we can use a stack data structure. The stack will help us keep tr...
Post a Comment
Read more

Day 9 - Challenge 2 - Reverse Linked List

Reversing a Singly Linked List in JavaScript: An In-Place Approach Introduction:   Singly linked lists are fundamental data structures in computer science that consist of a sequence of nodes, each containing data and a reference to the next node in the list. Reversing a singly linked list is a classic problem that challenges programmers to manipulate pointers effectively to achieve the desired outcome. In this blog post, we'll explore the problem of reversing a singly linked list using an in-place approach and provide a step-by-step solution in JavaScript. Problem Statement:   Given the head of a singly linked list, our task is to reverse the list in-place and return its new head. In other words, we need to modify the pointers of the nodes in such a way that the direction of the linked list is reversed. Solution Approach:   To solve this problem, we will iterate through the linked list while maintaining three pointers: previous , current , and next . The previous pointer...
Post a Comment
Read more

Day 8 - Challenge 3 - Unique Email Addresses

Solving the Problem of Counting Unique Email Addresses in JavaScript Introduction:  In today's digital age, email communication is an integral part of our lives. However, dealing with unique email addresses can sometimes be challenging due to variations that arise from period usage and the '+' character. In this blog post, we will explore how to tackle the problem of counting unique email addresses using JavaScript. Problem Statement: We are given a list of email addresses, and our task is to determine the number of unique email addresses. A unique email address consists of a local name and a domain name. The local name may contain periods ('.') and the character '+' which is ignored. Example:  Let's consider the following list of email addresses: "test.email+abc@gmail.com" "test.e.mail@gmail.com" "testemail@gmail.com" In this case, the number of unique email addresses is 1, as all three email addresses map to the same uniqu...
Post a Comment
Read more