Select k=2 objects in order, without replacement or repetition, from n=7 distinct objects. The empty selection counts once. Find P(7,2).
G001 — Select k=2 objects in order, without replacement or repetition, from n=7 distinct objects. The empty selection counts once. Find P(7,2).
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.
source roles = [qf-permutation-exact-count, [k, n, operation]]
After
derived = [permutation, 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.
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.
Permutation ORIGINAL available choices position1 := mul(1, 7)
After
Permutation ORIGINAL available choices position1 = 7
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.
Permutation ORIGINAL available choices position2 := mul(7, 6)
After
Permutation ORIGINAL available choices position2 = 42
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.
The multiplication principle combines ALL k position counts,giving P(n,k)=n!/(n−k)!.This is a count,not probability.The empty product is1 and derived BigInts are not truncated to SAFE.
S005 · 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.
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
42
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.