answersLogoWhite

0

Why is 9 a Factorial number?

User Avatar

Anonymous

13y ago
Updated: 8/20/2019

Because it is a product of real numbers. And the set of real numbers is closed under multiplication.

User Avatar

Wiki User

13y ago

What else can I help you with?

Related Questions

What is the value of 9 factorial plus 6 factorial?

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


What is 9 factorial?

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


What is the flowchart and pseudocode for a program that accept and displays the factorial of a number?

A flowchart for a program that accepts and displays the factorial of a number would include the following steps: Start, Input the number, Initialize a variable for the factorial, Use a loop to calculate the factorial by multiplying the variable by each integer up to the number, Output the result, and End. Pseudocode for the same program would look like this: START INPUT number factorial = 1 FOR i FROM 1 TO number DO factorial = factorial * i END FOR OUTPUT factorial END


How many zeros are possible factorial 10 to the power factorial 10?

To calculate the number of zeros in a factorial number, we need to determine the number of factors of 5 in the factorial. In this case, we are looking at 10 to the power of 10 factorial. The number of factors of 5 in 10! is 2 (from 5 and 10). Therefore, the number of zeros in 10 to the power of 10 factorial would be 2.


How many diagonals do hexagons have?

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.


Write a recursive procedure to compute the factorial of a number?

#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;


Write a java program to find the factorial of a given number?

Here's a simple Java program to find the factorial of a given number using a recursive method: import java.util.Scanner; public class Factorial { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print("Enter a number: "); int number = scanner.nextInt(); System.out.println("Factorial of " + number + " is " + factorial(number)); } static int factorial(int n) { return (n == 0) ? 1 : n * factorial(n - 1); } } This program prompts the user for a number and calculates its factorial recursively.


What does an exclamation mark after a number mean?

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.


What is the time complexity, in terms of Big O notation, for calculating the factorial of a number?

The time complexity for calculating the factorial of a number is O(n), where n is the number for which the factorial is being calculated.


Programming to calculate a factorial number?

double factorial(double N){double total = 1;while (N > 1){total *= N;N--;}return total; // We are returning the value in variable title total//return factorial;}int main(){double myNumber = 0;cout > myNumber;cout


Write the Pseudocode to find the factorial of a number?

Pseudo code+factorial


A program for simple factorial in prolog?

In Prolog, a simple factorial program can be defined using recursion. Here's a basic implementation: factorial(0, 1). % Base case: factorial of 0 is 1 factorial(N, Result) :- N > 0, N1 is N - 1, factorial(N1, Result1), Result is N * Result1. % Recursive case You can query the factorial of a number by calling factorial(N, Result). where N is the number you want to compute the factorial for.