# Question 22536: A Complete Initial State Gives a Unique Forward Prefix

[Return to catalogue page 113](https://ocme.evemisslab.com/en/questions/page/113/)

[← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261014-advance-20261110-r05-recurrence-relation-foundations/#q-20261014-advance-20261110-r05-recurrence-relation-0061)

This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth.

R0044-22536 · q-20261014-advance-20261110-r05-recurrence-relation-0061



## Original question and givens

Use order r=3, coefficients=[1, 2, 3] in oldest-to-newest order, constant=-2 and initial_values=[10, 11, 12], where initial_values[j]=a_j. For n≥r, a_n=constant+sum over j=0..r−1 of coefficients[j]*a_(n−r+j). The state shifts left then appends the new scalar. All intermediate integer operations must be safe. Target index=8. Give (order, initial_count, target_n, target_value, unique_prefix, certificate).


- G001 — Use order r=3, coefficients=[1, 2, 3] in oldest-to-newest order, constant=-2 and initial_values=[10, 11, 12], where initial_values[j]=a_j. For n≥r, a_n=constant+sum over j=0..r−1 of coefficients[j]*a_(n−r+j). The state shifts left then appends the new scalar. All intermediate integer operations must be safe. Target index=8. Give (order, initial_count, target_n, target_value, unique_prefix, certificate).





## Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.


- [mko-recurrence-relation](https://ocme.evemisslab.com/en/mko/mko-recurrence-relation/)





## Step-by-step derivation

S001 · impliesBefore

source operation=recurrence-initial-value-uniqueness;original snapshot and mathematics retained

After

explicit ordered source output fields=[order, initial_count, target_n, target_value, unique_prefix, certificate]

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 dependenciesRule: source_ordered_interface_explicit_without_javascript · Uses: G001





S002 · impliesBefore

recurrence ORIGINAL:ORIGINAL order=3;oldest-to-newest coefficients=[1, 2, 3];constant=-2;ALL initial a_0..a_(r-1)=[10, 11, 12]

After

for EVERY n>=3,a_n=constant+sum_j coefficients[j]*a_(n-r+j);current prefix length=3;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 dependenciesRule: recurrence_complete_initial_state_and_total_single_value_rule · Uses: G001, S001





S003 · calculationBefore

recurrence ORIGINAL n=3 ORIGINAL coefficient0 times a_0 := mul(1, 10)

After

recurrence ORIGINAL n=3 ORIGINAL coefficient0 times a_0 = 10

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S002





S004 · calculationBefore

recurrence ORIGINAL n=3 partial sum after coefficient0 := sum(-2, 10)

After

recurrence ORIGINAL n=3 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S003





S005 · calculationBefore

recurrence ORIGINAL n=3 ORIGINAL coefficient1 times a_1 := mul(2, 11)

After

recurrence ORIGINAL n=3 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S004





S006 · calculationBefore

recurrence ORIGINAL n=3 partial sum after coefficient1 := sum(8, 22)

After

recurrence ORIGINAL n=3 partial sum after coefficient1 = 30

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S005





S007 · calculationBefore

recurrence ORIGINAL n=3 ORIGINAL coefficient2 times a_2 := mul(3, 12)

After

recurrence ORIGINAL n=3 ORIGINAL coefficient2 times a_2 = 36

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S006





S008 · calculationBefore

recurrence ORIGINAL n=3 partial sum after coefficient2 := sum(30, 36)

After

recurrence ORIGINAL n=3 partial sum after coefficient2 = 66

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S007





S009 · impliesBefore

recurrence ORIGINAL:ORIGINAL target n=3;previous state a_(n-r)..a_(n-1)=[10, 11, 12];ALL [j,source_index,coefficient,value,product] rows=[[0, 0, 1, 10, 10], [1, 1, 2, 11, 22], [2, 2, 3, 12, 36]]

After

new a_3=66;next state=[11, 12, 66];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 12, 66]

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 dependenciesRule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S008





S010 · calculationBefore

recurrence ORIGINAL n=4 ORIGINAL coefficient0 times a_1 := mul(1, 11)

After

recurrence ORIGINAL n=4 ORIGINAL coefficient0 times a_1 = 11

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S009





S011 · calculationBefore

recurrence ORIGINAL n=4 partial sum after coefficient0 := sum(-2, 11)

After

recurrence ORIGINAL n=4 partial sum after coefficient0 = 9

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S010





S012 · calculationBefore

recurrence ORIGINAL n=4 ORIGINAL coefficient1 times a_2 := mul(2, 12)

After

recurrence ORIGINAL n=4 ORIGINAL coefficient1 times a_2 = 24

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S011





S013 · calculationBefore

recurrence ORIGINAL n=4 partial sum after coefficient1 := sum(9, 24)

After

recurrence ORIGINAL n=4 partial sum after coefficient1 = 33

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S012





S014 · calculationBefore

recurrence ORIGINAL n=4 ORIGINAL coefficient2 times a_3 := mul(3, 66)

After

recurrence ORIGINAL n=4 ORIGINAL coefficient2 times a_3 = 198

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S013





S015 · calculationBefore

recurrence ORIGINAL n=4 partial sum after coefficient2 := sum(33, 198)

After

recurrence ORIGINAL n=4 partial sum after coefficient2 = 231

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S014





S016 · impliesBefore

recurrence ORIGINAL:ORIGINAL target n=4;previous state a_(n-r)..a_(n-1)=[11, 12, 66];ALL [j,source_index,coefficient,value,product] rows=[[0, 1, 1, 11, 11], [1, 2, 2, 12, 24], [2, 3, 3, 66, 198]]

After

new a_4=231;next state=[12, 66, 231];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 12, 66, 231]

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 dependenciesRule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S015





S017 · calculationBefore

recurrence ORIGINAL n=5 ORIGINAL coefficient0 times a_2 := mul(1, 12)

After

recurrence ORIGINAL n=5 ORIGINAL coefficient0 times a_2 = 12

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S016





S018 · calculationBefore

recurrence ORIGINAL n=5 partial sum after coefficient0 := sum(-2, 12)

After

recurrence ORIGINAL n=5 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S017





S019 · calculationBefore

recurrence ORIGINAL n=5 ORIGINAL coefficient1 times a_3 := mul(2, 66)

After

recurrence ORIGINAL n=5 ORIGINAL coefficient1 times a_3 = 132

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S018





S020 · calculationBefore

recurrence ORIGINAL n=5 partial sum after coefficient1 := sum(10, 132)

After

recurrence ORIGINAL n=5 partial sum after coefficient1 = 142

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S019





S021 · calculationBefore

recurrence ORIGINAL n=5 ORIGINAL coefficient2 times a_4 := mul(3, 231)

After

recurrence ORIGINAL n=5 ORIGINAL coefficient2 times a_4 = 693

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S020





S022 · calculationBefore

recurrence ORIGINAL n=5 partial sum after coefficient2 := sum(142, 693)

After

recurrence ORIGINAL n=5 partial sum after coefficient2 = 835

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S021





S023 · impliesBefore

recurrence ORIGINAL:ORIGINAL target n=5;previous state a_(n-r)..a_(n-1)=[12, 66, 231];ALL [j,source_index,coefficient,value,product] rows=[[0, 2, 1, 12, 12], [1, 3, 2, 66, 132], [2, 4, 3, 231, 693]]

After

new a_5=835;next state=[66, 231, 835];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 12, 66, 231, 835]

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 dependenciesRule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S022





S024 · calculationBefore

recurrence ORIGINAL n=6 ORIGINAL coefficient0 times a_3 := mul(1, 66)

After

recurrence ORIGINAL n=6 ORIGINAL coefficient0 times a_3 = 66

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S023





S025 · calculationBefore

recurrence ORIGINAL n=6 partial sum after coefficient0 := sum(-2, 66)

After

recurrence ORIGINAL n=6 partial sum after coefficient0 = 64

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S024





S026 · calculationBefore

recurrence ORIGINAL n=6 ORIGINAL coefficient1 times a_4 := mul(2, 231)

After

recurrence ORIGINAL n=6 ORIGINAL coefficient1 times a_4 = 462

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S025





S027 · calculationBefore

recurrence ORIGINAL n=6 partial sum after coefficient1 := sum(64, 462)

After

recurrence ORIGINAL n=6 partial sum after coefficient1 = 526

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S026





S028 · calculationBefore

recurrence ORIGINAL n=6 ORIGINAL coefficient2 times a_5 := mul(3, 835)

After

recurrence ORIGINAL n=6 ORIGINAL coefficient2 times a_5 = 2505

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S027





S029 · calculationBefore

recurrence ORIGINAL n=6 partial sum after coefficient2 := sum(526, 2505)

After

recurrence ORIGINAL n=6 partial sum after coefficient2 = 3031

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S028





S030 · impliesBefore

recurrence ORIGINAL:ORIGINAL target n=6;previous state a_(n-r)..a_(n-1)=[66, 231, 835];ALL [j,source_index,coefficient,value,product] rows=[[0, 3, 1, 66, 66], [1, 4, 2, 231, 462], [2, 5, 3, 835, 2505]]

After

new a_6=3031;next state=[231, 835, 3031];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 12, 66, 231, 835, 3031]

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 dependenciesRule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S029





S031 · calculationBefore

recurrence ORIGINAL n=7 ORIGINAL coefficient0 times a_4 := mul(1, 231)

After

recurrence ORIGINAL n=7 ORIGINAL coefficient0 times a_4 = 231

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S030





S032 · calculationBefore

recurrence ORIGINAL n=7 partial sum after coefficient0 := sum(-2, 231)

After

recurrence ORIGINAL n=7 partial sum after coefficient0 = 229

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S031





S033 · calculationBefore

recurrence ORIGINAL n=7 ORIGINAL coefficient1 times a_5 := mul(2, 835)

After

recurrence ORIGINAL n=7 ORIGINAL coefficient1 times a_5 = 1670

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S032





S034 · calculationBefore

recurrence ORIGINAL n=7 partial sum after coefficient1 := sum(229, 1670)

After

recurrence ORIGINAL n=7 partial sum after coefficient1 = 1899

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S033





S035 · calculationBefore

recurrence ORIGINAL n=7 ORIGINAL coefficient2 times a_6 := mul(3, 3031)

After

recurrence ORIGINAL n=7 ORIGINAL coefficient2 times a_6 = 9093

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S034





S036 · calculationBefore

recurrence ORIGINAL n=7 partial sum after coefficient2 := sum(1899, 9093)

After

recurrence ORIGINAL n=7 partial sum after coefficient2 = 10992

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S035





S037 · impliesBefore

recurrence ORIGINAL:ORIGINAL target n=7;previous state a_(n-r)..a_(n-1)=[231, 835, 3031];ALL [j,source_index,coefficient,value,product] rows=[[0, 4, 1, 231, 231], [1, 5, 2, 835, 1670], [2, 6, 3, 3031, 9093]]

After

new a_7=10992;next state=[835, 3031, 10992];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 12, 66, 231, 835, 3031, 10992]

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 dependenciesRule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S036





S038 · calculationBefore

recurrence ORIGINAL n=8 ORIGINAL coefficient0 times a_5 := mul(1, 835)

After

recurrence ORIGINAL n=8 ORIGINAL coefficient0 times a_5 = 835

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S037





S039 · calculationBefore

recurrence ORIGINAL n=8 partial sum after coefficient0 := sum(-2, 835)

After

recurrence ORIGINAL n=8 partial sum after coefficient0 = 833

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S038





S040 · calculationBefore

recurrence ORIGINAL n=8 ORIGINAL coefficient1 times a_6 := mul(2, 3031)

After

recurrence ORIGINAL n=8 ORIGINAL coefficient1 times a_6 = 6062

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S039





S041 · calculationBefore

recurrence ORIGINAL n=8 partial sum after coefficient1 := sum(833, 6062)

After

recurrence ORIGINAL n=8 partial sum after coefficient1 = 6895

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S040





S042 · calculationBefore

recurrence ORIGINAL n=8 ORIGINAL coefficient2 times a_7 := mul(3, 10992)

After

recurrence ORIGINAL n=8 ORIGINAL coefficient2 times a_7 = 32976

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S041





S043 · calculationBefore

recurrence ORIGINAL n=8 partial sum after coefficient2 := sum(6895, 32976)

After

recurrence ORIGINAL n=8 partial sum after coefficient2 = 39871

Conditions: none

Substitute original roles,indices and established intermediates exactly,not floating-point approximations or another question's data.

Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S042





S044 · impliesBefore

recurrence ORIGINAL:ORIGINAL target n=8;previous state a_(n-r)..a_(n-1)=[835, 3031, 10992];ALL [j,source_index,coefficient,value,product] rows=[[0, 5, 1, 835, 835], [1, 6, 2, 3031, 6062], [2, 7, 3, 10992, 32976]]

After

new a_8=39871;next state=[3031, 10992, 39871];drop ONLY oldest state entry then append new scalar;prefix now=[10, 11, 12, 66, 231, 835, 3031, 10992, 39871]

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 dependenciesRule: recurrence_EVERY_state_update_shift_left_append_exact · Uses: G001, S043





S045 · impliesBefore

recurrence ORIGINAL:complete ORIGINAL initial state=[10, 11, 12];actual generated prefix=[10, 11, 12, 66, 231, 835, 3031, 10992, 39871]

After

ANY two sequences with SAME r initials and SAME total rule agree at n=3 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 dependenciesRule: recurrence_forward_uniqueness_induction_not_analytic_claim · Uses: G001, S044









## Reverse checks


- S045 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S043 · premise_and_result_audit — Recompute recurrence ORIGINAL n=8 partial sum after coefficient2 with exact rational arithmetic, not rounded decimals.
- S042 · premise_and_result_audit — Recompute recurrence ORIGINAL n=8 ORIGINAL coefficient2 times a_7 with exact rational arithmetic, not rounded decimals.
- S041 · premise_and_result_audit — Recompute recurrence ORIGINAL n=8 partial sum after coefficient1 with exact rational arithmetic, not rounded decimals.
- S040 · premise_and_result_audit — Recompute recurrence ORIGINAL n=8 ORIGINAL coefficient1 times a_6 with exact rational arithmetic, not rounded decimals.
- S039 · premise_and_result_audit — Recompute recurrence ORIGINAL n=8 partial sum after coefficient0 with exact rational arithmetic, not rounded decimals.
- S038 · premise_and_result_audit — Recompute recurrence ORIGINAL n=8 ORIGINAL coefficient0 times a_5 with exact rational arithmetic, not rounded decimals.
- S037 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S036 · premise_and_result_audit — Recompute recurrence ORIGINAL n=7 partial sum after coefficient2 with exact rational arithmetic, not rounded decimals.
- S035 · premise_and_result_audit — Recompute recurrence ORIGINAL n=7 ORIGINAL coefficient2 times a_6 with exact rational arithmetic, not rounded decimals.
- S034 · premise_and_result_audit — Recompute recurrence ORIGINAL n=7 partial sum after coefficient1 with exact rational arithmetic, not rounded decimals.
- S033 · premise_and_result_audit — Recompute recurrence ORIGINAL n=7 ORIGINAL coefficient1 times a_5 with exact rational arithmetic, not rounded decimals.
- S032 · premise_and_result_audit — Recompute recurrence ORIGINAL n=7 partial sum after coefficient0 with exact rational arithmetic, not rounded decimals.
- S031 · premise_and_result_audit — Recompute recurrence ORIGINAL n=7 ORIGINAL coefficient0 times a_4 with exact rational arithmetic, not rounded decimals.
- S030 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S029 · premise_and_result_audit — Recompute recurrence ORIGINAL n=6 partial sum after coefficient2 with exact rational arithmetic, not rounded decimals.
- S028 · premise_and_result_audit — Recompute recurrence ORIGINAL n=6 ORIGINAL coefficient2 times a_5 with exact rational arithmetic, not rounded decimals.
- S027 · premise_and_result_audit — Recompute recurrence ORIGINAL n=6 partial sum after coefficient1 with exact rational arithmetic, not rounded decimals.
- S026 · premise_and_result_audit — Recompute recurrence ORIGINAL n=6 ORIGINAL coefficient1 times a_4 with exact rational arithmetic, not rounded decimals.
- S025 · premise_and_result_audit — Recompute recurrence ORIGINAL n=6 partial sum after coefficient0 with exact rational arithmetic, not rounded decimals.
- S024 · premise_and_result_audit — Recompute recurrence ORIGINAL n=6 ORIGINAL coefficient0 times a_3 with exact rational arithmetic, not rounded decimals.
- S023 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S022 · premise_and_result_audit — Recompute recurrence ORIGINAL n=5 partial sum after coefficient2 with exact rational arithmetic, not rounded decimals.
- S021 · premise_and_result_audit — Recompute recurrence ORIGINAL n=5 ORIGINAL coefficient2 times a_4 with exact rational arithmetic, not rounded decimals.
- S020 · premise_and_result_audit — Recompute recurrence ORIGINAL n=5 partial sum after coefficient1 with exact rational arithmetic, not rounded decimals.
- S019 · premise_and_result_audit — Recompute recurrence ORIGINAL n=5 ORIGINAL coefficient1 times a_3 with exact rational arithmetic, not rounded decimals.
- S018 · premise_and_result_audit — Recompute recurrence ORIGINAL n=5 partial sum after coefficient0 with exact rational arithmetic, not rounded decimals.
- S017 · premise_and_result_audit — Recompute recurrence ORIGINAL n=5 ORIGINAL coefficient0 times a_2 with exact rational arithmetic, not rounded decimals.
- S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S015 · premise_and_result_audit — Recompute recurrence ORIGINAL n=4 partial sum after coefficient2 with exact rational arithmetic, not rounded decimals.
- S014 · premise_and_result_audit — Recompute recurrence ORIGINAL n=4 ORIGINAL coefficient2 times a_3 with exact rational arithmetic, not rounded decimals.
- S013 · premise_and_result_audit — Recompute recurrence ORIGINAL n=4 partial sum after coefficient1 with exact rational arithmetic, not rounded decimals.
- S012 · premise_and_result_audit — Recompute recurrence ORIGINAL n=4 ORIGINAL coefficient1 times a_2 with exact rational arithmetic, not rounded decimals.
- S011 · premise_and_result_audit — Recompute recurrence ORIGINAL n=4 partial sum after coefficient0 with exact rational arithmetic, not rounded decimals.
- S010 · premise_and_result_audit — Recompute recurrence ORIGINAL n=4 ORIGINAL coefficient0 times a_1 with exact rational arithmetic, not rounded decimals.
- S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S008 · premise_and_result_audit — Recompute recurrence ORIGINAL n=3 partial sum after coefficient2 with exact rational arithmetic, not rounded decimals.
- S007 · premise_and_result_audit — Recompute recurrence ORIGINAL n=3 ORIGINAL coefficient2 times a_2 with exact rational arithmetic, not rounded decimals.
- S006 · premise_and_result_audit — Recompute recurrence ORIGINAL n=3 partial sum after coefficient1 with exact rational arithmetic, not rounded decimals.
- S005 · premise_and_result_audit — Recompute recurrence ORIGINAL n=3 ORIGINAL coefficient1 times a_1 with exact rational arithmetic, not rounded decimals.
- S004 · premise_and_result_audit — Recompute recurrence ORIGINAL n=3 partial sum after coefficient0 with exact rational arithmetic, not rounded decimals.
- S003 · premise_and_result_audit — Recompute recurrence ORIGINAL n=3 ORIGINAL coefficient0 times a_0 with exact rational arithmetic, not rounded decimals.
- S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.





## Result

(3, 3, 8, 39871, Yes, total_single_valued_rule_plus_all_order_many_initial_values_gives_unique_prefix)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.





## This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
- input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
- original question SHA-256: 53cfc19bf2937dfb60673c3c25a2055f83baf4c81cf94c7e1270723393e694f4
- candidate record SHA-256: e3e09a834abffd1f56e00db9e526d40425707978a467642aba6d29742fa297c2
- semantic review receipt SHA-256: 89b8e810eced1a69dbfef28d4b112e829edf156c7905a86e39a3f4958cd75e81
- question-first witness SHA-256: b2e8b769c463242f05172564ae96e310403eae151e1ec30bcb50be3ffe12cfc7
- Lean: NOT_RUN · human review: NOT_PERFORMED

[Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261014-advance-20261110-r05-recurrence-relation-0061.json)




