comb: comb: Calculate Number of Combinations C(n, k)

In evanverse: Utility Functions for Data Analysis and Visualization

comb: Calculate Number of Combinations C(n, k)

Description

Calculates the total number of ways to choose k items from n distinct items (without regard to order), i.e., the number of combinations C(n, k) = n! / (k! * (n - k)!). This function is intended for moderate n and k. For very large values, consider the 'gmp' package.

Usage

comb(n, k)

Arguments

n	Integer. Total number of items (non-negative integer).
k	Integer. Number of items to choose (non-negative integer, must be <= n).

Value

Numeric. The combination count C(n, k) (returns Inf for very large n).

Examples

comb(8, 4)      # 70
comb(5, 2)      # 10
comb(10, 0)     # 1
comb(5, 6)      # 0

evanverse documentation built on March 10, 2026, 5:07 p.m.