Explore related knowledge and questions →

Question 446: Compare the Whole Binomial Sum with an Exact Integer Power

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 3

← Question derivation index · Original question batch

P1000-0446 · q-20261014-advance-20261109-r05-binomial-theorem-0071

Original question and givens

Use natural exponent n=20, exact commuting integers x=3, y=2. Give (n, x, y, power, expansion_sum, equal).

  • G001 — Use natural exponent n=20, exact commuting integers x=3, y=2. Give (n, x, y, power, expansion_sum, equal).

Definition and scope

n is a nonnegative integer and x,y commute. Sum every term C(n,k)x^(n−k)y^k; the zeroth power is 1.

Step-by-step derivation

S001 · implies

Before

n=20≥0; multiplication commutes

After

group the finite product by the number of y choices

Conditions: none

Choose x or y in each factor and group by the number of y choices; count coefficients as integers first.

Step identifiers and dependencies

Rule: commutative_product · Uses: G001

S002 · calculation

Before

x+y := sum(3, 2)

After

x+y = 5

Conditions: none

First calculate the sum directly.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S001

S003 · implies

Before

(x+y)^n: (5)^20

After

(x+y)^n = 95367431640625

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S002

S004 · implies

Before

choose 0 positions out of 20

After

C(20,0)=2432902008176640000/(1·2432902008176640000)=1

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S003

S005 · implies

Before

x^20: (3)^20

After

x^20 = 3486784401

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S004

S006 · implies

Before

y^0: (2)^0

After

y^0 = 1

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S005

S007 · calculation

Before

C·x power (k=0) := mul(1, 3486784401)

After

C·x power (k=0) = 3486784401

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S006

S008 · calculation

Before

term[0] := mul(3486784401, 1)

After

term[0] = 3486784401

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · implies

Before

choose 1 positions out of 20

After

C(20,1)=2432902008176640000/(1·121645100408832000)=20

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S008

S010 · implies

Before

x^19: (3)^19

After

x^19 = 1162261467

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S009

S011 · implies

Before

y^1: (2)^1

After

y^1 = 2

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S010

S012 · calculation

Before

C·x power (k=1) := mul(20, 1162261467)

After

C·x power (k=1) = 23245229340

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · calculation

Before

term[1] := mul(23245229340, 2)

After

term[1] = 46490458680

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S012

S014 · implies

Before

choose 2 positions out of 20

After

C(20,2)=2432902008176640000/(2·6402373705728000)=190

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S013

S015 · implies

Before

x^18: (3)^18

After

x^18 = 387420489

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S014

S016 · implies

Before

y^2: (2)^2

After

y^2 = 4

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S015

S017 · calculation

Before

C·x power (k=2) := mul(190, 387420489)

After

C·x power (k=2) = 73609892910

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S016

S018 · calculation

Before

term[2] := mul(73609892910, 4)

After

term[2] = 294439571640

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S017

S019 · implies

Before

choose 3 positions out of 20

After

C(20,3)=2432902008176640000/(6·355687428096000)=1140

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S018

S020 · implies

Before

x^17: (3)^17

After

x^17 = 129140163

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S019

S021 · implies

Before

y^3: (2)^3

After

y^3 = 8

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S020

S022 · calculation

Before

C·x power (k=3) := mul(1140, 129140163)

After

C·x power (k=3) = 147219785820

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S021

S023 · calculation

Before

term[3] := mul(147219785820, 8)

After

term[3] = 1177758286560

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S022

S024 · implies

Before

choose 4 positions out of 20

After

C(20,4)=2432902008176640000/(24·20922789888000)=4845

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S023

S025 · implies

Before

x^16: (3)^16

After

x^16 = 43046721

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S024

S026 · implies

Before

y^4: (2)^4

After

y^4 = 16

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S025

S027 · calculation

Before

C·x power (k=4) := mul(4845, 43046721)

After

C·x power (k=4) = 208561363245

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S026

S028 · calculation

Before

term[4] := mul(208561363245, 16)

After

term[4] = 3336981811920

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S027

S029 · implies

Before

choose 5 positions out of 20

After

C(20,5)=2432902008176640000/(120·1307674368000)=15504

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S028

