Explore related knowledge and questions →

Question 34173: Quotient of Permutation and Combination Counts

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 171

← Question derivation index · Original question batch

R0067-34173 · q-20260930-r06-permutation-combination-quotient-0023

Original question and givens

For selection of k=4 distinct objects without replacement from n=9, compute the exact integer quotient P(n,k)/C(n,k). The empty selection counts once.

  • G001 — For selection of k=4 distinct objects without replacement from n=9, compute the exact integer quotient P(n,k)/C(n,k). The empty selection counts once.

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

Step-by-step derivation

S001 · implies

Before

source roles = [qf-permutation-combination-quotient, [k, n, operation]]

After

derived = [quotient, no-invented-domain]

Conditions: none

Check THIS bank’s keys/operation/domain:legacy table underscores,MOD50 local hyphens;permissive BASE data acquires no unknown-field restriction.Keep Number.isInteger and SAFE source guards distinct,while preserving ORIGINAL JSON number representations.

Step identifiers and dependencies

Rule: R67_SOURCE_specific_keys_operation_domain_and_numeric_bank · Uses: G001

S002 · implies

Before

source roles = [9, 4]

After

derived = [[9, 8, 7, 6], 1]

Conditions: none

Choose ordered positions from n DISTINCT objects WITHOUT replacement.Position i has n−i+1 choices.For k=0,the empty selection counts ONCE and the product starts at1.THIS bank permits n≤200,not another bank’s32/64 cap.

Step identifiers and dependencies

Rule: Selection_DISTINCT_no_replacement_order_and_EMPTY_convention · Uses: G001, S001

S003 · calculation

Before

Permutation ORIGINAL available choices position1 := mul(1, 9)

After

Permutation ORIGINAL available choices position1 = 9

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · calculation

Before

Permutation ORIGINAL available choices position2 := mul(9, 8)

After

Permutation ORIGINAL available choices position2 = 72

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · calculation

Before

Permutation ORIGINAL available choices position3 := mul(72, 7)

After

Permutation ORIGINAL available choices position3 = 504

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S004

S006 · calculation

Before

Permutation ORIGINAL available choices position4 := mul(504, 6)

After

Permutation ORIGINAL available choices position4 = 3024

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · calculation

Before

Quotient ORIGINAL factorial factor1 := mul(1, 1)

After

Quotient ORIGINAL factorial factor1 = 1

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S006

S008 · calculation

Before

Quotient ORIGINAL factorial factor2 := mul(1, 2)

After

Quotient ORIGINAL factorial factor2 = 2

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · calculation

Before

Quotient ORIGINAL factorial factor3 := mul(2, 3)

After

Quotient ORIGINAL factorial factor3 = 6

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · calculation

Before

Quotient ORIGINAL factorial factor4 := mul(6, 4)

After

Quotient ORIGINAL factorial factor4 = 24

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S009

S011 · calculation

Before

Quotient ORIGINAL permutations divided by subset orderings := div(3024, 24)

After

Quotient ORIGINAL permutations divided by subset orderings = 126

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S010

S012 · calculation

Before

Quotient ORIGINAL permutations over combinations := div(3024, 126)

After

Quotient ORIGINAL permutations over combinations = 24

Conditions: none

Calculate exactly from ORIGINAL ordered operands.Legacy derived integers are not recapped at the RAW SAFE bound;MOD50 rationals separately retain the NAIVE pre-reduction source envelope.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · implies

Before

source roles = [9, 4, 3024, 126]

After

derived = [24, 24]

Conditions: none

EVERY k-element subset has exactly k! orderings.Ordered selections partition into equal fibers over their underlying subsets,so P=C*k!,C>0,and P/C=k!.At k=0 this remains1/1=1,not an estimated ratio or probability.

Step identifiers and dependencies

Rule: Selection_EVERY_k_subset_has_k_factorial_orderings · Uses: G001, S012

Reverse checks

  • S013 · premise_and_result_audit — Reverse-audit THIS step against the ORIGINAL roles,complete premises and field order.Distinguish implication from equivalence;preserve originals,English,MKOs,ASTs and review states.Finite checks are not independent review or general formal proof.
  • S012 · premise_and_result_audit — Recompute Quotient ORIGINAL permutations over combinations with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Recompute Quotient ORIGINAL permutations divided by subset orderings with exact rational arithmetic, not rounded decimals.
  • S010 · premise_and_result_audit — Recompute Quotient ORIGINAL factorial factor4 with exact rational arithmetic, not rounded decimals.
  • S009 · premise_and_result_audit — Recompute Quotient ORIGINAL factorial factor3 with exact rational arithmetic, not rounded decimals.
  • S008 · premise_and_result_audit — Recompute Quotient ORIGINAL factorial factor2 with exact rational arithmetic, not rounded decimals.
  • S007 · premise_and_result_audit — Recompute Quotient ORIGINAL factorial factor1 with exact rational arithmetic, not rounded decimals.
  • S006 · premise_and_result_audit — Recompute Permutation ORIGINAL available choices position4 with exact rational arithmetic, not rounded decimals.
  • S005 · premise_and_result_audit — Recompute Permutation ORIGINAL available choices position3 with exact rational arithmetic, not rounded decimals.
  • S004 · premise_and_result_audit — Recompute Permutation ORIGINAL available choices position2 with exact rational arithmetic, not rounded decimals.
  • S003 · premise_and_result_audit — Recompute Permutation ORIGINAL available choices position1 with exact rational arithmetic, not rounded decimals.
  • S002 · premise_and_result_audit — Reverse-audit THIS step against the ORIGINAL roles,complete premises and field order.Distinguish implication from equivalence;preserve originals,English,MKOs,ASTs and review states.Finite checks are not independent review or general formal proof.
  • S001 · premise_and_result_audit — Reverse-audit THIS step against the ORIGINAL roles,complete premises and field order.Distinguish implication from equivalence;preserve originals,English,MKOs,ASTs and review states.Finite checks are not independent review or general formal proof.

Result

24

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: 3fc863af0d23822d4126e6c17db6cff9089f201137ec644b1042d07143caf188
  • candidate record SHA-256: 222dc335aa11b4718a2021e9198623675c46cfe7a1fa943eff1d9036ae390906
  • semantic review receipt SHA-256: c89efa383b67bb2cf25bcf16160b9f5f614bbe5e5e791f4d7f58234d17a3371c
  • question-first witness SHA-256: 12766d451c5375842b4fc2843ae94807ec55f15763a916558026912a13873d57
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON