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, 5];constant=1;ALL initial a_0..a_(r-1)=[13, 14]
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, 13)
After
recurrence LEFT completion n=2 ORIGINAL coefficient0 times a_0 = 26
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(1, 26)
After
recurrence LEFT completion n=2 partial sum after coefficient0 = 27
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(5, 14)
After
recurrence LEFT completion n=2 ORIGINAL coefficient1 times a_1 = 70
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(27, 70)
After
recurrence LEFT completion n=2 partial sum after coefficient1 = 97
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)=[13, 14];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 2, 13, 26], [1, 1, 5, 14, 70]]
After
new a_2=97;next state=[14, 97];drop ONLY oldest state entry then append new scalar;prefix now=[13, 14, 97]
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, 14)
After
recurrence LEFT completion n=3 ORIGINAL coefficient0 times a_1 = 28
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(1, 28)
After
recurrence LEFT completion n=3 partial sum after coefficient0 = 29
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(5, 97)
After
recurrence LEFT completion n=3 ORIGINAL coefficient1 times a_2 = 485
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(29, 485)
After
recurrence LEFT completion n=3 partial sum after coefficient1 = 514
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)=[14, 97];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 2, 14, 28], [1, 2, 5, 97, 485]]
After
new a_3=514;next state=[97, 514];drop ONLY oldest state entry then append new scalar;prefix now=[13, 14, 97, 514]
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, 97)
After
recurrence LEFT completion n=4 ORIGINAL coefficient0 times a_2 = 194
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(1, 194)
After
recurrence LEFT completion n=4 partial sum after coefficient0 = 195
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(5, 514)
After
recurrence LEFT completion n=4 ORIGINAL coefficient1 times a_3 = 2570
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(195, 2570)
After
recurrence LEFT completion n=4 partial sum after coefficient1 = 2765
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)=[97, 514];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 2, 97, 194], [1, 3, 5, 514, 2570]]
After
new a_4=2765;next state=[514, 2765];drop ONLY oldest state entry then append new scalar;prefix now=[13, 14, 97, 514, 2765]
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, 514)
After
recurrence LEFT completion n=5 ORIGINAL coefficient0 times a_3 = 1028
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(1, 1028)
After
recurrence LEFT completion n=5 partial sum after coefficient0 = 1029
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(5, 2765)
After
recurrence LEFT completion n=5 ORIGINAL coefficient1 times a_4 = 13825
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(1029, 13825)
After
recurrence LEFT completion n=5 partial sum after coefficient1 = 14854
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)=[514, 2765];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 2, 514, 1028], [1, 4, 5, 2765, 13825]]
After
new a_5=14854;next state=[2765, 14854];drop ONLY oldest state entry then append new scalar;prefix now=[13, 14, 97, 514, 2765, 14854]
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, 2765)
After
recurrence LEFT completion n=6 ORIGINAL coefficient0 times a_4 = 5530
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(1, 5530)
After
recurrence LEFT completion n=6 partial sum after coefficient0 = 5531
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(5, 14854)
After
recurrence LEFT completion n=6 ORIGINAL coefficient1 times a_5 = 74270
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(5531, 74270)
After
recurrence LEFT completion n=6 partial sum after coefficient1 = 79801
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)=[2765, 14854];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 2, 2765, 5530], [1, 5, 5, 14854, 74270]]
After
new a_6=79801;next state=[14854, 79801];drop ONLY oldest state entry then append new scalar;prefix now=[13, 14, 97, 514, 2765, 14854, 79801]
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, 14854)
After
recurrence LEFT completion n=7 ORIGINAL coefficient0 times a_5 = 29708
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(1, 29708)
After
recurrence LEFT completion n=7 partial sum after coefficient0 = 29709
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(5, 79801)
After
recurrence LEFT completion n=7 ORIGINAL coefficient1 times a_6 = 399005
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(29709, 399005)
After
recurrence LEFT completion n=7 partial sum after coefficient1 = 428714
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)=[14854, 79801];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 2, 14854, 29708], [1, 6, 5, 79801, 399005]]
After
new a_7=428714;next state=[79801, 428714];drop ONLY oldest state entry then append new scalar;prefix now=[13, 14, 97, 514, 2765, 14854, 79801, 428714]
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=[13, 14];actual generated prefix=[13, 14, 97, 514, 2765, 14854, 79801, 428714]
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, 5];constant=1;ALL initial a_0..a_(r-1)=[13, 15]
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, 13)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 = 26
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(1, 26)
After
recurrence RIGHT completion n=2 partial sum after coefficient0 = 27
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(5, 15)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 = 75
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(27, 75)
After
recurrence RIGHT 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, S037
S039 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=2;previous state a_(n-r)..a_(n-1)=[13, 15];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 2, 13, 26], [1, 1, 5, 15, 75]]
After
new a_2=102;next state=[15, 102];drop ONLY oldest state entry then append new scalar;prefix now=[13, 15, 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, S038
S040 · calculation
Before
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 := mul(2, 15)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient0 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, S039
S041 · calculation
Before
recurrence RIGHT completion n=3 partial sum after coefficient0 := sum(1, 30)
After
recurrence RIGHT completion n=3 partial sum after coefficient0 = 31
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(5, 102)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 = 510
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(31, 510)
After
recurrence RIGHT completion n=3 partial sum after coefficient1 = 541
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)=[15, 102];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 2, 15, 30], [1, 2, 5, 102, 510]]
After
new a_3=541;next state=[102, 541];drop ONLY oldest state entry then append new scalar;prefix now=[13, 15, 102, 541]
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, 102)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient0 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, S044
S046 · calculation
Before
recurrence RIGHT completion n=4 partial sum after coefficient0 := sum(1, 204)
After
recurrence RIGHT completion n=4 partial sum after coefficient0 = 205
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(5, 541)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient1 times a_3 = 2705
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(205, 2705)
After
recurrence RIGHT completion n=4 partial sum after coefficient1 = 2910
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)=[102, 541];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 2, 102, 204], [1, 3, 5, 541, 2705]]
After
new a_4=2910;next state=[541, 2910];drop ONLY oldest state entry then append new scalar;prefix now=[13, 15, 102, 541, 2910]
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, 541)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient0 times a_3 = 1082
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(1, 1082)
After
recurrence RIGHT completion n=5 partial sum after coefficient0 = 1083
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(5, 2910)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient1 times a_4 = 14550
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(1083, 14550)
After
recurrence RIGHT completion n=5 partial sum after coefficient1 = 15633
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)=[541, 2910];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 2, 541, 1082], [1, 4, 5, 2910, 14550]]
After
new a_5=15633;next state=[2910, 15633];drop ONLY oldest state entry then append new scalar;prefix now=[13, 15, 102, 541, 2910, 15633]
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, 2910)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient0 times a_4 = 5820
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(1, 5820)
After
recurrence RIGHT completion n=6 partial sum after coefficient0 = 5821
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(5, 15633)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient1 times a_5 = 78165
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(5821, 78165)
After
recurrence RIGHT completion n=6 partial sum after coefficient1 = 83986
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)=[2910, 15633];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 2, 2910, 5820], [1, 5, 5, 15633, 78165]]
After
new a_6=83986;next state=[15633, 83986];drop ONLY oldest state entry then append new scalar;prefix now=[13, 15, 102, 541, 2910, 15633, 83986]
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, 15633)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient0 times a_5 = 31266
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(1, 31266)
After
recurrence RIGHT completion n=7 partial sum after coefficient0 = 31267
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(5, 83986)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient1 times a_6 = 419930
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(31267, 419930)
After
recurrence RIGHT completion n=7 partial sum after coefficient1 = 451197
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)=[15633, 83986];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 2, 15633, 31266], [1, 6, 5, 83986, 419930]]
After
new a_7=451197;next state=[83986, 451197];drop ONLY oldest state entry then append new scalar;prefix now=[13, 15, 102, 541, 2910, 15633, 83986, 451197]
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=[13, 15];actual generated prefix=[13, 15, 102, 541, 2910, 15633, 83986, 451197]
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=13;different completions a_1=14 and15;target=7
After
WHOLE prefixes including initials differ=Yes;actual targets=[428714, 451197] 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