In this programme I have given the concept that whether the input number is armstrong or not.
For this we have to be clear about what the armstrong number is:
I will make clear about it by the help of example:
For example: 153 is armstrong number because 1^3*5^3*3^3 is 153 itself. So if the summation of the entered number is the number itself then it is called armstrong number.
The main source code of this programme is given below:
Don't miss
Wednesday, February 26, 2014
Popular Posts
-
Here is a solution of ioe engineering drawing tutorial 5 orthographics projection question no 7 -
In this page I have given the concept how to find the cube of the number entered using recursion. The main point to remember is :
-
1. A gas undergoes compression from an initial state of V₁ =0.1 m 3 , P₁ =200 KPa to a final state of V₂ =0.04 m 3 , P₂ =500 KPa. If the pre... -
In this program I have used array to enter the values and display the values in matrix form. I will elaborate how the program works on the b...
-
In this page I have written the program to find the numbers that are divisible by one number and not by another number. For more inform... -
In this programme I have given you the concept how to find the area of the circle using recursion function. I have used integer data types s...
-
In the last page I have written the program to find the transpose of the entered matrix. Now I have made a program that reads the number un... -
In this page I have given the concept to find the sum of the diagonal element of the entered desired matrix. For more information have a lo... -
Lets learn something new about string.In this page I have made a program to find the reverse order of the entered string without using sta... -
In this page I have kept the concept of checking whether a number is prime or composite using recursive function.However 1 is neither prime ...
0 comments :
Post a Comment