C Program - Check Armstrong Number
A positive natural number is known as Armstrong number of order n if it can be expressed as the sum of each digits of the number raised to the power of n. Mathematically, it can be expressed as:
Examples:
153 = 13+53+33 = 1+125+27 = 153
371 = 33+73+13 = 27+343+1 = 371
1634 = 14+64+34+44 = 1+1296+81+256 = 1634
Method 1: Check Armstrong Number
In the example below, the MyNum is checked for Armstrong number using function called ArmStrongNum(). The function requires two parameters, first the number and second the number of digits in it. It calculates power of the digit using the Pow() function. See the example below for syntax:
#include <stdio.h> static int Pow(int, int); static void ArmStrongNum(int, int); //Calculate power of a digit static int Pow(int MyNum, int n) { int x = 1; while(n > 0) { x = x*MyNum; n--; } return x; } static void ArmStrongNum(int MyNum, int Order) { int y = MyNum; int sum = 0; while (y > 0) { int x = y % 10; sum = sum + Pow(x, Order); y = y/10; } if (MyNum == sum) { printf("%i is a Armstrong Number.\n", MyNum); } else { printf("%i is not a Armstrong Number.\n", MyNum); } } int main() { ArmStrongNum(371, 3); ArmStrongNum(1634, 4); ArmStrongNum(1000, 4); }
The above code will give the following output:
371 is a Armstrong Number. 1634 is a Armstrong Number. 1000 is not a Armstrong Number.
Method 2: Armstrong Number of order n
In this example, ArmStrongNum function requires only one parameter, the number itself. The number of digits in the passed parameter is estimated inside the function.
#include <stdio.h> static int Pow(int, int); static void ArmStrongNum(int); //Calculate power of a digit static int Pow(int MyNum, int n) { int x = 1; while(n > 0) { x = x*MyNum; n--; } return x; } static void ArmStrongNum(int MyNum) { int y = MyNum; int sum = 0; int Order = 0; //Find number of digit in the Number while(y > 0) { Order++; y = y / 10; } y = MyNum; while (y > 0) { int x = y % 10; sum = sum + Pow(x, Order); y = y/10; } if (MyNum == sum){ printf("%i is a Armstrong Number.\n", MyNum); } else { printf("%i is not a Armstrong Number.\n", MyNum); } } int main() { ArmStrongNum(153); ArmStrongNum(9474); ArmStrongNum(5000); }
The above code will give the following output:
153 is a Armstrong Number. 9474 is a Armstrong Number. 5000 is not a Armstrong Number.
Recommended Pages
- C Program - To Check Prime Number
- C Program - Bubble Sort
- C Program - Selection Sort
- C Program - Maximum Subarray Sum
- C Program - Reverse digits of a given Integer
- C - Swap two numbers
- C Program - Fibonacci Sequence
- C Program - Insertion Sort
- C Program - Find Factorial of a Number
- C Program - Find HCF of Two Numbers
- C Program - Merge Sort
- C Program - Shell Sort
- Stack in C
- Queue in C
- C Program - Find LCM of Two Numbers
- C Program - To Check Whether a Number is Palindrome or Not
- C Program - To Check Whether a String is Palindrome or Not
- C Program - Heap Sort
- C Program - Quick Sort
- C - Swap Two Numbers without using Temporary Variable