Factorial

A mathematical operation that multiplies a positive integer by all smaller positive integers down to 1, denoted by an exclamation mark (n!).

Factorial

The factorial operation, written as n!, is a fundamental mathematical function that multiplies a sequence of decreasing integers. For any positive integer n, its factorial is the product of all positive integers less than or equal to n.

Definition

The factorial of n is defined as: n! = n × (n-1) × (n-2) × ... × 2 × 1

Special cases:

  • 0! is defined as 1 by convention
  • 1! = 1
  • Factorial is undefined for negative numbers

Applications

Combinatorics

Factorials play a crucial role in combinatorics, particularly in:

Mathematical Relations

The factorial function appears in various mathematical contexts:

Properties

  1. Growth Rate
  • Factorials grow extremely quickly
  • n! grows faster than exponential functions
  • This rapid growth connects to concepts in computational complexity
  1. Number Theory Connections
  • Factorials are always divisible by all integers up to n
  • Related to prime numbers through Wilson's theorem
  • Important in number theory studies

Computational Aspects

The calculation of large factorials presents interesting computational challenges:

Historical Context

The concept of factorial was first introduced by Christian Kramp in 1808, though the calculations were used earlier by many mathematicians including Euler and Gauss.

Related Concepts

Practical Applications

  1. Statistics and Probability
  1. Scientific Computing

The factorial function stands as one of the most fundamental operations in discrete mathematics, bridging multiple areas of mathematical study and practical application.