Step-by-step derivation
S001 · implies
Before
n=5;k=5;distinct objects,without replacement
After
unordered k-subsets of an n-element set
Conditions: none
Each object is selected at most once and order is ignored;the ordered-selection count is not the requested answer.
Step identifiers and dependencies
Rule: unordered_selection_model · Uses: G001
S002 · calculation
Before
choices at position1 := sub(5, 0)
After
choices at position1 = 5
Conditions: none
After i distinct selections,n−i objects remain available.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S001
S003 · calculation
Before
ordered prefix count1 := mul(1, 5)
After
ordered prefix count1 = 5
Conditions: none
The product rule accumulates the ordered count without repetition.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
choices at position2 := sub(5, 1)
After
choices at position2 = 4
Conditions: none
After i distinct selections,n−i objects remain available.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation
Before
ordered prefix count2 := mul(5, 4)
After
ordered prefix count2 = 20
Conditions: none
The product rule accumulates the ordered count without repetition.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
choices at position3 := sub(5, 2)
After
choices at position3 = 3
Conditions: none
After i distinct selections,n−i objects remain available.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
ordered prefix count3 := mul(20, 3)
After
ordered prefix count3 = 60
Conditions: none
The product rule accumulates the ordered count without repetition.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
choices at position4 := sub(5, 3)
After
choices at position4 = 2
Conditions: none
After i distinct selections,n−i objects remain available.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · calculation
Before
ordered prefix count4 := mul(60, 2)
After
ordered prefix count4 = 120
Conditions: none
The product rule accumulates the ordered count without repetition.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S008
S010 · calculation
Before
choices at position5 := sub(5, 4)
After
choices at position5 = 1
Conditions: none
After i distinct selections,n−i objects remain available.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
ordered prefix count5 := mul(120, 1)
After
ordered prefix count5 = 120
Conditions: none
The product rule accumulates the ordered count without repetition.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · calculation
Before
factorial through2 := mul(1, 2)
After
factorial through2 = 2
Conditions: none
Accumulate k!,the number of orders of the same selected k-element set.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S011
S013 · calculation
Before
factorial through3 := mul(2, 3)
After
factorial through3 = 6
Conditions: none
Accumulate k!,the number of orders of the same selected k-element set.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · calculation
Before
factorial through4 := mul(6, 4)
After
factorial through4 = 24
Conditions: none
Accumulate k!,the number of orders of the same selected k-element set.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S013
S015 · calculation
Before
factorial through5 := mul(24, 5)
After
factorial through5 = 120
Conditions: none
Accumulate k!,the number of orders of the same selected k-element set.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S014
S016 · implies
Before
ordered selections=120;orders per subset=120
After
C(5,5)=ordered selections/k!
Conditions: none
Every k-subset has exactly k! orderings,and different subsets have disjoint orderings;divide by this common positive factor.
Step identifiers and dependencies
Rule: uniform_order_fibers · Uses: G001, S015
S017 · calculation
Before
unordered subset count := div(120, 120)
After
unordered subset count = 1
Conditions: none
Exact division gives an integer;when k=0 both empty products are1 and there is exactly one empty selection.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S016
S018 · implies
Before
C(5,5)=n!/(k!·(n−k)!)
After
C(5,5)=120/(120·1)=1
Conditions: none
Rewrite the falling product as n!/(n−k)! and audit the binomial formula,including boundary cases.
Step identifiers and dependencies
Rule: binomial_count_formula · Uses: G001, S017