Explore related knowledge and questions →

Question 6787: Factorial Window Product and Empty-Window Eligibility

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 34

← Question derivation index · Original question batch

R0012-06787 · q-20261010-advance-20261014-r05-factorial-0037

Original question and givens

N begins at 0, F(0)=0!=1, and factorials use exact integer arithmetic, not floating point. 0≤lo=9≤hi=13≤64. Give (hi!/lo!, factor indices lo+1 through hi, is the window empty?).

  • G001 — N begins at 0, F(0)=0!=1, and factorials use exact integer arithmetic, not floating point. 0≤lo=9≤hi=13≤64. Give (hi!/lo!, factor indices lo+1 through hi, is the window empty?).

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

N includes0;F(0)=1;F(j)=j·F(j−1)

After

exact integer products,not floating values or a permutation proof

Conditions: none

Use empty product1 and integer factor multiplication,retaining large values exactly.This finite recurrence audit is not a general proof of permutation counting.

Step identifiers and dependencies

Rule: exact_factorial_protocol · Uses: G001

S002 · implies

Before

lo=9;hi=13;window factors=[10, 11, 12, 13]

After

hi!/lo! is the product of exactly these factors

Conditions: none

The positive integer lo! permits cancellation of the common prefix;when lo=hi,no factors remain and the quotient is1.

Step identifiers and dependencies

Rule: factorial_positive_prefix_cancellation · Uses: G001, S001

S003 · calculation

Before

window through factor10 := mul(1, 10)

After

window through factor10 = 10

Conditions: none

Multiply only factors from lo+1 through hi,without outside factors.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · calculation

Before

window through factor11 := mul(10, 11)

After

window through factor11 = 110

Conditions: none

Multiply only factors from lo+1 through hi,without outside factors.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · calculation

Before

window through factor12 := mul(110, 12)

After

window through factor12 = 1320

Conditions: none

Multiply only factors from lo+1 through hi,without outside factors.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S004

S006 · calculation

Before

window through factor13 := mul(1320, 13)

After

window through factor13 = 17160

Conditions: none

Multiply only factors from lo+1 through hi,without outside factors.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

Reverse checks

  • S006 · premise_and_result_audit — Recompute window through factor13 with exact rational arithmetic, not rounded decimals.
  • S005 · premise_and_result_audit — Recompute window through factor12 with exact rational arithmetic, not rounded decimals.
  • S004 · premise_and_result_audit — Recompute window through factor11 with exact rational arithmetic, not rounded decimals.
  • S003 · premise_and_result_audit — Recompute window through factor10 with exact rational arithmetic, not rounded decimals.
  • S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

(17160, [10, 11, 12, 13], No)

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: 6eabcd5290c55aa7173e571e621977c168894d01f9655b7e130717d1995c1407
  • candidate record SHA-256: 000ce7c4ad4417dc35682999b34e77339e96591523e352679a971a91290fd961
  • semantic review receipt SHA-256: 90dbc494b2d34ef51f412dcff63cfcc1a2215d038bff71f38f5dded4c64faf00
  • question-first witness SHA-256: b72a3b8bcf10f584396e0dd5198c657b0934a71864e5a3fa6321d7a613aef9f9
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON