The Fibonacci series is a sequence of integers in which the first two integers are 1 and from third integer onwards each integer is the sum of the previous two integers of the sequence i.e. 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ………………………….. The program which implements the above logic is […]

The GCD or HCF (Highest Common Factor) of two integers is the greatest integer that divides both the integers with remainder equals to zero. This can be illustrated by Euclid’s remainder Algorithm which states that GCD of two numbers say x and y i.e. GCD(x, y) = x if y is 0 = GCD(y, x%y) […]

We can write, nm = n*nm-1 =n*n*nm-2 =n*n*n*……………m times *nm-m The program which implements the above logic is as follows: #include<stdio.h> int power(int,int); void main() { int n,m,k; printf(“Enter the value of n and m”); scanf(“%d%d”,&n,&m); k=power(n,m); printf(“The value of nm for n=%d and m=%d is %d”,n,m,k); } int power(int x, int y) { if(y==0) […]

We can say ‘sum of numbers from 1 to n can be represented as sum of numbers from 1 to n1 plus n’ i.e. The sum of numbers from 1 to n = n + Sum of numbers from 1 to n-1 = n + n-1 + Sum of numbers from 1 to n-2 = […]

#include <stdio.h> // Function to calculate factorial int factorial(int n) { int fact = 1; for(int i = 1; i <= n; i++) { fact *= i; } return fact; } int main() { int num; printf(“Enter a positive integer: “); scanf(“%d”, &num); if(num < 0) { printf(“Factorial is not defined for negative numbers.\n”); } […]

Actual Arguments These are the real values or variables you pass to a function when calling it. They appear in the function call. int main() { int a = 10, b = 20; add(a, b); // a and b are actual arguments return 0; } Formal Arguments These are the placeholders or parameters defined in […]

#include <stdio.h> int main() { int i, j, isPrime; printf(“Prime numbers from 2 to 20 are:\n”); for (i = 2; i <= 20; i++) { // Outer loop: check each number from 2 to 20 isPrime = 1; // Assume i is prime for (j = 2; j < i; j++) { // Inner loop: […]

#include <stdio.h> int main() { int num, reversed = 0, remainder; // Input from user printf(“Enter an integer: “); scanf(“%d”, &num); while (num != 0) { remainder = num % 10; // Get the last digit reversed = reversed * 10 + remainder; // Build the reversed number num = num / 10; // Remove […]

Counting the number of digits in a number is a common beginner-level program in C. This helps in understanding how to use loops and arithmetic operations like division. #include <stdio.h> int main() { int num, count = 0; // Input from user printf(“Enter a number: “); scanf(“%d”, &num); // Handle 0 separately if (num == […]

A number is called a palindrome if it reads the same backward as forward. Examples: 121, 1331, 454 are palindrome numbers. #include int main() { int num, original, reversed = 0, remainder; // Input from user printf(“Enter a number: “); scanf(“%d”, &num); original = num; // Store original number // Reverse the number while (num […]