Flowchart for prime number

Flowchart for prime number

Q. Draw the flowchart diagram for check a number is prime number or not.

Ans.

Flowchart for check a number is prime or not as following:

Figure: Flowchart for check given number is
prime number or not

Generate first n Prime number

Generate first n Prime number

Q. Write a C program to generate first n prime number C program.

Ans.

/*c program for generate first n prime number*/
#include<stdio.h>
#include<conio.h>
int main()
{
 int n,num,t,div,count;
 printf("How many prime number you want to print: ");
 scanf("%d", &n);
 printf("\n%d\t",2); /*2 is first prime number*/
 count=1;
 num=3;
 while(count<n)
 {
  t=sqrt(num);
  div=2;
  while(div<=t)
  {
    if(num%div==0)
       break;
    div++;
  }
  if(div>t)
  {
     printf("%d\t",num);
     count++;
  }
  num=num+2;
 }
 getch();
 return 0;
}

search prime number

search prime number

Q. Write a C program to find whether a number is prime or not.

Definition of prime number:A prime number is one,which is divisible only by one or itself. And its must greater than 1.

And if number is not prime, it is called composite number and vice versa.

Ans.

#include<stdio.h>

#include<stdio.h>

int main()

{

 int x,num;

 printf("Enter number : ");

 scanf("%d",&num);

 x=2;

 while(x<=num-1)

 {

   if(num%x==0)

   {

      printf("Number is not prime!!");

      break;

   }

   x++;

 }

 if(x==num)

    printf("Number is prime!!");
 getch();

 return 0;

}

Flowchart for finding Armstrong number C program

Flowchart for finding Armstrong number C program:

Figure: Flowchart for finding number is 
Armstrong or not C program

Perfect number

Perfect number

Q. Write a C program to check whether a given number is a perfect number or not.

Ans.

Definition of Perfect number: A positive integer n is called a perfect number if it is equal to the sum of all of its positive divisors, excluding n itself.

For example, 6 is perfect integer number, because 1, 2 and 3 are its proper positive divisors and 1+2+3=6.

The next perfect number is 28 because 1+2+4+7+14=28.

The next perfect number is 496 because

1+2+4+8+16+31+62+124+248=496.

/*program to check whether a number is perfect or not*/

#include<stdio.h>

#include<conio.h>

int main()

{

 int i,n,num,sum=0;

 printf("Enter a number : ");

 scanf("%d",&num);

 n=num;

 for(i=1; i<n; i++)

 {

  if(num%i==0)

     sum=sum+i;

 }

 if(num==sum)

  printf("Given number is Perfect Number ");

 else

  printf("Given number is Not Perfect Number ");
 getch();
 return 0;

}

Output:-

Enter a number : 7543

Given number is Not Perfect Number

Enter a number : 8128

Given number is Perfect Number

Amicable numbers

Amicable numbers

Q. writes a C program to check whether given two numbers are amicable numbers or not.

Ans.

Definition of Amicable numbers: Amicable numbers are two numbers so related that the sum of the proper divisors of the one is equal to the other, unity being considered as a proper divisor but not the number itself.

For example, lets a pair or two number pair is (220,284),

For the proper divisor of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, of which the sum is 284.

And the proper divisor of 284 are 1, 2, 4, 71, 142 of which the sum is 220.

/*program to check whether given numbers are amicable or not*/

#include<stdio.h>

#include<conio.h>

int main()

{

 int n1,n2,s1=0,s2=0,i;

 printf("Enter first number : ");

 scanf("%d",&n1);

 printf("Enter second number : ");

 scanf("%d",&n2);

 for(i=1; i<n1 ; i++)

 {

   if(n1%i==0)

      s1=s1+i;

 }

 for(i=1; i<n2 ; i++)

 {

   if(n2%i==0)

      s2=s2+i;

 }

 if(n1==s2 && n2==s1)

  printf("Given numbers are Amicable Numbers");

 else

  printf("Given numbers are Not Amicable Numbers");
 getch();

 return 0;

}

Output:-

Enter first number : 452

Enter second number : 264

Given numbers are Not Amicable Numbers

Enter first number : 220

Enter second number : 284

Given numbers are Amicable Numbers

print Armstrong number range

print Armstrong number range

Q. Write a C program to accept a number from user and print all the Armstrong number that are less then or equal to user number.

or

Q. write a C program to print Armstrong number from 1 to 1000.

Ans.

/*C program to printing armstrong number between a specific range*/
#include<stdio.h>
#include<conio.h>
int main()
{
 int num,d1,d2,d3,tmp,st;
 printf("Enter ending number: ");
 scanf("%d", &num);
 for(st=1; st<=num; st++)
 {
  d1=st-((st/10)*10);
  d2=(st/10)-((st/100)*10);
  d3=(st/100)-((st/1000)*10);
  tmp=(d1*d1*d1)+(d2*d2*d2)+(d3*d3*d3);
  if(tmp==st)
     printf("\nArmstrong number is: %d",tmp);
 }
 getch();
 return 0;
}

/************Output************/