S030 · implies

Before

x^15: (3)^15

After

x^15 = 14348907

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S029

S031 · implies

Before

y^5: (2)^5

After

y^5 = 32

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S030

S032 · calculation

Before

C·x power (k=5) := mul(15504, 14348907)

After

C·x power (k=5) = 222465454128

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S031

S033 · calculation

Before

term[5] := mul(222465454128, 32)

After

term[5] = 7118894532096

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S032

S034 · implies

Before

choose 6 positions out of 20

After

C(20,6)=2432902008176640000/(720·87178291200)=38760

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S033

S035 · implies

Before

x^14: (3)^14

After

x^14 = 4782969

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S034

S036 · implies

Before

y^6: (2)^6

After

y^6 = 64

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S035

S037 · calculation

Before

C·x power (k=6) := mul(38760, 4782969)

After

C·x power (k=6) = 185387878440

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S036

S038 · calculation

Before

term[6] := mul(185387878440, 64)

After

term[6] = 11864824220160

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S037

S039 · implies

Before

choose 7 positions out of 20

After

C(20,7)=2432902008176640000/(5040·6227020800)=77520

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S038

S040 · implies

Before

x^13: (3)^13

After

x^13 = 1594323

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S039

S041 · implies

Before

y^7: (2)^7

After

y^7 = 128

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S040

S042 · calculation

Before

C·x power (k=7) := mul(77520, 1594323)

After

C·x power (k=7) = 123591918960

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S041

S043 · calculation

Before

term[7] := mul(123591918960, 128)

After

term[7] = 15819765626880

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S042

S044 · implies

Before

choose 8 positions out of 20

After

C(20,8)=2432902008176640000/(40320·479001600)=125970

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S043

S045 · implies

Before

x^12: (3)^12

After

x^12 = 531441

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S044

S046 · implies

Before

y^8: (2)^8

After

y^8 = 256

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S045

S047 · calculation

Before

C·x power (k=8) := mul(125970, 531441)

After

C·x power (k=8) = 66945622770

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S046

S048 · calculation

Before

term[8] := mul(66945622770, 256)

After

term[8] = 17138079429120

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S047

S049 · implies

Before

choose 9 positions out of 20

After

C(20,9)=2432902008176640000/(362880·39916800)=167960

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S048

S050 · implies

Before

x^11: (3)^11

After

x^11 = 177147

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S049

S051 · implies

Before

y^9: (2)^9

After

y^9 = 512

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S050

S052 · calculation

Before

C·x power (k=9) := mul(167960, 177147)

After

C·x power (k=9) = 29753610120

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S051

S053 · calculation

Before

term[9] := mul(29753610120, 512)

After

term[9] = 15233848381440

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S052

S054 · implies

Before

choose 10 positions out of 20

After

C(20,10)=2432902008176640000/(3628800·3628800)=184756

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S053

S055 · implies

Before

x^10: (3)^10

After

x^10 = 59049

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S054

S056 · implies

Before

y^10: (2)^10

After

y^10 = 1024

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S055

S057 · calculation

Before

C·x power (k=10) := mul(184756, 59049)

After

C·x power (k=10) = 10909657044

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S056

S058 · calculation

Before

term[10] := mul(10909657044, 1024)

After

term[10] = 11171488813056

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S057

S059 · implies

Before

choose 11 positions out of 20

After

C(20,11)=2432902008176640000/(39916800·362880)=167960

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S058

S060 · implies

Before

x^9: (3)^9

After

x^9 = 19683

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S059

S061 · implies

Before

y^11: (2)^11

After

y^11 = 2048

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S060

S062 · calculation

Before

C·x power (k=11) := mul(167960, 19683)

After

C·x power (k=11) = 3305956680

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S061

S063 · calculation

Before

term[11] := mul(3305956680, 2048)

After

term[11] = 6770599280640

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S062

S064 · implies

Before

choose 12 positions out of 20

After

C(20,12)=2432902008176640000/(479001600·40320)=125970

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S063

S065 · implies

Before

x^8: (3)^8

After

x^8 = 6561

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S064

S066 · implies

Before

