Step-by-step derivation
S001 · implies
Before
source operation=recurrence-missing-initial-boundary;original snapshot and mathematics retained
After
explicit ordered source output fields=[first_initial, second_left, second_right, left_prefix, right_prefix, prefixes_differ, one_initial_uniqueness_claim, boundary]
Conditions: none
Keep the historical interface marker and list ordered source fields without JavaScript.Tags are not additional evidence;fixed No markers retain their scope.The ordering helper supplies protocol order,not mathematical correctness.
Step identifiers and dependencies
Rule: source_ordered_interface_explicit_without_javascript · Uses: G001
S002 · implies
Before
recurrence LEFT completion:ORIGINAL order=2;oldest-to-newest coefficients=[3, 2];constant=0;ALL initial a_0..a_(r-1)=[20, 21]
After
for EVERY n>=2,a_n=constant+sum_j coefficients[j]*a_(n-r+j);current prefix length=2;forward rule is total and single-valued
Conditions: none
Fix all r initials and the oldest-to-newest coefficient roles.Given the preceding r values,the next value is uniquely determined.This is a forward definition,not a closed form or convergence claim.
Step identifiers and dependencies
Rule: recurrence_complete_initial_state_and_total_single_value_rule · Uses: G001, S001
S003 · calculation
Before
recurrence LEFT completion n=2 ORIGINAL coefficient0 times a_0 := mul(3, 20)
After
recurrence LEFT completion n=2 ORIGINAL coefficient0 times a_0 = 60
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
recurrence LEFT completion n=2 partial sum after coefficient0 := sum(0, 60)
After
recurrence LEFT completion n=2 partial sum after coefficient0 = 60
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation
Before
recurrence LEFT completion n=2 ORIGINAL coefficient1 times a_1 := mul(2, 21)
After
recurrence LEFT completion n=2 ORIGINAL coefficient1 times a_1 = 42
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
recurrence LEFT completion n=2 partial sum after coefficient1 := sum(60, 42)
After
recurrence LEFT completion n=2 partial sum after coefficient1 = 102
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · implies
Before
recurrence LEFT completion:ORIGINAL target n=2;previous state a_(n-r)..a_(n-1)=[20, 21];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 3, 20, 60], [1, 1, 2, 21, 42]]
After
new a_2=102;next state=[21, 102];drop ONLY oldest state entry then append new scalar;prefix now=[20, 21, 102]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S006
S008 · calculation
Before
recurrence LEFT completion n=3 ORIGINAL coefficient0 times a_1 := mul(3, 21)
After
recurrence LEFT completion n=3 ORIGINAL coefficient0 times a_1 = 63
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · calculation
Before
recurrence LEFT completion n=3 partial sum after coefficient0 := sum(0, 63)
After
recurrence LEFT completion n=3 partial sum after coefficient0 = 63
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S008
S010 · calculation
Before
recurrence LEFT completion n=3 ORIGINAL coefficient1 times a_2 := mul(2, 102)
After
recurrence LEFT completion n=3 ORIGINAL coefficient1 times a_2 = 204
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
recurrence LEFT completion n=3 partial sum after coefficient1 := sum(63, 204)
After
recurrence LEFT completion n=3 partial sum after coefficient1 = 267
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · implies
Before
recurrence LEFT completion:ORIGINAL target n=3;previous state a_(n-r)..a_(n-1)=[21, 102];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 3, 21, 63], [1, 2, 2, 102, 204]]
After
new a_3=267;next state=[102, 267];drop ONLY oldest state entry then append new scalar;prefix now=[20, 21, 102, 267]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S011
S013 · calculation
Before
recurrence LEFT completion n=4 ORIGINAL coefficient0 times a_2 := mul(3, 102)
After
recurrence LEFT completion n=4 ORIGINAL coefficient0 times a_2 = 306
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · calculation
Before
recurrence LEFT completion n=4 partial sum after coefficient0 := sum(0, 306)
After
recurrence LEFT completion n=4 partial sum after coefficient0 = 306
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S013
S015 · calculation
Before
recurrence LEFT completion n=4 ORIGINAL coefficient1 times a_3 := mul(2, 267)
After
recurrence LEFT completion n=4 ORIGINAL coefficient1 times a_3 = 534
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S014
S016 · calculation
Before
recurrence LEFT completion n=4 partial sum after coefficient1 := sum(306, 534)
After
recurrence LEFT completion n=4 partial sum after coefficient1 = 840
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S015
S017 · implies
Before
recurrence LEFT completion:ORIGINAL target n=4;previous state a_(n-r)..a_(n-1)=[102, 267];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 3, 102, 306], [1, 3, 2, 267, 534]]
After
new a_4=840;next state=[267, 840];drop ONLY oldest state entry then append new scalar;prefix now=[20, 21, 102, 267, 840]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S016
S018 · calculation
Before
recurrence LEFT completion n=5 ORIGINAL coefficient0 times a_3 := mul(3, 267)
After
recurrence LEFT completion n=5 ORIGINAL coefficient0 times a_3 = 801
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S017
S019 · calculation
Before
recurrence LEFT completion n=5 partial sum after coefficient0 := sum(0, 801)
After
recurrence LEFT completion n=5 partial sum after coefficient0 = 801
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S018
S020 · calculation
Before
recurrence LEFT completion n=5 ORIGINAL coefficient1 times a_4 := mul(2, 840)
After
recurrence LEFT completion n=5 ORIGINAL coefficient1 times a_4 = 1680
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S019
S021 · calculation
Before
recurrence LEFT completion n=5 partial sum after coefficient1 := sum(801, 1680)
After
recurrence LEFT completion n=5 partial sum after coefficient1 = 2481
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S020
S022 · implies
Before
recurrence LEFT completion:ORIGINAL target n=5;previous state a_(n-r)..a_(n-1)=[267, 840];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 3, 267, 801], [1, 4, 2, 840, 1680]]
After
new a_5=2481;next state=[840, 2481];drop ONLY oldest state entry then append new scalar;prefix now=[20, 21, 102, 267, 840, 2481]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S021
S023 · calculation
Before
recurrence LEFT completion n=6 ORIGINAL coefficient0 times a_4 := mul(3, 840)
After
recurrence LEFT completion n=6 ORIGINAL coefficient0 times a_4 = 2520
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S022
S024 · calculation
Before
recurrence LEFT completion n=6 partial sum after coefficient0 := sum(0, 2520)
After
recurrence LEFT completion n=6 partial sum after coefficient0 = 2520
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S023
S025 · calculation
Before
recurrence LEFT completion n=6 ORIGINAL coefficient1 times a_5 := mul(2, 2481)
After
recurrence LEFT completion n=6 ORIGINAL coefficient1 times a_5 = 4962
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S024
S026 · calculation
Before
recurrence LEFT completion n=6 partial sum after coefficient1 := sum(2520, 4962)
After
recurrence LEFT completion n=6 partial sum after coefficient1 = 7482
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S025
S027 · implies
Before
recurrence LEFT completion:ORIGINAL target n=6;previous state a_(n-r)..a_(n-1)=[840, 2481];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 3, 840, 2520], [1, 5, 2, 2481, 4962]]
After
new a_6=7482;next state=[2481, 7482];drop ONLY oldest state entry then append new scalar;prefix now=[20, 21, 102, 267, 840, 2481, 7482]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S026
S028 · calculation
Before
recurrence LEFT completion n=7 ORIGINAL coefficient0 times a_5 := mul(3, 2481)
After
recurrence LEFT completion n=7 ORIGINAL coefficient0 times a_5 = 7443
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S027
S029 · calculation
Before
recurrence LEFT completion n=7 partial sum after coefficient0 := sum(0, 7443)
After
recurrence LEFT completion n=7 partial sum after coefficient0 = 7443
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S028
S030 · calculation
Before
recurrence LEFT completion n=7 ORIGINAL coefficient1 times a_6 := mul(2, 7482)
After
recurrence LEFT completion n=7 ORIGINAL coefficient1 times a_6 = 14964
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S029
S031 · calculation
Before
recurrence LEFT completion n=7 partial sum after coefficient1 := sum(7443, 14964)
After
recurrence LEFT completion n=7 partial sum after coefficient1 = 22407
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S030
S032 · implies
Before
recurrence LEFT completion:ORIGINAL target n=7;previous state a_(n-r)..a_(n-1)=[2481, 7482];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 3, 2481, 7443], [1, 6, 2, 7482, 14964]]
After
new a_7=22407;next state=[7482, 22407];drop ONLY oldest state entry then append new scalar;prefix now=[20, 21, 102, 267, 840, 2481, 7482, 22407]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S031
S033 · calculation
Before
recurrence LEFT completion n=8 ORIGINAL coefficient0 times a_6 := mul(3, 7482)
After
recurrence LEFT completion n=8 ORIGINAL coefficient0 times a_6 = 22446
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S032
S034 · calculation
Before
recurrence LEFT completion n=8 partial sum after coefficient0 := sum(0, 22446)
After
recurrence LEFT completion n=8 partial sum after coefficient0 = 22446
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S033
S035 · calculation
Before
recurrence LEFT completion n=8 ORIGINAL coefficient1 times a_7 := mul(2, 22407)
After
recurrence LEFT completion n=8 ORIGINAL coefficient1 times a_7 = 44814
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S034
S036 · calculation
Before
recurrence LEFT completion n=8 partial sum after coefficient1 := sum(22446, 44814)
After
recurrence LEFT completion n=8 partial sum after coefficient1 = 67260
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S035
S037 · implies
Before
recurrence LEFT completion:ORIGINAL target n=8;previous state a_(n-r)..a_(n-1)=[7482, 22407];ALL [j,source_index,coefficient,value,product] rows=[[0, 6, 3, 7482, 22446], [1, 7, 2, 22407, 44814]]
After
new a_8=67260;next state=[22407, 67260];drop ONLY oldest state entry then append new scalar;prefix now=[20, 21, 102, 267, 840, 2481, 7482, 22407, 67260]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S036
S038 · implies
Before
recurrence LEFT completion:complete ORIGINAL initial state=[20, 21];actual generated prefix=[20, 21, 102, 267, 840, 2481, 7482, 22407, 67260]
After
ANY two sequences with SAME r initials and SAME total rule agree at n=2 by substitution,then at every later n by induction;this determines the requested prefix only
Conditions: none
Induct from equality of all r initials:the same single-valued rule gives equality of the next term,and hence every later prefix term.Finite generation proves no closed form,asymptotic behavior or analyticity.
Step identifiers and dependencies
Rule: recurrence_forward_uniqueness_induction_not_analytic_claim · Uses: G001, S037
S039 · implies
Before
recurrence RIGHT completion:ORIGINAL order=2;oldest-to-newest coefficients=[3, 2];constant=0;ALL initial a_0..a_(r-1)=[20, 22]
After
for EVERY n>=2,a_n=constant+sum_j coefficients[j]*a_(n-r+j);current prefix length=2;forward rule is total and single-valued
Conditions: none
Fix all r initials and the oldest-to-newest coefficient roles.Given the preceding r values,the next value is uniquely determined.This is a forward definition,not a closed form or convergence claim.
Step identifiers and dependencies
Rule: recurrence_complete_initial_state_and_total_single_value_rule · Uses: G001, S038
S040 · calculation
Before
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 := mul(3, 20)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 = 60
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S039
S041 · calculation
Before
recurrence RIGHT completion n=2 partial sum after coefficient0 := sum(0, 60)
After
recurrence RIGHT completion n=2 partial sum after coefficient0 = 60
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S040
S042 · calculation
Before
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 := mul(2, 22)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 = 44
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S041
S043 · calculation
Before
recurrence RIGHT completion n=2 partial sum after coefficient1 := sum(60, 44)
After
recurrence RIGHT completion n=2 partial sum after coefficient1 = 104
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S042
S044 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=2;previous state a_(n-r)..a_(n-1)=[20, 22];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 3, 20, 60], [1, 1, 2, 22, 44]]
After
new a_2=104;next state=[22, 104];drop ONLY oldest state entry then append new scalar;prefix now=[20, 22, 104]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S043
S045 · calculation
Before
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 := mul(3, 22)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 = 66
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S044
S046 · calculation
Before
recurrence RIGHT completion n=3 partial sum after coefficient0 := sum(0, 66)
After
recurrence RIGHT completion n=3 partial sum after coefficient0 = 66
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S045
S047 · calculation
Before
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 := mul(2, 104)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 = 208
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S046
S048 · calculation
Before
recurrence RIGHT completion n=3 partial sum after coefficient1 := sum(66, 208)
After
recurrence RIGHT completion n=3 partial sum after coefficient1 = 274
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S047
S049 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=3;previous state a_(n-r)..a_(n-1)=[22, 104];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 3, 22, 66], [1, 2, 2, 104, 208]]
After
new a_3=274;next state=[104, 274];drop ONLY oldest state entry then append new scalar;prefix now=[20, 22, 104, 274]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S048
S050 · calculation
Before
recurrence RIGHT completion n=4 ORIGINAL coefficient0 times a_2 := mul(3, 104)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient0 times a_2 = 312
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S049
S051 · calculation
Before
recurrence RIGHT completion n=4 partial sum after coefficient0 := sum(0, 312)
After
recurrence RIGHT completion n=4 partial sum after coefficient0 = 312
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S050
S052 · calculation
Before
recurrence RIGHT completion n=4 ORIGINAL coefficient1 times a_3 := mul(2, 274)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient1 times a_3 = 548
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S051
S053 · calculation
Before
recurrence RIGHT completion n=4 partial sum after coefficient1 := sum(312, 548)
After
recurrence RIGHT completion n=4 partial sum after coefficient1 = 860
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S052
S054 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=4;previous state a_(n-r)..a_(n-1)=[104, 274];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 3, 104, 312], [1, 3, 2, 274, 548]]
After
new a_4=860;next state=[274, 860];drop ONLY oldest state entry then append new scalar;prefix now=[20, 22, 104, 274, 860]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S053
S055 · calculation
Before
recurrence RIGHT completion n=5 ORIGINAL coefficient0 times a_3 := mul(3, 274)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient0 times a_3 = 822
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S054
S056 · calculation
Before
recurrence RIGHT completion n=5 partial sum after coefficient0 := sum(0, 822)
After
recurrence RIGHT completion n=5 partial sum after coefficient0 = 822
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S055
S057 · calculation
Before
recurrence RIGHT completion n=5 ORIGINAL coefficient1 times a_4 := mul(2, 860)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient1 times a_4 = 1720
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S056
S058 · calculation
Before
recurrence RIGHT completion n=5 partial sum after coefficient1 := sum(822, 1720)
After
recurrence RIGHT completion n=5 partial sum after coefficient1 = 2542
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S057
S059 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=5;previous state a_(n-r)..a_(n-1)=[274, 860];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 3, 274, 822], [1, 4, 2, 860, 1720]]
After
new a_5=2542;next state=[860, 2542];drop ONLY oldest state entry then append new scalar;prefix now=[20, 22, 104, 274, 860, 2542]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S058
S060 · calculation
Before
recurrence RIGHT completion n=6 ORIGINAL coefficient0 times a_4 := mul(3, 860)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient0 times a_4 = 2580
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S059
S061 · calculation
Before
recurrence RIGHT completion n=6 partial sum after coefficient0 := sum(0, 2580)
After
recurrence RIGHT completion n=6 partial sum after coefficient0 = 2580
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S060
S062 · calculation
Before
recurrence RIGHT completion n=6 ORIGINAL coefficient1 times a_5 := mul(2, 2542)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient1 times a_5 = 5084
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S061
S063 · calculation
Before
recurrence RIGHT completion n=6 partial sum after coefficient1 := sum(2580, 5084)
After
recurrence RIGHT completion n=6 partial sum after coefficient1 = 7664
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S062
S064 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=6;previous state a_(n-r)..a_(n-1)=[860, 2542];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 3, 860, 2580], [1, 5, 2, 2542, 5084]]
After
new a_6=7664;next state=[2542, 7664];drop ONLY oldest state entry then append new scalar;prefix now=[20, 22, 104, 274, 860, 2542, 7664]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S063
S065 · calculation
Before
recurrence RIGHT completion n=7 ORIGINAL coefficient0 times a_5 := mul(3, 2542)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient0 times a_5 = 7626
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S064
S066 · calculation
Before
recurrence RIGHT completion n=7 partial sum after coefficient0 := sum(0, 7626)
After
recurrence RIGHT completion n=7 partial sum after coefficient0 = 7626
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S065
S067 · calculation
Before
recurrence RIGHT completion n=7 ORIGINAL coefficient1 times a_6 := mul(2, 7664)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient1 times a_6 = 15328
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S066
S068 · calculation
Before
recurrence RIGHT completion n=7 partial sum after coefficient1 := sum(7626, 15328)
After
recurrence RIGHT completion n=7 partial sum after coefficient1 = 22954
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S067
S069 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=7;previous state a_(n-r)..a_(n-1)=[2542, 7664];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 3, 2542, 7626], [1, 6, 2, 7664, 15328]]
After
new a_7=22954;next state=[7664, 22954];drop ONLY oldest state entry then append new scalar;prefix now=[20, 22, 104, 274, 860, 2542, 7664, 22954]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S068
S070 · calculation
Before
recurrence RIGHT completion n=8 ORIGINAL coefficient0 times a_6 := mul(3, 7664)
After
recurrence RIGHT completion n=8 ORIGINAL coefficient0 times a_6 = 22992
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S069
S071 · calculation
Before
recurrence RIGHT completion n=8 partial sum after coefficient0 := sum(0, 22992)
After
recurrence RIGHT completion n=8 partial sum after coefficient0 = 22992
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S070
S072 · calculation
Before
recurrence RIGHT completion n=8 ORIGINAL coefficient1 times a_7 := mul(2, 22954)
After
recurrence RIGHT completion n=8 ORIGINAL coefficient1 times a_7 = 45908
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S071
S073 · calculation
Before
recurrence RIGHT completion n=8 partial sum after coefficient1 := sum(22992, 45908)
After
recurrence RIGHT completion n=8 partial sum after coefficient1 = 68900
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S072
S074 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=8;previous state a_(n-r)..a_(n-1)=[7664, 22954];ALL [j,source_index,coefficient,value,product] rows=[[0, 6, 3, 7664, 22992], [1, 7, 2, 22954, 45908]]
After
new a_8=68900;next state=[22954, 68900];drop ONLY oldest state entry then append new scalar;prefix now=[20, 22, 104, 274, 860, 2542, 7664, 22954, 68900]
Conditions: none
Multiply each coefficient by its specified original index,add to the constant and check the source safe-integer range.Shift left and append the new scalar;do not reverse coefficients or feed the appended value back into this same update.
Step identifiers and dependencies
Rule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S073
S075 · implies
Before
recurrence RIGHT completion:complete ORIGINAL initial state=[20, 22];actual generated prefix=[20, 22, 104, 274, 860, 2542, 7664, 22954, 68900]
After
ANY two sequences with SAME r initials and SAME total rule agree at n=2 by substitution,then at every later n by induction;this determines the requested prefix only
Conditions: none
Induct from equality of all r initials:the same single-valued rule gives equality of the next term,and hence every later prefix term.Finite generation proves no closed form,asymptotic behavior or analyticity.
Step identifiers and dependencies
Rule: recurrence_forward_uniqueness_induction_not_analytic_claim · Uses: G001, S074
S076 · implies
Before
ORIGINAL only known a_0=20;different completions a_1=21 and22;target=8
After
WHOLE prefixes including initials differ=Yes;actual targets=[67260, 68900] MAY coincide;one_initial_uniqueness_claim fixed No
Conditions: none
The prefixes already differ at a1,so the complete prefix is not unique;the target values need not remain different.The final No withholds order2 uniqueness from one initial,without negating prefixes_differ.
Step identifiers and dependencies
Rule: recurrence_missing_initial_WHOLE_prefix_not_target_difference · Uses: G001, S075