Java Program to Calculate N Factorial

Factorial is a fundamental mathematical concept in combinatorics and probability. This guide explains how to write a Java program to calculate the factorial of a number n, including code examples, formula explanation, and practical applications.

What is Factorial?

The factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n. It's a key concept in combinatorics, probability, and algebra.

n! = n × (n-1) × (n-2) × ... × 1

By definition, 0! = 1. Factorials grow very rapidly with increasing n, which is why they're important in calculating permutations and combinations.

Java Program to Calculate Factorial

Here's a complete Java program that calculates the factorial of a given number n:

import java.util.Scanner; public class FactorialCalculator { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print("Enter a non-negative integer: "); int n = scanner.nextInt(); if (n < 0) { System.out.println("Factorial is not defined for negative numbers."); } else { long factorial = calculateFactorial(n); System.out.println(n + "! = " + factorial); } } public static long calculateFactorial(int n) { if (n == 0 || n == 1) { return 1; } long result = 1; for (int i = 2; i <= n; i++) { result *= i; } return result; } }

This program uses a simple iterative approach to calculate the factorial. The calculateFactorial method handles the actual calculation, while the main method provides user interaction.

How the Java Program Works

The program prompts the user to enter a non-negative integer.
It checks if the input is negative (factorial is undefined for negative numbers).
If the input is valid, it calculates the factorial using an iterative approach.
The result is then displayed to the user.

The program uses long data type for the result to handle larger factorials. For very large n (typically n > 20), the result may exceed the maximum value that can be stored in a long (2^63-1).

Examples of Factorial Calculation

n	n!
0	1
1	1
5	120
10	3,628,800

These examples show how quickly factorials grow. For instance, 10! is already 3,628,800, which demonstrates the importance of factorial in combinatorial mathematics.

Limitations of Factorial Calculation

Factorials are only defined for non-negative integers.
For large n, the result may exceed the maximum value that can be stored in standard data types.
Calculating factorials for very large n can be computationally expensive.

In practical applications, you might need to use BigInteger in Java to handle very large factorials that exceed the limits of primitive data types.

FAQ

What is the factorial of 0?: The factorial of 0 is defined as 1. This is a mathematical convention that's useful in combinatorics.
Can I calculate the factorial of a negative number?: No, factorial is only defined for non-negative integers. Attempting to calculate the factorial of a negative number will result in an error.
Why does the factorial grow so quickly?: The factorial function grows very rapidly because it's the product of all positive integers up to n. This rapid growth is why factorials are important in combinatorics and probability.
What's the largest factorial I can calculate with this program?: With the current implementation using long, you can calculate factorials up to 20! (2,432,902,008,176,640,000). For larger values, you would need to use a BigInteger.