y^12: (2)^12

After

y^12 = 4096

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S065

S067 · calculation

Before

C·x power (k=12) := mul(125970, 6561)

After

C·x power (k=12) = 826489170

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S066

S068 · calculation

Before

term[12] := mul(826489170, 4096)

After

term[12] = 3385299640320

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S067

S069 · implies

Before

choose 13 positions out of 20

After

C(20,13)=2432902008176640000/(6227020800·5040)=77520

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S068

S070 · implies

Before

x^7: (3)^7

After

x^7 = 2187

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S069

S071 · implies

Before

y^13: (2)^13

After

y^13 = 8192

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S070

S072 · calculation

Before

C·x power (k=13) := mul(77520, 2187)

After

C·x power (k=13) = 169536240

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S071

S073 · calculation

Before

term[13] := mul(169536240, 8192)

After

term[13] = 1388840878080

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S072

S074 · implies

Before

choose 14 positions out of 20

After

C(20,14)=2432902008176640000/(87178291200·720)=38760

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S073

S075 · implies

Before

x^6: (3)^6

After

x^6 = 729

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S074

S076 · implies

Before

y^14: (2)^14

After

y^14 = 16384

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S075

S077 · calculation

Before

C·x power (k=14) := mul(38760, 729)

After

C·x power (k=14) = 28256040

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S076

S078 · calculation

Before

term[14] := mul(28256040, 16384)

After

term[14] = 462946959360

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S077

S079 · implies

Before

choose 15 positions out of 20

After

C(20,15)=2432902008176640000/(1307674368000·120)=15504

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S078

S080 · implies

Before

x^5: (3)^5

After

x^5 = 243

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S079

S081 · implies

Before

y^15: (2)^15

After

y^15 = 32768

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S080

S082 · calculation

Before

C·x power (k=15) := mul(15504, 243)

After

C·x power (k=15) = 3767472

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S081

S083 · calculation

Before

term[15] := mul(3767472, 32768)

After

term[15] = 123452522496

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S082

S084 · implies

Before

choose 16 positions out of 20

After

C(20,16)=2432902008176640000/(20922789888000·24)=4845

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S083

S085 · implies

Before

x^4: (3)^4

After

x^4 = 81

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S084

S086 · implies

Before

y^16: (2)^16

After

y^16 = 65536

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S085

S087 · calculation

Before

C·x power (k=16) := mul(4845, 81)

After

C·x power (k=16) = 392445

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S086

S088 · calculation

Before

term[16] := mul(392445, 65536)

After

term[16] = 25719275520

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S087

S089 · implies

Before

choose 17 positions out of 20

After

C(20,17)=2432902008176640000/(355687428096000·6)=1140

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S088

S090 · implies

Before

x^3: (3)^3

After

x^3 = 27

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S089

S091 · implies

Before

y^17: (2)^17

After

y^17 = 131072

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S090

S092 · calculation

Before

C·x power (k=17) := mul(1140, 27)

After

C·x power (k=17) = 30780

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S091

S093 · calculation

Before

term[17] := mul(30780, 131072)

After

term[17] = 4034396160

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S092

S094 · implies

Before

choose 18 positions out of 20

After

C(20,18)=2432902008176640000/(6402373705728000·2)=190

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S093

S095 · implies

Before

x^2: (3)^2

After

x^2 = 9

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S094

S096 · implies

Before

y^18: (2)^18

After

y^18 = 262144

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S095

S097 · calculation

Before

C·x power (k=18) := mul(190, 9)

After

C·x power (k=18) = 1710

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S096

S098 · calculation

Before

term[18] := mul(1710, 262144)

After

term[18] = 448266240

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S097

S099 · implies

Before

choose 19 positions out of 20

After

C(20,19)=2432902008176640000/(121645100408832000·1)=20

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S098

S100 · implies

Before

x^1: (3)^1

After

x^1 = 3

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S099

S101 · implies

Before

y^19: (2)^19

After

y^19 = 524288

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S100

S102 · calculation

Before

C·x power (k=19) := mul(20, 3)

After

C·x power (k=19) = 60

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S101

S103 · calculation

Before

