Explore related knowledge and questions →

Question 100: The Finite Expansion Includes Every k from Zero through n

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 1

← Question derivation index · Original question batch

P250-0100 · q-20261014-advance-20261109-r05-binomial-theorem-0050

Original question and givens

Use natural exponent n=24, including0, in a commutative coefficient setting. Give (n, coefficient_exponent_rows, boundary).

  • G001 — Use natural exponent n=24, including0, in a commutative coefficient setting. Give (n, coefficient_exponent_rows, boundary).

Definition and scope

n is a nonnegative integer and x,y commute. For n=0 use the polynomial empty-product identity.

Step-by-step derivation

S001 · implies

Before

n=24≥0; x,y commute

After

(x+y)^24 is a finite product of 24 factors

Conditions: none

Choose x or y from each factor; commutativity permits grouping products by the number of y choices.

Step identifiers and dependencies

Rule: finite_product · Uses: G001

S002 · implies

Before

choose exactly 0 of 24 factors to contribute y

After

C(24,0)=620448401733239439360000/(1·620448401733239439360000)=1

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 0 y positions and 24 x positions, giving coefficient 1.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S001

S003 · implies

Before

C(24,0)=1; choose y 0 times

After

1·x^24·y^0

Conditions: none

The x exponent is 24-0=24; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S002

S004 · implies

Before

choose exactly 1 of 24 factors to contribute y

After

C(24,1)=620448401733239439360000/(1·25852016738884976640000)=24

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 1 y positions and 23 x positions, giving coefficient 24.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S003

S005 · implies

Before

C(24,1)=24; choose y 1 times

After

24·x^23·y^1

Conditions: none

The x exponent is 24-1=23; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S004

S006 · implies

Before

choose exactly 2 of 24 factors to contribute y

After

C(24,2)=620448401733239439360000/(2·1124000727777607680000)=276

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 2 y positions and 22 x positions, giving coefficient 276.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S005

S007 · implies

Before

C(24,2)=276; choose y 2 times

After

276·x^22·y^2

Conditions: none

The x exponent is 24-2=22; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S006

S008 · implies

Before

choose exactly 3 of 24 factors to contribute y

After

C(24,3)=620448401733239439360000/(6·51090942171709440000)=2024

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 3 y positions and 21 x positions, giving coefficient 2024.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S007

S009 · implies

Before

C(24,3)=2024; choose y 3 times

After

2024·x^21·y^3

Conditions: none

The x exponent is 24-3=21; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S008

S010 · implies

Before

choose exactly 4 of 24 factors to contribute y

After

C(24,4)=620448401733239439360000/(24·2432902008176640000)=10626

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 4 y positions and 20 x positions, giving coefficient 10626.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S009

S011 · implies

Before

C(24,4)=10626; choose y 4 times

After

10626·x^20·y^4

Conditions: none

The x exponent is 24-4=20; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S010

S012 · implies

Before

choose exactly 5 of 24 factors to contribute y

After

C(24,5)=620448401733239439360000/(120·121645100408832000)=42504

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 5 y positions and 19 x positions, giving coefficient 42504.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S011

S013 · implies

Before

C(24,5)=42504; choose y 5 times

After

42504·x^19·y^5

Conditions: none

The x exponent is 24-5=19; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S012

S014 · implies

Before

choose exactly 6 of 24 factors to contribute y

After

C(24,6)=620448401733239439360000/(720·6402373705728000)=134596

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 6 y positions and 18 x positions, giving coefficient 134596.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S013

S015 · implies

Before

C(24,6)=134596; choose y 6 times

After

134596·x^18·y^6

Conditions: none

The x exponent is 24-6=18; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S014

S016 · implies

Before

choose exactly 7 of 24 factors to contribute y

After

C(24,7)=620448401733239439360000/(5040·355687428096000)=346104

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 7 y positions and 17 x positions, giving coefficient 346104.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S015

S017 · implies

Before

C(24,7)=346104; choose y 7 times

After

346104·x^17·y^7

Conditions: none

The x exponent is 24-7=17; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S016

S018 · implies

Before

choose exactly 8 of 24 factors to contribute y

After

C(24,8)=620448401733239439360000/(40320·20922789888000)=735471

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 8 y positions and 16 x positions, giving coefficient 735471.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S017

S019 · implies

Before

C(24,8)=735471; choose y 8 times

After

735471·x^16·y^8

Conditions: none

The x exponent is 24-8=16; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S018

S020 · implies

Before

choose exactly 9 of 24 factors to contribute y

After

C(24,9)=620448401733239439360000/(362880·1307674368000)=1307504

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 9 y positions and 15 x positions, giving coefficient 1307504.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S019

S021 · implies

Before

C(24,9)=1307504; choose y 9 times

After

1307504·x^15·y^9

Conditions: none

The x exponent is 24-9=15; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S020

S022 · implies

Before

choose exactly 10 of 24 factors to contribute y

After

C(24,10)=620448401733239439360000/(3628800·87178291200)=1961256

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 10 y positions and 14 x positions, giving coefficient 1961256.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S021

S023 · implies

Before

C(24,10)=1961256; choose y 10 times

After

1961256·x^14·y^10

Conditions: none

The x exponent is 24-10=14; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S022

S024 · implies

Before

choose exactly 11 of 24 factors to contribute y

After

C(24,11)=620448401733239439360000/(39916800·6227020800)=2496144

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 11 y positions and 13 x positions, giving coefficient 2496144.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S023

S025 · implies

Before

C(24,11)=2496144; choose y 11 times

After

2496144·x^13·y^11

Conditions: none

The x exponent is 24-11=13; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S024

S026 · implies

Before

choose exactly 12 of 24 factors to contribute y

After

C(24,12)=620448401733239439360000/(479001600·479001600)=2704156

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 12 y positions and 12 x positions, giving coefficient 2704156.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S025

S027 · implies

Before

C(24,12)=2704156; choose y 12 times

After

2704156·x^12·y^12

Conditions: none

The x exponent is 24-12=12; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S026

S028 · implies

Before

choose exactly 13 of 24 factors to contribute y

After

C(24,13)=620448401733239439360000/(6227020800·39916800)=2496144

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 13 y positions and 11 x positions, giving coefficient 2496144.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S027

S029 · implies

Before

C(24,13)=2496144; choose y 13 times

After

2496144·x^11·y^13

Conditions: none

The x exponent is 24-13=11; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S028

S030 · implies

Before

choose exactly 14 of 24 factors to contribute y

After

C(24,14)=620448401733239439360000/(87178291200·3628800)=1961256

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 14 y positions and 10 x positions, giving coefficient 1961256.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S029

S031 · implies

Before

C(24,14)=1961256; choose y 14 times

After

1961256·x^10·y^14

Conditions: none

The x exponent is 24-14=10; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S030

S032 · implies

Before

choose exactly 15 of 24 factors to contribute y

After

C(24,15)=620448401733239439360000/(1307674368000·362880)=1307504

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 15 y positions and 9 x positions, giving coefficient 1307504.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S031

S033 · implies

Before

C(24,15)=1307504; choose y 15 times

After

1307504·x^9·y^15

Conditions: none

The x exponent is 24-15=9; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S032

S034 · implies

Before

choose exactly 16 of 24 factors to contribute y

After

C(24,16)=620448401733239439360000/(20922789888000·40320)=735471

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 16 y positions and 8 x positions, giving coefficient 735471.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S033

S035 · implies

Before

C(24,16)=735471; choose y 16 times

After

735471·x^8·y^16

Conditions: none

The x exponent is 24-16=8; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S034

S036 · implies

Before

choose exactly 17 of 24 factors to contribute y

After

C(24,17)=620448401733239439360000/(355687428096000·5040)=346104

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 17 y positions and 7 x positions, giving coefficient 346104.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S035

S037 · implies

Before

C(24,17)=346104; choose y 17 times

After

346104·x^7·y^17

Conditions: none

The x exponent is 24-17=7; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S036

S038 · implies

Before

choose exactly 18 of 24 factors to contribute y

After

C(24,18)=620448401733239439360000/(6402373705728000·720)=134596

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 18 y positions and 6 x positions, giving coefficient 134596.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S037

S039 · implies

Before

C(24,18)=134596; choose y 18 times

After

134596·x^6·y^18

Conditions: none

The x exponent is 24-18=6; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S038

S040 · implies

Before

choose exactly 19 of 24 factors to contribute y

After

C(24,19)=620448401733239439360000/(121645100408832000·120)=42504

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 19 y positions and 5 x positions, giving coefficient 42504.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S039

S041 · implies

Before

C(24,19)=42504; choose y 19 times

After

42504·x^5·y^19

Conditions: none

The x exponent is 24-19=5; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S040

S042 · implies

Before

choose exactly 20 of 24 factors to contribute y

After

C(24,20)=620448401733239439360000/(2432902008176640000·24)=10626

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 20 y positions and 4 x positions, giving coefficient 10626.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S041

S043 · implies

Before

C(24,20)=10626; choose y 20 times

After

10626·x^4·y^20

Conditions: none

The x exponent is 24-20=4; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S042

S044 · implies

Before

choose exactly 21 of 24 factors to contribute y

After

C(24,21)=620448401733239439360000/(51090942171709440000·6)=2024

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 21 y positions and 3 x positions, giving coefficient 2024.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S043

S045 · implies

Before

C(24,21)=2024; choose y 21 times

After

2024·x^3·y^21

Conditions: none

The x exponent is 24-21=3; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S044

S046 · implies

Before

choose exactly 22 of 24 factors to contribute y

After

C(24,22)=620448401733239439360000/(1124000727777607680000·2)=276

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 22 y positions and 2 x positions, giving coefficient 276.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S045

S047 · implies

Before

C(24,22)=276; choose y 22 times

After

276·x^2·y^22

Conditions: none

The x exponent is 24-22=2; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S046

S048 · implies

Before

choose exactly 23 of 24 factors to contribute y

After

C(24,23)=620448401733239439360000/(25852016738884976640000·1)=24

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 23 y positions and 1 x positions, giving coefficient 24.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S047

S049 · implies

Before

C(24,23)=24; choose y 23 times

After

24·x^1·y^23

Conditions: none

The x exponent is 24-23=1; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S048

S050 · implies

Before

choose exactly 24 of 24 factors to contribute y

After

C(24,24)=620448401733239439360000/(620448401733239439360000·1)=1

Conditions: none

Count orderings of 24 positions and divide by reorderings within the 24 y positions and 0 x positions, giving coefficient 1.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S049

S051 · implies

Before

C(24,24)=1; choose y 24 times

After

1·x^0·y^24

Conditions: none

The x exponent is 24-24=0; the two exponents still sum to 24.

Step identifiers and dependencies

Rule: group_like_terms · Uses: G001, S050

S052 · implies

Before

all k=0 through 24 have been accounted for

After

(x+y)^24=1·x^24·y^0 + 24·x^23·y^1 + 276·x^22·y^2 + 2024·x^21·y^3 + 10626·x^20·y^4 + 42504·x^19·y^5 + 134596·x^18·y^6 + 346104·x^17·y^7 + 735471·x^16·y^8 + 1307504·x^15·y^9 + 1961256·x^14·y^10 + 2496144·x^13·y^11 + 2704156·x^12·y^12 + 2496144·x^11·y^13 + 1961256·x^10·y^14 + 1307504·x^9·y^15 + 735471·x^8·y^16 + 346104·x^7·y^17 + 134596·x^6·y^18 + 42504·x^5·y^19 + 10626·x^4·y^20 + 2024·x^3·y^21 + 276·x^2·y^22 + 24·x^1·y^23 + 1·x^0·y^24

Conditions: none

Every x/y choice belongs to exactly one k class, so this is the complete finite expansion, not just endpoint terms.

Step identifiers and dependencies

Rule: collect_all_terms · Uses: G001, S051

Reverse checks

  • S052 · premise_and_result_audit — There are n+1 coefficient positions, with the complete range of k retained.
  • S051 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S050 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S049 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S048 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S047 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S046 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S045 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S044 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S043 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S042 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S041 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S040 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S039 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S038 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S037 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S036 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S035 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S034 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S033 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S032 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S031 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S030 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S029 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S028 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S027 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S026 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S025 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S024 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S023 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S022 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S021 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S020 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S019 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S018 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S017 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S016 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S015 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S014 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S013 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S012 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S011 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S010 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S009 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S008 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S007 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S006 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S005 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S004 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S003 · premise_and_result_audit — The answer row is [k,coefficient,x exponent,y exponent]; do not swap the exponent columns.
  • S002 · premise_and_result_audit — Check the coefficient independently with the integer Pascal recurrence, not approximate factorials.
  • S001 · premise_and_result_audit — This is not an infinite expansion for a noninteger power or a claim for noncommuting multiplication.

Result

(24, [[0, 1, 24, 0], [1, 24, 23, 1], [2, 276, 22, 2], [3, 2024, 21, 3], [4, 10626, 20, 4], [5, 42504, 19, 5], [6, 134596, 18, 6], [7, 346104, 17, 7], [8, 735471, 16, 8], [9, 1307504, 15, 9], [10, 1961256, 14, 10], [11, 2496144, 13, 11], [12, 2704156, 12, 12], [13, 2496144, 11, 13], [14, 1961256, 10, 14], [15, 1307504, 9, 15], [16, 735471, 8, 16], [17, 346104, 7, 17], [18, 134596, 6, 18], [19, 42504, 5, 19], [20, 10626, 4, 20], [21, 2024, 3, 21], [22, 276, 2, 22], [23, 24, 1, 23], [24, 1, 0, 24]], complete_k_zero_through_n_coefficients)

The full expansion consists of all displayed monomials, in the same order as the answer rows.

This question review and source binding

Review date: 2026-10-24

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: 24e1908ee45ca42532415665075d5aa9f8121ea581f44ae6a36072f7f8a38280
  • candidate record SHA-256: 88a8b5624738907adb20a019d2c22ec279cf86f9eaee39a735bc8e751e78d70e
  • semantic review receipt SHA-256: 4727d1bd957a9b7f6cadb7972ddb5ab80a31f5259dc5394c1dff2b71944ed36b
  • question-first witness SHA-256: 51e18649133238ac992229f6e16542a5f3af53ca73b2262ab0524508ea937dee
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON