In this article, we will show you, How to write a C Program to Check for Prime Armstrong or Perfect Number with example. We already explained the concept of Prime, Armstrong or Perfect Number in our previous articles. So I suggest you to refer C Program for Armstrong Number, C Program to find Perfect Number, and C program to find Prime Number articles to understand the code.
C Program to Check for Prime Armstrong or Perfect Number
This program allows the user to enter the Size, and the row elements of One Dimensional Array. Next, we are created individual function to find whether it is a Prime Number, Armstrong, or Perfect Number.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 |
/* C Program to Check for Prime Armstrong or Perfect Number */ #include <stdio.h> #include <math.h> int Check_Armstrong (int Number); int Perfect_Number(int Number); int Prime_Number(int Number); int main() { int Number; printf("\nPlease Enter Number to Check whether it is an Armstrong, Prime, or Perfect : "); scanf("%d", &Number); // Calling Check_Armstrong Function to Check whether it is an Armstrong Number or Not if (Check_Armstrong(Number)) printf("\n %d is an Armstrong Number.", Number); else printf("\n %d is not an Armstrong Number.", Number); // Calling Prime_Number Function to Check whether it is a Prime Number or Not if(Prime_Number(Number) ) printf("\n %d is a Prime Number", Number); else printf("\n %d is Not a Prime Number", Number); // Calling Perfect_Number Function to Check whether it is a Perfect Number or Not if (Perfect_Number(Number) ) printf("\n %d is a Perfect Number", Number) ; else printf("\n %d is not a Perfect Number", Number) ; return 0; } /* C Program for Armstrong Number */ int Check_Armstrong (int Number) { int Temp, Reminder, Times = 0, Sum = 0; Temp = Number; while (Temp != 0) { Times = Times + 1; Temp = Temp / 10; } for(Temp = Number; Temp > 0; Temp = Temp /10 ) { Reminder = Temp % 10; Sum = Sum + pow(Reminder, Times); } if ( Number == Sum ) return 1; else return 0; } /* C Program for Perfect Number */ int Perfect_Number(int Number) { int i, Sum = 0 ; for(i = 1 ; i < Number ; i++) { if(Number % i == 0) Sum = Sum + i ; } if (Sum == Number) return 1; else return 0; } /* C Program to Find Prime Number */ int Prime_Number(int Number) { int i, Count = 0; for (i = 2; i <= Number/2; i++) { if(Number%i == 0) { Count++; } } if(Count == 0 && Number != 1 ) return 1; else return 0; } |
OUTPUT
OUTPUT 2
OUTPUT 3
Thank you for visiting our Blog
Leave a Reply