term[19] := mul(60, 524288)

After

term[19] = 31457280

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S102

S104 · implies

Before

choose 20 positions out of 20

After

C(20,20)=2432902008176640000/(2432902008176640000·1)=1

Conditions: none

Count each k-position subset once, dividing out reorderings inside each of the two groups.

Step identifiers and dependencies

Rule: subset_count · Uses: G001, S103

S105 · implies

Before

x^0: (3)^0

After

x^0 = 1

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S104

S106 · implies

Before

y^20: (2)^20

After

y^20 = 1048576

Conditions: none

Evaluate the finite product for a nonnegative integer exponent; the zeroth power uses the multiplicative identity.

Step identifiers and dependencies

Rule: integer_power · Uses: G001, S105

S107 · calculation

Before

C·x power (k=20) := mul(1, 1)

After

C·x power (k=20) = 1

Conditions: none

Multiply the coefficient by the x power first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S106

S108 · calculation

Before

term[20] := mul(1, 1048576)

After

term[20] = 1048576

Conditions: none

Multiply by the y power, preserving parentheses around a negative base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S107

S109 · calculation

Before

expanded sum := sum(3486784401, 46490458680, 294439571640, 1177758286560, 3336981811920, 7118894532096, 11864824220160, 15819765626880, 17138079429120, 15233848381440, 11171488813056, 6770599280640, 3385299640320, 1388840878080, 462946959360, 123452522496, 25719275520, 4034396160, 448266240, 31457280, 1048576)

After

expanded sum = 95367431640625

Conditions: none

Sum every displayed k term, not merely the endpoints.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S108

S110 · implies

Before

direct=95367431640625; expanded=95367431640625

After

identity holds: Yes

Conditions: none

The two calculation paths agree on this finite instance of the identity.

Step identifiers and dependencies

Rule: finite_expansion_evaluation · Uses: G001, S109

