Skip to main content

Find G.C.D.(Greatest Common Divisor) of two numbers.

PROCEDURE:-

      1.input two interger values a and b
      2.if a is greater than b
      3.set n=b
      4.else set n=a
      5.repeat steps  6 and 9 until n is greater than 0
      6 find a modulo n and b modulo n, if modulo value is 0
      7. print gcd value as n
      8.stop
      9else decrement n by 1
CODE:-

#include<stdio.h>
void main()
{
int a,b,n;
printf(“enter two numbers for a,b to find GCD”);
scanf(“%d %d “,&a,&b);
if(a>b)
      n=b;
else
      n=a;
do
{
      if(a%n = = 0 && b%n = = 0)
          {
   printf(“ GCD for %d and %d is  %d”,a,b,n);
   break;
          }
      else
          n=n-1;
  }while(n>0);
}


Input:- enter two numbers for  a ,b to find GCD  16 24
Output:- GCD for 16 and 24 is  8
Labels:

Comments

Post a Comment

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

PROCEDURE:-        1.enter values for u,a,t to find distance        2.find distance with the formulae ut+1/2at 2        3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() {   float u,t,a,S;   clrscr();   printf(“enter values u,t,a”);   scanf(“%f %f %f”, &u,&t,&a);   S=(u*t)+(0.5*a*t*t);   printf(“\n  S = %f”, S); } Input:- enter values u,t,a               U=10,t=4,a=4.9 Output:- S =79.200
1 comment
Read more

Check whether a given number is Fibonacci prime or not.

PROCEDURE:- 1.input an integer n 2. first check whether it is prime or not 3. if it prime check whether it is in the Fibonacci series 4.the above check can be made by generating series and comparing each number with n 5.if n is found in the series then n is Fibonacci prime 6.else it is not Fibonacci prime   CODE:- #include<stdio.h> void main(){ int n,i=2,k=0,a,b,i,m; printf(“enter the number”); scanf(“%d”,&n); while(i<=n/2) { if(n%i = = 0)   {     k=1; break;   } i++; } if(k!=1) { a=0; b=1; i=1; m=n; while(i<=m) {   c=a+b;    if(m= =c)     {      printf(“ %d is Fibonacci prime”,n);    break;     } a=b; b=c; i++; } if(m!=c) printf(“%d  Not Fibonacci prime”,n); } else printf(“not prime “); } Input:- enter the number  13 Output:- 13 is Fibonacci prime  
Post a Comment
Read more