Q: Why is 9 a Factorial number?

Write your answer...

The value of 9 factorial plus 6 factorial is 363,600

#include int main() { int fact,Factorial; printf("Please Enter Factorial Number\n"); scanf("%d",&fact); Factorial=func_fact(fact); printf("factorial is %d\n",Factorial); } int func_fact(int number) { int i; int factorial=1; for(i=number;i>=1;i--) { factorial=factorial*i; } return factorial; }

unsigned __int64 factorial(unsigned __int64 number) { unsigned __int64 factorial=1; while(number) factorial*=number--; return(factorial); }

By the definition of a factorial, multiply all numbers up to the number given. For example (using Java code): int number = 5; // Sample value long factorial = 1; for (int i = 1; i <= number; i++) { factorial *= i; } System.out.println(number + "! = " + factorial);

dim num as integer, factorial as single num=inputbox("enter a number") factorial = 1 for x = 1 to num factorial = factorial * x next x print"factorial is" ; factorial or By Recursive Method Private Function FindFactorial(number As Integer) If number < 1 Then FindFactorial = 1 Else FindFactorial = number * FindFactorial(number - 1) End If End Function ' recursive is faster and simpler for finding factorial

9 factorial = 9! = (9*8*7*6*5*4*3*2*1) = 362880

#!/bin/sh echo "Enter the number" read num factorial=1 for i in `seq 1 $num` do factorial=`expr $i \* $factorial` done echo $factorial

int main() { // Variable declarations. unsigned long int factorial = 1 , number = 1; // reads a number for finding its factorial. cout > number; while( number > 1 ) { factorial *= number * ( number - 1 ); number -= 2; } cout

#include <iostream> using namespace std; int main() { int i, number=0, factorial=1; // User input must be an integer number between 1 and 10 while(number<1 number>10) { cout << "Enter integer number (1-10) = "; cin >> number; } // Calculate the factorial with a FOR loop for(i=1; i<=number; i++) { factorial = factorial*i; } // Output result cout << "Factorial = " << factorial << endl;

The number of diagonals in an n-sided polygon is given by nC2 - n (where n is the number of sides of the polygon) or in the expanded form: factorial (n) _______________________ {factorial (2) * factorial (n-2)} substituting (n = 6) for a hexagon we get the number of diagonals as 9. Similarly, substituting (n=5) for a pentagon we get the number of diagonals as 5.

You get the factorial by multiplying the number with every number before down to 1. Factorial of 3 would be 3! = 3 * 2 * 1 = 6 or the factorial of 5 would be 5! = 5 * 4 * 3 * 2 * 1 = 120.

Mathematically it represents a factorial of that number. A factorial is when you take each number up to value and multiply them. So factorial 5 is 1 x 2 x 3 x 4 x 5. Factorial 11 is 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 x 11. This is often written with the number you are getting the factorial for, followed by an exclamation mark.

Pseudo code+factorial

A recursive function is one that calls upon itself until a given result in the original call is met. Take a look at this example. Program Recursion; Uses crt; Var number:longint; Function Factorial(number:longint):longint; Begin if number > 0 then factorial:=number*factorial(number-1) else factorial:=1; End; Begin clrscr; readln(number); writeln(factorial(number)); readln; End. Note how the function factorial calls itself.

2.5

Factorial (n) = n * Factorial (n-1) for all positive values n given Factorial (1) = Factorial (0) = 1. Pseudo-code: Function: factorial, f Argument: positive number, n IF n<=1 THEN RETURN 1 ELSE RETURN n * f(n-1) END IF

6.22702 E+9

A big number.

using c program write factorial number with do..while statement

The factorial of a number is the product of all the whole numbers, except zero, that are less than or equal to that number.

a factorial number is a number multiplied by all the positive integers i.e. 4!=1x2x3x4=24 pi!=0.14x1.14x2.14x3.14 0!=1

/*this is the program to find the factorial to n numbers*/ #include<stdio.h> void main() { int n,f,factorial(int); printf("which number facrorial you want?"); scanf("%d",&n); f=factorial(n); printf("The factorial upto %d is %d",n,f); } int factorial(int a) { if(a==0) return 1; else return (a)*factorial(a-1); }

You first look at the number that is before the !(factorial sign). Then you times all positive integers (which means it doesn't include 0), including the number itself. The answer is the factorial of the original number beside the ! sign. EX.:4!=1x2x3x4=24

Factorial 10 to the power factorial 10 will have 7257600 zeros.

A factorial is a whole number multiplied by all the whole numbers less than that number. So 3 factorial (written as 3!) is 3 times 2 times 1=6