11.Program to find whether a given number is Prime or Not
#include<stdio.h> #include<conio.h> // Linux user - Remove this int main() { /* Declaring variable for n=number, c=counter variable:holds number of factor of 'n' */ int n,c=0, i; // Inputting number printf("Enter number to check whether Prime or Not:"); scanf("%d",&n); // Checking whether number valid or not if(n>0) { // Checking whether number is prime or not for(i=1;i<=n;i++) { if(n%i==0) c=c+1; } if(c==2) printf("Prime Number"); else printf("Not a Prime Number"); } else printf("Not a valid Number");
getch(); // Linux user - Remove this return 0; }
12.Program to print ( list ) all the prime number between 1 to n
#include<stdio.h> #include<conio.h> // Linux user - Remove this int main() { /* Declaring variable for n=number, c=counter variable:holds number of factor of 'n' */ int n,c, i,j; // Inputting number printf("Enter number till which you want to list prime number:"); scanf("%d",&n); // Checking whether number valid or not if(n>0) { printf("List of Prime Numbers:"); // Checking whether number is prime or not for(i=1;i<=n;i++) { c=0; for(j=1;j<=i;j++) { if(i%j==0) c=c+1; } if(c==2) printf("%d ",i); } } else printf("Not a valid Number"); getch(); // Linux user - Remove this return 0; }
13.Program to print (list) Palindrome number from 10 to n
// Palindrome Number: Reverse of Number = Number #include<stdio.h> #include<conio.h> // Linux user - Remove this int main() { /*declaring variable for num=user wish, i=acts as number, n=to copy number, d=digit, rev=reverse of number */ int num,n,d=0,rev,i; // Inputting number printf("Enter number till which you want to list Palindrome Number:"); scanf("%d",&num); printf("List of Palindrome Number:"); for(i=10;i<=num;i++) { // copying number in n n=i; rev=0; // Determining whether number is palindrome or not while(n!=0) { d=n%10; rev=rev*10+d; n=n/10; } // Displaying Whether number is palindrome or not if(i==rev) printf("%d ",i); } getch(); // Linux user - Remove this return 0; }
14.Program to print (list) Armstrong Number between two given numbers
// Armstrong Number: Sum of cube of digit=Number #include<stdio.h> #include<conio.h> // Linux user - Remove this int main() { /*declaring variable for s=start point, e=end point, i=acts as number, n=to copy number, d=digit, s=sum */ int s,e,n,d=0,sum,i; // Inputting number printf("Enter form where you want to list Armstrong Number:"); scanf("%d",&s); printf("Enter number till which you want to list Armstrong Number:"); scanf("%d",&e); printf("List of Armstrong Number:"); for(i=s;i<=e;i++) { // copying number in n n=i; sum=0; // Determining whether number is pallindrome or not while(n!=0) { d=n%10; sum=sum+(d*d*d); n=n/10; } // Displaying Whether number is pallindrome or not if(i==sum) printf("%d ",i); } getch(); // Linux user - Remove this return 0; }
#include<stdio.h> #include<conio.h> // Linux user - Remove this int main() { // Declaring variable for n=numbre,i=to iterate the loop int n,i; // Inputing number printf("Enter any number:"); scanf("%d",&n); // Determining and Displaying factors printf("Listing Factors of %d :",n); for(i=1;i<=n;i++) { if(n%i==0) printf("%d ",i); } getch(); // Linux user - Remove this return 0; }