C Programming : সি প্রোগ্রামিং

This C Program calculates the GCD and LCM of two integers. Here GCD means Greatest Common Divisor. For two integers a and b, if there are any numbers d so that a / d and b / d doesn’t have any remainder, such a number is called a common divisor. Common divisors exist for any pair of integers a and b, since we know that 1 always divides any integer. We also know that common divisors can’t get too big since divisors can’t be any larger than the number they are dividing. Hence a common divisor d of a and b must have d <= a and d <= b. Here, LCM means Least Common Multiplies. For two integer a & b, to know if there are any smallest numbers d so that d / a and d / b doesn't have a remainder. such a number is called a Least Common Multiplier. Here is source code of the C program to calculate the GCD and LCM of two integers. The C program is successfully compiled and run on a Linux system. The program output is also shown below. 1.   /* 2.    * C program to find the GC

Write a program to find factorial of a given number using the recursive function method in C Hints: Factorial ! Example: 4! is shorthand for 4 x 3 x 2 x 1 The factorial function (symbol: ! ) means to multiply a series of descending natural numbers. Examples: 4! = 4 × 3 × 2 × 1 = 24 7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5040 1! = 1 Source Code: #include<stdio.h> //function declaration before the main int factorial(int n); //main function of the program int main() {     int n;     scanf("%d",&n);     //call function and print the final value at a time     printf("%d", factorial(n));     return 0; } int factorial(int n) {     if(n!=1)      return n*factorial(n-1); }

Figure of a Two Dimensional Array: Program: