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=[1, 3];constant=1;ALL initial a_0..a_(r-1)=[21, 22]
After
for EVERY n>=2,a_n=constant+sum_j coefficients[j]*a_(n-r+j);current prefix length=2;forward rule is total and single-valued
Conditions: none
Fix all r initials and the oldest-to-newest coefficient roles.Given the preceding r values,the next value is uniquely determined.This is a forward definition,not a closed form or convergence claim.
Step identifiers and dependencies
Rule: recurrence_complete_initial_state_and_total_single_value_rule · Uses: G001, S001
S003 · calculation
Before
recurrence LEFT completion n=2 ORIGINAL coefficient0 times a_0 := mul(1, 21)
After
recurrence LEFT completion n=2 ORIGINAL coefficient0 times a_0 = 21
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, 21)
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(3, 22)
After
recurrence LEFT completion n=2 ORIGINAL coefficient1 times a_1 = 66
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
recurrence LEFT completion n=2 partial sum after coefficient1 := sum(22, 66)
After
recurrence LEFT completion n=2 partial sum after coefficient1 = 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, S005
S007 · implies
Before
recurrence LEFT completion:ORIGINAL target n=2;previous state a_(n-r)..a_(n-1)=[21, 22];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 1, 21, 21], [1, 1, 3, 22, 66]]
After
new a_2=88;next state=[22, 88];drop ONLY oldest state entry then append new scalar;prefix now=[21, 22, 88]
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(1, 22)
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(1, 22)
After
recurrence LEFT completion n=3 partial sum after coefficient0 = 23
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(3, 88)
After
recurrence LEFT 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, S009
S011 · calculation
Before
recurrence LEFT completion n=3 partial sum after coefficient1 := sum(23, 264)
After
recurrence LEFT completion n=3 partial sum after coefficient1 = 287
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)=[22, 88];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 1, 22, 22], [1, 2, 3, 88, 264]]
After
new a_3=287;next state=[88, 287];drop ONLY oldest state entry then append new scalar;prefix now=[21, 22, 88, 287]
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(1, 88)
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(1, 88)
After
recurrence LEFT completion n=4 partial sum after coefficient0 = 89
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(3, 287)
After
recurrence LEFT completion n=4 ORIGINAL coefficient1 times a_3 = 861
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(89, 861)
After
recurrence LEFT completion n=4 partial sum after coefficient1 = 950
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)=[88, 287];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 1, 88, 88], [1, 3, 3, 287, 861]]
After
new a_4=950;next state=[287, 950];drop ONLY oldest state entry then append new scalar;prefix now=[21, 22, 88, 287, 950]
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(1, 287)
After
recurrence LEFT completion n=5 ORIGINAL coefficient0 times a_3 = 287
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, 287)
After
recurrence LEFT completion n=5 partial sum after coefficient0 = 288
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(3, 950)
After
recurrence LEFT completion n=5 ORIGINAL coefficient1 times a_4 = 2850
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(288, 2850)
After
recurrence LEFT completion n=5 partial sum after coefficient1 = 3138
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)=[287, 950];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 1, 287, 287], [1, 4, 3, 950, 2850]]
After
new a_5=3138;next state=[950, 3138];drop ONLY oldest state entry then append new scalar;prefix now=[21, 22, 88, 287, 950, 3138]
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(1, 950)
After
recurrence LEFT completion n=6 ORIGINAL coefficient0 times a_4 = 950
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, 950)
After
recurrence LEFT completion n=6 partial sum after coefficient0 = 951
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(3, 3138)
After
recurrence LEFT completion n=6 ORIGINAL coefficient1 times a_5 = 9414
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(951, 9414)
After
recurrence LEFT completion n=6 partial sum after coefficient1 = 10365
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)=[950, 3138];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 1, 950, 950], [1, 5, 3, 3138, 9414]]
After
new a_6=10365;next state=[3138, 10365];drop ONLY oldest state entry then append new scalar;prefix now=[21, 22, 88, 287, 950, 3138, 10365]
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 · implies
Before
recurrence LEFT completion:complete ORIGINAL initial state=[21, 22];actual generated prefix=[21, 22, 88, 287, 950, 3138, 10365]
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, S027
S029 · implies
Before
recurrence RIGHT completion:ORIGINAL order=2;oldest-to-newest coefficients=[1, 3];constant=1;ALL initial a_0..a_(r-1)=[21, 23]
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, S028
S030 · calculation
Before
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 := mul(1, 21)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient0 times a_0 = 21
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 RIGHT completion n=2 partial sum after coefficient0 := sum(1, 21)
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, S030
S032 · calculation
Before
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 := mul(3, 23)
After
recurrence RIGHT completion n=2 ORIGINAL coefficient1 times a_1 = 69
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, S031
S033 · calculation
Before
recurrence RIGHT completion n=2 partial sum after coefficient1 := sum(22, 69)
After
recurrence RIGHT completion n=2 partial sum after coefficient1 = 91
Conditions: none
Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S032
S034 · implies
Before
recurrence RIGHT completion:ORIGINAL target n=2;previous state a_(n-r)..a_(n-1)=[21, 23];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 1, 21, 21], [1, 1, 3, 23, 69]]
After
new a_2=91;next state=[23, 91];drop ONLY oldest state entry then append new scalar;prefix now=[21, 23, 91]
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, S033
S035 · calculation
Before
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 := mul(1, 23)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient0 times a_1 = 23
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=3 partial sum after coefficient0 := sum(1, 23)
After
recurrence RIGHT 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, S035
S037 · calculation
Before
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 := mul(3, 91)
After
recurrence RIGHT completion n=3 ORIGINAL coefficient1 times a_2 = 273
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=3 partial sum after coefficient1 := sum(24, 273)
After
recurrence RIGHT completion n=3 partial sum after coefficient1 = 297
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=3;previous state a_(n-r)..a_(n-1)=[23, 91];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 1, 23, 23], [1, 2, 3, 91, 273]]
After
new a_3=297;next state=[91, 297];drop ONLY oldest state entry then append new scalar;prefix now=[21, 23, 91, 297]
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=4 ORIGINAL coefficient0 times a_2 := mul(1, 91)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient0 times a_2 = 91
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=4 partial sum after coefficient0 := sum(1, 91)
After
recurrence RIGHT completion n=4 partial sum after coefficient0 = 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, S040
S042 · calculation
Before
recurrence RIGHT completion n=4 ORIGINAL coefficient1 times a_3 := mul(3, 297)
After
recurrence RIGHT completion n=4 ORIGINAL coefficient1 times a_3 = 891
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=4 partial sum after coefficient1 := sum(92, 891)
After
recurrence RIGHT completion n=4 partial sum after coefficient1 = 983
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=4;previous state a_(n-r)..a_(n-1)=[91, 297];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 1, 91, 91], [1, 3, 3, 297, 891]]
After
new a_4=983;next state=[297, 983];drop ONLY oldest state entry then append new scalar;prefix now=[21, 23, 91, 297, 983]
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=5 ORIGINAL coefficient0 times a_3 := mul(1, 297)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient0 times a_3 = 297
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=5 partial sum after coefficient0 := sum(1, 297)
After
recurrence RIGHT completion n=5 partial sum after coefficient0 = 298
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=5 ORIGINAL coefficient1 times a_4 := mul(3, 983)
After
recurrence RIGHT completion n=5 ORIGINAL coefficient1 times a_4 = 2949
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=5 partial sum after coefficient1 := sum(298, 2949)
After
recurrence RIGHT completion n=5 partial sum after coefficient1 = 3247
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=5;previous state a_(n-r)..a_(n-1)=[297, 983];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 1, 297, 297], [1, 4, 3, 983, 2949]]
After
new a_5=3247;next state=[983, 3247];drop ONLY oldest state entry then append new scalar;prefix now=[21, 23, 91, 297, 983, 3247]
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=6 ORIGINAL coefficient0 times a_4 := mul(1, 983)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient0 times a_4 = 983
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=6 partial sum after coefficient0 := sum(1, 983)
After
recurrence RIGHT completion n=6 partial sum after coefficient0 = 984
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=6 ORIGINAL coefficient1 times a_5 := mul(3, 3247)
After
recurrence RIGHT completion n=6 ORIGINAL coefficient1 times a_5 = 9741
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=6 partial sum after coefficient1 := sum(984, 9741)
After
recurrence RIGHT completion n=6 partial sum after coefficient1 = 10725
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=6;previous state a_(n-r)..a_(n-1)=[983, 3247];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 1, 983, 983], [1, 5, 3, 3247, 9741]]
After
new a_6=10725;next state=[3247, 10725];drop ONLY oldest state entry then append new scalar;prefix now=[21, 23, 91, 297, 983, 3247, 10725]
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 · implies
Before
recurrence RIGHT completion:complete ORIGINAL initial state=[21, 23];actual generated prefix=[21, 23, 91, 297, 983, 3247, 10725]
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, S054
S056 · implies
Before
ORIGINAL only known a_0=21;different completions a_1=22 and23;target=6
After
WHOLE prefixes including initials differ=Yes;actual targets=[10365, 10725] 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, S055