Skip to main content

Sum of digits of a number down to a single digit.

PROCEDURE:-

      1.enter integer value n
      2.repeat  step 3 to 8 until n is greater than 9
      3.set sum to 0
      4.repeat  step 5 to 7 until n is greater than
      5. find the modulo 10 for n and store result in r
      6.add r to previous sum
      7. find new value of n by dividing it by 10
      8 set  n to sum
      9. print sum


CODE:-

#include<stdio.h>
void main()
{
  int n,m,sum,r;
  printf(“enter value for n”);
  scanf(“%d”,&n);
  m=n;
  while(n>9)
  {
    sum=0;
    while(n>0)
     {
       r=n%10;
       sum=sum+r;
       n=n/10;
     }
   n=sum;
}
printf(“sum of %d down to single digit is %d”,m,sum);
}


Input:- enter value for n 137
Output:- sum of 137 down to single digit is 2
 

Comments

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

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