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=[2, 6];constant=0;ALL initial a_0..a_(r-1)=[4, 5]
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(2, 4)
After
recurrence LEFT completion n=2 ORIGINAL coefficient0 times a_0 = 8
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, 8)
After
recurrence LEFT completion n=2 partial sum after coefficient0 = 8
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(6, 5)
After
recurrence LEFT completion n=2 ORIGINAL coefficient1 times a_1 = 30
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(8, 30)
After
recurrence LEFT completion n=2 partial sum after coefficient1 = 38
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)=[4, 5];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 2, 4, 8], [1, 1, 6, 5, 30]]
After
new a_2=38;next state=[5, 38];drop ONLY oldest state entry then append new scalar;prefix now=[4, 5, 38]
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(2, 5)
After
recurrence LEFT completion n=3 ORIGINAL coefficient0 times a_1 = 10
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, 10)
After
recurrence LEFT completion n=3 partial sum after coefficient0 = 10
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(6, 38)
After
recurrence LEFT completion n=3 ORIGINAL coefficient1 times a_2 = 228
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(10, 228)
After
recurrence LEFT completion n=3 partial sum after coefficient1 = 238
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)=[5, 38];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 2, 5, 10], [1, 2, 6, 38, 228]]
After
new a_3=238;next state=[38, 238];drop ONLY oldest state entry then append new scalar;prefix now=[4, 5, 38, 238]
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(2, 38)
After
recurrence LEFT completion n=4 ORIGINAL coefficient0 times a_2 = 76
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, 76)
After
recurrence LEFT completion n=4 partial sum after coefficient0 = 76
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(6, 238)
After
recurrence LEFT completion n=4 ORIGINAL coefficient1 times a_3 = 1428
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(76, 1428)
After
recurrence LEFT completion n=4 partial sum after coefficient1 = 1504
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)=[38, 238];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 2, 38, 76], [1, 3, 6, 238, 1428]]
After
new a_4=1504;next state=[238, 1504];drop ONLY oldest state entry then append new scalar;prefix now=[4, 5, 38, 238, 1504]
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(2, 238)
After
recurrence LEFT completion n=5 ORIGINAL coefficient0 times a_3 = 476
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, 476)
After
recurrence LEFT completion n=5 partial sum after coefficient0 = 476
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(6, 1504)
After
recurrence LEFT completion n=5 ORIGINAL coefficient1 times a_4 = 9024
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(476, 9024)
After
recurrence LEFT completion n=5 partial sum after coefficient1 = 9500
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)=[238, 1504];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 2, 238, 476], [1, 4, 6, 1504, 9024]]
After
new a_5=9500;next state=[1504, 9500];drop ONLY oldest state entry then append new scalar;prefix now=[4, 5, 38, 238, 1504, 9500]
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(2, 1504)
After
recurrence LEFT completion n=6 ORIGINAL coefficient0 times a_4 = 3008
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, 3008)
After
recurrence LEFT completion n=6 partial sum after coefficient0 = 3008
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(6, 9500)
After
recurrence LEFT completion n=6 ORIGINAL coefficient1 times a_5 = 57000
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(3008, 57000)
After
recurrence LEFT completion n=6 partial sum after coefficient1 = 60008
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)=[1504, 9500];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 2, 1504, 3008], [1, 5, 6, 9500, 57000]]
After
new a_6=60008;next state=[9500, 60008];drop ONLY oldest state entry then append new scalar;prefix now=[4, 5, 38, 238, 1504, 9500, 60008]
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(2, 9500)
After
recurrence LEFT completion n=7 ORIGINAL coefficient0 times a_5 = 19000
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, 19000)
After
recurrence LEFT completion n=7 partial sum after coefficient0 = 19000
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(6, 60008)
After
recurrence LEFT completion n=7 ORIGINAL coefficient1 times a_6 = 360048
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(19000, 360048)
After
recurrence LEFT completion n=7 partial sum after coefficient1 = 379048
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)=[9500, 60008];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 2, 9500, 19000], [1, 6, 6, 60008, 360048]]
After
new a_7=379048;next state=[60008, 379048];drop ONLY oldest state entry then append new scalar;prefix now=[4, 5, 38, 238, 1504, 9500, 60008, 379048]
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 · implies
Before
recurrence LEFT completion:complete ORIGINAL initial state=[4, 5];actual generated prefix=[4, 5, 38, 238, 1504, 9500, 60008, 379048]
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, S032
S034 · implies
Before
recurrence RIGHT completion:ORIGINAL order=2;oldest-to-newest coefficients=[2, 6];constant=0;ALL initial a_0..a_(r-1)=[4, 6]
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, S033
S035 · calculation
Before
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 := mul(2, 4)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 = 8
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 RIGHT completion n=2 partial sum after coefficient0 := sum(0, 8)
After
recurrence RIGHT completion n=2 partial sum after coefficient0 = 8
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 · calculation
Before
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 := mul(6, 6)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 = 36
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, S036
S038 · calculation
Before
recurrence RIGHT completion n=2 partial sum after coefficient1 := sum(8, 36)
After
recurrence RIGHT completion n=2 partial sum after coefficient1 = 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, S037
S039 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=2;previous state a_(n-r)..a_(n-1)=[4, 6];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 2, 4, 8], [1, 1, 6, 6, 36]]
After
new a_2=44;next state=[6, 44];drop ONLY oldest state entry then append new scalar;prefix now=[4, 6, 44]
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, S038
S040 · calculation
Before
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 := mul(2, 6)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 = 12
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=3 partial sum after coefficient0 := sum(0, 12)
After
recurrence RIGHT completion n=3 partial sum after coefficient0 = 12
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=3 ORIGINAL coefficient1 times a_2 := mul(6, 44)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 = 264
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=3 partial sum after coefficient1 := sum(12, 264)
After
recurrence RIGHT completion n=3 partial sum after coefficient1 = 276
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=3;previous state a_(n-r)..a_(n-1)=[6, 44];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 2, 6, 12], [1, 2, 6, 44, 264]]
After
new a_3=276;next state=[44, 276];drop ONLY oldest state entry then append new scalar;prefix now=[4, 6, 44, 276]
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=4 ORIGINAL coefficient0 times a_2 := mul(2, 44)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient0 times a_2 = 88
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=4 partial sum after coefficient0 := sum(0, 88)
After
recurrence RIGHT completion n=4 partial sum after coefficient0 = 88
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=4 ORIGINAL coefficient1 times a_3 := mul(6, 276)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient1 times a_3 = 1656
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=4 partial sum after coefficient1 := sum(88, 1656)
After
recurrence RIGHT completion n=4 partial sum after coefficient1 = 1744
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=4;previous state a_(n-r)..a_(n-1)=[44, 276];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 2, 44, 88], [1, 3, 6, 276, 1656]]
After
new a_4=1744;next state=[276, 1744];drop ONLY oldest state entry then append new scalar;prefix now=[4, 6, 44, 276, 1744]
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=5 ORIGINAL coefficient0 times a_3 := mul(2, 276)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient0 times a_3 = 552
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=5 partial sum after coefficient0 := sum(0, 552)
After
recurrence RIGHT completion n=5 partial sum after coefficient0 = 552
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=5 ORIGINAL coefficient1 times a_4 := mul(6, 1744)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient1 times a_4 = 10464
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=5 partial sum after coefficient1 := sum(552, 10464)
After
recurrence RIGHT completion n=5 partial sum after coefficient1 = 11016
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=5;previous state a_(n-r)..a_(n-1)=[276, 1744];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 2, 276, 552], [1, 4, 6, 1744, 10464]]
After
new a_5=11016;next state=[1744, 11016];drop ONLY oldest state entry then append new scalar;prefix now=[4, 6, 44, 276, 1744, 11016]
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=6 ORIGINAL coefficient0 times a_4 := mul(2, 1744)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient0 times a_4 = 3488
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=6 partial sum after coefficient0 := sum(0, 3488)
After
recurrence RIGHT completion n=6 partial sum after coefficient0 = 3488
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=6 ORIGINAL coefficient1 times a_5 := mul(6, 11016)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient1 times a_5 = 66096
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=6 partial sum after coefficient1 := sum(3488, 66096)
After
recurrence RIGHT completion n=6 partial sum after coefficient1 = 69584
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=6;previous state a_(n-r)..a_(n-1)=[1744, 11016];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 2, 1744, 3488], [1, 5, 6, 11016, 66096]]
After
new a_6=69584;next state=[11016, 69584];drop ONLY oldest state entry then append new scalar;prefix now=[4, 6, 44, 276, 1744, 11016, 69584]
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=7 ORIGINAL coefficient0 times a_5 := mul(2, 11016)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient0 times a_5 = 22032
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=7 partial sum after coefficient0 := sum(0, 22032)
After
recurrence RIGHT completion n=7 partial sum after coefficient0 = 22032
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=7 ORIGINAL coefficient1 times a_6 := mul(6, 69584)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient1 times a_6 = 417504
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=7 partial sum after coefficient1 := sum(22032, 417504)
After
recurrence RIGHT completion n=7 partial sum after coefficient1 = 439536
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=7;previous state a_(n-r)..a_(n-1)=[11016, 69584];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 2, 11016, 22032], [1, 6, 6, 69584, 417504]]
After
new a_7=439536;next state=[69584, 439536];drop ONLY oldest state entry then append new scalar;prefix now=[4, 6, 44, 276, 1744, 11016, 69584, 439536]
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 · implies
Before
recurrence RIGHT completion:complete ORIGINAL initial state=[4, 6];actual generated prefix=[4, 6, 44, 276, 1744, 11016, 69584, 439536]
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, S064
S066 · implies
Before
ORIGINAL only known a_0=4;different completions a_1=5 and6;target=7
After
WHOLE prefixes including initials differ=Yes;actual targets=[379048, 439536] 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, S065