Software Engineering KB

Home

❯

01 Foundations

❯

03 Mathematics for CS

❯

02 Sub Concept

❯

Combinations

Combinations

Feb 10, 20261 min read

  • mathematics-for-cs
  • discrete-mathematics
  • combinatorics
  • combinations

Combinations

← Back to Combinatorics

Unordered selections of elements. The number of ways to choose k elements from n is C(n,k) = n!/(k!(n-k)!). Combinations appear in probability calculations, binomial expansion, and algorithm analysis for subset-based problems.

mathematics-for-cs discrete-mathematics combinatorics combinations


Graph View

Backlinks

  • Combinatorics

Created with Quartz v4.5.2 © 2026

  • GitHub