Explore Permutation on MathWorld

In combinatorics, a permutation is a rearrangement of the elements in an ordered list S into a one-to-one correspondence with S itself. Combinatorics studies the number of possible ways of doing this under various conditions.

Permutation is a college-level concept that would be first encountered in a discrete mathematics course covering combinatorics. It is listed in the California State Standards for Algebra II.


Factorial: The factorial of a positive integer n, denoted n!, is the product of the first n positive integers.

Classroom Articles on Combinatorics

  • Binomial Coefficient
  • Generating Function
  • Binomial Theorem
  • Magic Square
  • Combinatorics
  • Pascal's Triangle
  • Fibonacci Number
  • Recurrence Relation

  • Classroom Articles on Discrete Mathematics (Up to College Level)

  • Algorithm
  • Graph
  • Binary
  • Graph Cycle
  • Chromatic Number
  • Graph Theory
  • Complete Graph
  • Logic
  • Connected Graph
  • Planar Graph
  • Cycle Graph
  • Polyhedral Graph
  • Directed Graph
  • Tree
  • Discrete Mathematics