Program 1: SUM OF DIGITS
Coding:
1. #include<stdio.h>
2. int main()
3. {
4. int n,sum=0,m;
5. printf("Enter a number:");
6. scanf("%d",&n);
7. while(n>0)
8. {
9. m=n%10;
10. sum=sum+m;
11. n=n/10;
12. }
13. printf("Sum is=%d",sum);
14. return 0;
15. }
OUTPUT :
Enter a number:654
Sum is=15
Enter a number:123
Sum is=6
Program 2: To check wheather the number is PALINDROME or not.
An integer is a palindrome if the reverse of that number is equal to the original
number.
Coding:
1. #include <stdio.h>
2. int main() {
3. int n, reversed = 0, remainder, original;
4. printf("Enter an integer: ");
5. scanf("%d", &n);
6. original = n;
7. remainder = n % 10;
8. reversed = reversed * 10 + remainder;
9. n /= 10;
10. }
11. if (original == reversed)
12. printf("%d is a palindrome.", original);
13. else
14. printf("%d is not a palindrome.", original);
15. return 0;
16. }
OUTPUT:
Enter an integer: 1001
1001 is a palindrome.
Program 3: To check wheather the number is PRIME or not.
Coding:
#include <stdio.h>
int main() {
int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);
for (i = 2; i <= n / 2; ++i) {
// condition for non-prime
if (n % i == 0) {
flag = 1;
break;
}
}
if (n == 1) {
printf("1 is neither prime nor composite.");
}
else {
if (flag == 0)
printf("%d is a prime number.", n);
else
printf("%d is not a prime number.", n);
}
return 0;
}
OUTPUT:
Enter a positive integer: 29
29 is a prime number.
Program 4: To check wheather the number is PRIME or not.
Coding:
#include <stdio.h>
void main()
{
int fib1 = 0, fib2 = 1, fib3, limit, count = 0;
printf("Enter the limit to generate the Fibonacci Series \n");
scanf("%d", &limit);
printf("Fibonacci Series is ...\n");
printf("%d\n", fib1);
printf("%d\n", fib2);
count = 2;
while (count < limit)
{
fib3 = fib1 + fib2;
count++;
printf("%d\n", fib3);
fib1 = fib2;
fib2 = fib3;
}
}
OUTPUT:
Enter the limit to generate the Fibonacci Series
6
Fibonacci Series is ...
0
1
1
2
35