Reverse checks

  • S110 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S109 · premise_and_result_audit — Recompute expanded sum with exact rational arithmetic, not rounded decimals.
  • S108 · premise_and_result_audit — Recompute term[20] with exact rational arithmetic, not rounded decimals.
  • S107 · premise_and_result_audit — Recompute C·x power (k=20) with exact rational arithmetic, not rounded decimals.
  • S106 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S105 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S104 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S103 · premise_and_result_audit — Recompute term[19] with exact rational arithmetic, not rounded decimals.
  • S102 · premise_and_result_audit — Recompute C·x power (k=19) with exact rational arithmetic, not rounded decimals.
  • S101 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S100 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S099 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S098 · premise_and_result_audit — Recompute term[18] with exact rational arithmetic, not rounded decimals.
  • S097 · premise_and_result_audit — Recompute C·x power (k=18) with exact rational arithmetic, not rounded decimals.
  • S096 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S095 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S094 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S093 · premise_and_result_audit — Recompute term[17] with exact rational arithmetic, not rounded decimals.
  • S092 · premise_and_result_audit — Recompute C·x power (k=17) with exact rational arithmetic, not rounded decimals.
  • S091 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S090 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S089 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S088 · premise_and_result_audit — Recompute term[16] with exact rational arithmetic, not rounded decimals.
  • S087 · premise_and_result_audit — Recompute C·x power (k=16) with exact rational arithmetic, not rounded decimals.
  • S086 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S085 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S084 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S083 · premise_and_result_audit — Recompute term[15] with exact rational arithmetic, not rounded decimals.
  • S082 · premise_and_result_audit — Recompute C·x power (k=15) with exact rational arithmetic, not rounded decimals.
  • S081 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S080 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S079 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S078 · premise_and_result_audit — Recompute term[14] with exact rational arithmetic, not rounded decimals.
  • S077 · premise_and_result_audit — Recompute C·x power (k=14) with exact rational arithmetic, not rounded decimals.
  • S076 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S075 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S074 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S073 · premise_and_result_audit — Recompute term[13] with exact rational arithmetic, not rounded decimals.
  • S072 · premise_and_result_audit — Recompute C·x power (k=13) with exact rational arithmetic, not rounded decimals.
  • S071 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S070 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S069 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S068 · premise_and_result_audit — Recompute term[12] with exact rational arithmetic, not rounded decimals.
  • S067 · premise_and_result_audit — Recompute C·x power (k=12) with exact rational arithmetic, not rounded decimals.
  • S066 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S065 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S064 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S063 · premise_and_result_audit — Recompute term[11] with exact rational arithmetic, not rounded decimals.
  • S062 · premise_and_result_audit — Recompute C·x power (k=11) with exact rational arithmetic, not rounded decimals.
  • S061 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S060 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S059 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S058 · premise_and_result_audit — Recompute term[10] with exact rational arithmetic, not rounded decimals.
  • S057 · premise_and_result_audit — Recompute C·x power (k=10) with exact rational arithmetic, not rounded decimals.
  • S056 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S055 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S054 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S053 · premise_and_result_audit — Recompute term[9] with exact rational arithmetic, not rounded decimals.
  • S052 · premise_and_result_audit — Recompute C·x power (k=9) with exact rational arithmetic, not rounded decimals.
  • S051 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S050 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S049 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S048 · premise_and_result_audit — Recompute term[8] with exact rational arithmetic, not rounded decimals.
  • S047 · premise_and_result_audit — Recompute C·x power (k=8) with exact rational arithmetic, not rounded decimals.
  • S046 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S045 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S044 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S043 · premise_and_result_audit — Recompute term[7] with exact rational arithmetic, not rounded decimals.
  • S042 · premise_and_result_audit — Recompute C·x power (k=7) with exact rational arithmetic, not rounded decimals.
  • S041 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S040 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S039 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S038 · premise_and_result_audit — Recompute term[6] with exact rational arithmetic, not rounded decimals.
  • S037 · premise_and_result_audit — Recompute C·x power (k=6) with exact rational arithmetic, not rounded decimals.
  • S036 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S035 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S034 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S033 · premise_and_result_audit — Recompute term[5] with exact rational arithmetic, not rounded decimals.
  • S032 · premise_and_result_audit — Recompute C·x power (k=5) with exact rational arithmetic, not rounded decimals.
  • S031 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S030 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S029 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S028 · premise_and_result_audit — Recompute term[4] with exact rational arithmetic, not rounded decimals.
  • S027 · premise_and_result_audit — Recompute C·x power (k=4) with exact rational arithmetic, not rounded decimals.
  • S026 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S025 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S024 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S023 · premise_and_result_audit — Recompute term[3] with exact rational arithmetic, not rounded decimals.
  • S022 · premise_and_result_audit — Recompute C·x power (k=3) with exact rational arithmetic, not rounded decimals.
  • S021 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S020 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S019 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S018 · premise_and_result_audit — Recompute term[2] with exact rational arithmetic, not rounded decimals.
  • S017 · premise_and_result_audit — Recompute C·x power (k=2) with exact rational arithmetic, not rounded decimals.
  • S016 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S015 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S014 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S013 · premise_and_result_audit — Recompute term[1] with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Recompute C·x power (k=1) with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S010 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S009 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S008 · premise_and_result_audit — Recompute term[0] with exact rational arithmetic, not rounded decimals.
  • S007 · premise_and_result_audit — Recompute C·x power (k=0) with exact rational arithmetic, not rounded decimals.
  • S006 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S005 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S004 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S003 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
  • S002 · premise_and_result_audit — Recompute x+y with exact rational arithmetic, not rounded decimals.
  • S001 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.

Result

(20, 3, 2, 95367431640625, 95367431640625, Yes)

The full substitutions and premise audits recover the original answer, retaining its field order and verdict meanings.

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: e445a34c7f452364200013b74ea3a5e97ae54c33fb9f9bcd33becf032585c11e
  • candidate record SHA-256: 19fe70e1a84ad8a23d1351ca27e296878540e38a39ca6fc2f14ce2693379be4d
  • semantic review receipt SHA-256: 6c2c6d46aded7582a11ac41a8c0b3bdde2669a53bdb6e796eea2039994a02772
  • question-first witness SHA-256: 77e43898df9efdbf8094ad81fe4ab91cf4b4bd82f481eb9b4699b73cb4da612b
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON