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, 2];constant=2;ALL initial a_0..a_(r-1)=[10, 11]
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, 10)
After
recurrence LEFT completion n=2 ORIGINAL coefficient0 times a_0 = 20
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(2, 20)
After
recurrence LEFT completion n=2 partial sum after coefficient0 = 22
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, 11)
After
recurrence LEFT completion n=2 ORIGINAL coefficient1 times a_1 = 22
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(22, 22)
After
recurrence LEFT 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, S005
S007 · implies
Before
recurrence LEFT completion:ORIGINAL target n=2;previous state a_(n-r)..a_(n-1)=[10, 11];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 2, 10, 20], [1, 1, 2, 11, 22]]
After
new a_2=44;next state=[11, 44];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 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, S006
S008 · calculation
Before
recurrence LEFT completion n=3 ORIGINAL coefficient0 times a_1 := mul(2, 11)
After
recurrence LEFT completion n=3 ORIGINAL coefficient0 times a_1 = 22
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(2, 22)
After
recurrence LEFT completion n=3 partial sum after coefficient0 = 24
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, 44)
After
recurrence LEFT completion n=3 ORIGINAL coefficient1 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, S009
S011 · calculation
Before
recurrence LEFT completion n=3 partial sum after coefficient1 := sum(24, 88)
After
recurrence LEFT completion n=3 partial sum after coefficient1 = 112
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)=[11, 44];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 2, 11, 22], [1, 2, 2, 44, 88]]
After
new a_3=112;next state=[44, 112];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 44, 112]
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, 44)
After
recurrence LEFT 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, S012
S014 · calculation
Before
recurrence LEFT completion n=4 partial sum after coefficient0 := sum(2, 88)
After
recurrence LEFT completion n=4 partial sum after coefficient0 = 90
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, 112)
After
recurrence LEFT completion n=4 ORIGINAL coefficient1 times a_3 = 224
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(90, 224)
After
recurrence LEFT completion n=4 partial sum after coefficient1 = 314
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)=[44, 112];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 2, 44, 88], [1, 3, 2, 112, 224]]
After
new a_4=314;next state=[112, 314];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 44, 112, 314]
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, 112)
After
recurrence LEFT completion n=5 ORIGINAL coefficient0 times a_3 = 224
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(2, 224)
After
recurrence LEFT completion n=5 partial sum after coefficient0 = 226
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, 314)
After
recurrence LEFT completion n=5 ORIGINAL coefficient1 times a_4 = 628
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(226, 628)
After
recurrence LEFT completion n=5 partial sum after coefficient1 = 854
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)=[112, 314];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 2, 112, 224], [1, 4, 2, 314, 628]]
After
new a_5=854;next state=[314, 854];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 44, 112, 314, 854]
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, 314)
After
recurrence LEFT completion n=6 ORIGINAL coefficient0 times a_4 = 628
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(2, 628)
After
recurrence LEFT completion n=6 partial sum after coefficient0 = 630
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, 854)
After
recurrence LEFT completion n=6 ORIGINAL coefficient1 times a_5 = 1708
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(630, 1708)
After
recurrence LEFT completion n=6 partial sum after coefficient1 = 2338
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)=[314, 854];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 2, 314, 628], [1, 5, 2, 854, 1708]]
After
new a_6=2338;next state=[854, 2338];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 44, 112, 314, 854, 2338]
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, 854)
After
recurrence LEFT completion n=7 ORIGINAL coefficient0 times a_5 = 1708
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(2, 1708)
After
recurrence LEFT completion n=7 partial sum after coefficient0 = 1710
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, 2338)
After
recurrence LEFT completion n=7 ORIGINAL coefficient1 times a_6 = 4676
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(1710, 4676)
After
recurrence LEFT completion n=7 partial sum after coefficient1 = 6386
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)=[854, 2338];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 2, 854, 1708], [1, 6, 2, 2338, 4676]]
After
new a_7=6386;next state=[2338, 6386];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 44, 112, 314, 854, 2338, 6386]
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=[10, 11];actual generated prefix=[10, 11, 44, 112, 314, 854, 2338, 6386]
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, 2];constant=2;ALL initial a_0..a_(r-1)=[10, 12]
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, 10)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 = 20
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(2, 20)
After
recurrence RIGHT completion n=2 partial sum after coefficient0 = 22
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(2, 12)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 = 24
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(22, 24)
After
recurrence RIGHT completion n=2 partial sum after coefficient1 = 46
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)=[10, 12];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 2, 10, 20], [1, 1, 2, 12, 24]]
After
new a_2=46;next state=[12, 46];drop ONLY oldest state entry then append new scalar;prefix now=[10, 12, 46]
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, 12)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 = 24
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(2, 24)
After
recurrence RIGHT completion n=3 partial sum after coefficient0 = 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, S040
S042 · calculation
Before
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 := mul(2, 46)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 = 92
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(26, 92)
After
recurrence RIGHT completion n=3 partial sum after coefficient1 = 118
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)=[12, 46];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 2, 12, 24], [1, 2, 2, 46, 92]]
After
new a_3=118;next state=[46, 118];drop ONLY oldest state entry then append new scalar;prefix now=[10, 12, 46, 118]
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, 46)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient0 times a_2 = 92
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(2, 92)
After
recurrence RIGHT completion n=4 partial sum after coefficient0 = 94
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(2, 118)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient1 times a_3 = 236
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(94, 236)
After
recurrence RIGHT completion n=4 partial sum after coefficient1 = 330
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)=[46, 118];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 2, 46, 92], [1, 3, 2, 118, 236]]
After
new a_4=330;next state=[118, 330];drop ONLY oldest state entry then append new scalar;prefix now=[10, 12, 46, 118, 330]
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, 118)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient0 times a_3 = 236
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(2, 236)
After
recurrence RIGHT completion n=5 partial sum after coefficient0 = 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, S050
S052 · calculation
Before
recurrence RIGHT completion n=5 ORIGINAL coefficient1 times a_4 := mul(2, 330)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient1 times a_4 = 660
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(238, 660)
After
recurrence RIGHT completion n=5 partial sum after coefficient1 = 898
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)=[118, 330];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 2, 118, 236], [1, 4, 2, 330, 660]]
After
new a_5=898;next state=[330, 898];drop ONLY oldest state entry then append new scalar;prefix now=[10, 12, 46, 118, 330, 898]
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, 330)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient0 times a_4 = 660
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(2, 660)
After
recurrence RIGHT completion n=6 partial sum after coefficient0 = 662
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(2, 898)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient1 times a_5 = 1796
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(662, 1796)
After
recurrence RIGHT completion n=6 partial sum after coefficient1 = 2458
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)=[330, 898];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 2, 330, 660], [1, 5, 2, 898, 1796]]
After
new a_6=2458;next state=[898, 2458];drop ONLY oldest state entry then append new scalar;prefix now=[10, 12, 46, 118, 330, 898, 2458]
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, 898)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient0 times a_5 = 1796
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(2, 1796)
After
recurrence RIGHT completion n=7 partial sum after coefficient0 = 1798
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(2, 2458)
After
recurrence RIGHT completion n=7 ORIGINAL coefficient1 times a_6 = 4916
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(1798, 4916)
After
recurrence RIGHT completion n=7 partial sum after coefficient1 = 6714
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)=[898, 2458];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 2, 898, 1796], [1, 6, 2, 2458, 4916]]
After
new a_7=6714;next state=[2458, 6714];drop ONLY oldest state entry then append new scalar;prefix now=[10, 12, 46, 118, 330, 898, 2458, 6714]
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=[10, 12];actual generated prefix=[10, 12, 46, 118, 330, 898, 2458, 6714]
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=10;different completions a_1=11 and12;target=7
After
WHOLE prefixes including initials differ=Yes;actual targets=[6386, 6714] 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