STRONG NUMBER PROGRAM IN C

-

In this example , you will learn a program to check whether entered number is strong number or  not.


Strong number:

If sum of factorials of digits of a number is equal to the original number, then it is called as Strong number.

Let's consider one example,

suppose we have to check whether 145 is strong number or not .

1! + 4!+ 5!

= 1 + 24 + 120

= 145

i.e. equal to the original number.

Hence, 145 is a strong number.


Algorithm to check for strong number:

1. Input any number from user to check for strong number.

2. Initiailize one variable sum to store the sum of factorials of digits.

3. Find last digit of number by using modulo operator (%).

4. Find the factorial of last digit and add it to the sum.

5. Then remove the last digit from the number as it is not required further.

6. Repeat steps 3-6 until number >0.

7. Check whether sum is equal to the number or not. If sum is equal to entered number then it is strong number otherwise it is not a strong number.


Program to check for strong number in C:


//program to check whether number is strong or not.

#include<stdio.h> 
int main( )
{
int i, num, temp, rem, sum=0, fact=1;
printf("Enter the number :");                
scanf("%d",&num);
temp=num;


while(num>0)
{
rem=num%10;

for(i=1;i<=rem;i++)
{
fact=fact*i;
}

sum= sum+ fact;
num=num/10;
}

num=temp;
if(sum==num)
{
printf("%d is strong number",num);
}
else
{
printf("%d is not a strong number",num);
}
return 0;
} 


Output:


Enter the number:145
145 is Strong number


Enter the number:179
179 is not Strong number



So that's it ! Just try this code by your own. If you have any doubts then feel free to drop a comment . I'll be happy to answer your questions .
Keep coding....

 

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO CONVERT BINARY CODE TO GRAY CODE

-
Image
 In this example, you will learn a program to convert the Binary code into its equivalent Gray code. (To understand this program , you should have prior knowledge about binary codes , gray codes and its conversion algorithms. ) Here are some examples of binary and its equivalent gray code: Program: //Program to Convert Binary Code to Gray Code #include<stdio.h>  int bintogray(int); int main ( ) { int bin, gray; printf ("Enter a binary number: "); scanf( "%d" , &bin ); gray = bintogray(bin); printf ("The gray code of %d is %d\n", bin, gray); return 0; } int bintogray(int bin) { int a, b, result = 0, i = 0; if (!bin) {      return 0; } else {      a = bin % 10;      bin = bin / 10;      b = bin % 10;      if ((a && !b) || (!a...
Read more

PROGRAM TO ADD TWO COMPLEX NUMBERS

-
 In this example , you will  learn a program to add two complex numbers by passing structure to function. (To understand this program , you should have prior knowledge about complex numbers and its addition .) Program: //Program to add two complex numbers #include<stdio.h>  typedef struct complex { float real; float imagi; } complex ; complex add(complex n1, complex n2); int main( ) { complex n1, n2, result; printf ("For 1st complex number \n"); printf ("Enter the real and imaginary parts: "); scanf(" %f %f ", &n1.real, &n1.imagi ); printf ("\nFor 2nd complex number \n"); printf ("Enter the real and imaginary parts: "); scanf(" %f %f ", &n2.real, &n2.imagi ); result = add(n1, n2); printf ("Sum of complex numbers = %.1f + %.1fi", result.real, result.imagi); return 0; } complex add(complex n...
Read more

FIBONACCI SERIES PROGRAM IN C

-
In this example , you will learn to print the Fibonacci series upto n terms (entered by user).  The Fibonacci series is sequence in which next term is the sum of previous two terms. The first two terms of the Fibonacci series are 0 and 1. The Fibonacci series of first 10 terms is :                 0     1      1       2      3     5    8     13    21      34 The next number is found by adding previous two numbers :          > The third term , which is 1 , is the sum of first two terms 0 and 1.          > Then 1 +1 =2 , and 2  is the fourth term i.e sum of 2nd and 3rd terms.          > The 3 is found by adding two numbers before it (1+2).          >  Then 5 is 2+3 .       ...
Read more