Professional Documents
Culture Documents
Abhishek 2
Abhishek 2
#include <stdio.h>
sum_of_digits = 0; printf("Enter
an integer: ");
scanf("%d", &num);
+= digit;
return 0;
#include <stdio.h>
1, next, i = 2;
scanf("%d", &n);
first + second;
first = second;
second = next;
i++;
printf("\n");
return 0;
#include <stdio.h>
int main() {
int n;
unsigned long long factorial = 1; // Use "unsigned long long" to handle larger factorials
scanf("%d", &n);
if (n < 0) {
*= i;
return 0;
#include <stdio.h>
num2, max;
} else {
while (1) {
break;
max++;
return 0;
int main() {
int num;
int isPrime = 1; // Assume the number is prime by default
if (num <= 1) {
isPrime = 0; // Numbers less than or equal to 1 are not prime
}
else {
for (int i = 2; i * i <= num; i++)
{ if (num % i == 0) {
isPrime = 0; break;
}
}
}
if (isPrime) {
printf("%d is a prime number.\n", num);
} else {
printf("%d is not a prime number.\n", num);
}
return 0;
}
return 0;
}
12) Sum
#include<stdio.h>
int main(){
float x,sum,t,d;
int i,n;
printf("Input the Value of x : ");
scanf("%f",&x);
printf("Input the number of terms : ");
scanf("%d",&n);
sum=1;
t=1;
for(i=1; i<n; i++){
d=(2*i)*(2*i-1);
t=-t*x*x/d;
sum=sum+t;
}
printf("The sum = %f\n Number of terms = %d\n value of x = %f\n",sum,n,x);
return 0;
}