Skip to main content

Factorial of a Number

       FACTORIAL  !

  The factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to 1.
   For example the factorial of 6 is 6! = 6*5*4*3*2*1 = 720

The value of 0! is 1 , according to the convention for an empty product.
We can calculate a factorial of a number(n)  from the previous one i.e. by multiplying the number (n)  to a factorial of number(n-1) .

n! = n * (n-1)!
For example: 5! = 5*4*3*2*1 = 120 . So calculate the factorial of 6 by above rule.
6! = 6 * (6-1)! = 6 * 5!= 6 * 120 = 720

7! = 7 * (7-1)! = 7 * 6!= 7 * 720 = 5040



To see the working of flowchart, 
Click here to watch on YouTube




To write the program in C, 
Click here to watch on YouTube



 To Create the Factorial App in MIT App Inventor 
Click here to watch on YouTube



Download the Factorial Android App here

Comments

  1. BASANT KUMAR28 May 2023 at 00:21

    pikashow Picasso Apps is a video streaming platform from where you can watch TV Shows, Web Series, IPL Live, and the Latest Movies for free.

    pikashow Picasso Apps is a video streaming platform from where you can watch TV Shows, Web Series, IPL Live, and the Latest Movies for free.

    What is the Factorial of One Hundred Before diving into the depths of the factorial of one hundred, let us first grasp the concept of factorials.

    ReplyDelete
  2. annapeke6 May 2026 at 02:58

    Understanding how to calculate the factorial of a number is a classic exercise that helps beginners grasp the power of recursion and loops. In the fast-paced world of digital entertainment and sports analytics, having access to cutting-edge tools like cbtfturbo247 ensures that you never miss a beat during the live action.

    ReplyDelete

Post a Comment

Popular posts from this blog

Prime Numbers

Prime Number is a natural number greater than 1 that has exactly two distinct natural number divisors: 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number. For example, 13 can only be divided by 1 and  by 13 itself. Here is a list of all the prime numbers up to 100: 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47, 53,59,61,67,71,73,79,83,89,97,.. 1 is not a prime number as in definition “For a number to be prime it must have two  d istinct (different) factors. Algorithm Step1: Input the number(n) to check for prime number Step2: If n is below or equal to 1  then go to step 12 Step3: if n is equal to 2 then go to step 11 Step4: Assign variable count =n / 2 Step5: Assign variable a=1 Step6: Add 1 to a and store it to variable a Step7: remainder = n % a Step8: if remainder=0 then go to step 12 Step9: subtract one from count and store it to variable count Step10: if count is not equal to 0 then go to s...
Post a Comment
Read more

Fibonacci Sequence Flowchart

Fibonacci Sequence Flowchart In the previous video of Fibonacci sequence ,we learned about the Fibonacci series and how to write an algorithm. In this video we will learn how to draw a flowchart for it. First let us write an algorithm for it again. 0,1,1,2,3,5,8,13,21,34,55,89,… Step1: Input the number(n) till which the Fibonacci series will run Step2: Assign the variables a equal to -1 and b equal to 1 Step3: Add the variables a & b and assign it to variable x Step4: Display the value of x Step5: Assign the value of b to variable a Step6: Assign the value of x to variable b Step7: Subtract one from n and store it to variable n Step8: If the value of n is not zero, go back to the Step3 Step9: Fibonacci numbers displayed till n numbers. To see the working of above flowchart,  Click here to Watch on YouTube To write the program in C,   Click here to Watch on YouTube To make the Fibonacci Sequence  And...
Post a Comment
Read more

Armstrong Number

            An Armstrong number is an  n -digit number that is equal to the sum of the  n th  powers of its digits. For example 153 is an Armstrong Number in 3 digit number 1 3  +  5 3  +  3 3   =  153 1  +125+27  =153 1634 is an Armstrong Number in 4 digit number 1 4  + 6 4  + 3 4  + 4 4  =  1634 1+1296+81+256=1634 And so numbers from 0-9 all are Armstrong Numbers as  0 1 is 0 , 1 1   is 1,   2 1 is 2 , 3 1 is 3 and so on..   Armstrong Algorithm Step1: Read a number.  Step2:  Store all the digits of a number in an array digits[] Step3:  Count all the digits of a number and store in variable   length Step4:  Start a loop till  the length of a number Step5: Raise each digit to a power equal to the number of digits in the number. For ex, each digit of a thre...
Post a Comment
Read more