# Question 1562: A Fixed-Length Discrete Orbit Prefix

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

[← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261013-advance-20261020-r01-discrete-dynamical-system-foundations/#q-20261013-advance-20261020-r01-discrete-dynamical-system-0037)

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.

R0002-01562 · q-20261013-advance-20261020-r01-discrete-dynamical-system-0037



## Original question and givens

Use the complete finite self-map on Fin(6)={0,…,5} given by T(x)=(a*x+b) mod 6, a=12, b=26. Choose the least nonnegative residue, including for negative a*x+b. Time is discrete, indexed from 0; a finite orbit is not a general stability result. x0=5, updates=2. Give (modulus, a, b, x0, update count, orbit including x0). Zero updates gives the one-element prefix [x0].


- G001 — Use the complete finite self-map on Fin(6)={0,…,5} given by T(x)=(a*x+b) mod 6, a=12, b=26. Choose the least nonnegative residue, including for negative a*x+b. Time is discrete, indexed from 0; a finite orbit is not a general stability result. x0=5, updates=2. Give (modulus, a, b, x0, update count, orbit including x0). Zero updates gives the one-element prefix [x0].





## 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-discrete-dynamical-system](https://ocme.evemisslab.com/en/mko/mko-discrete-dynamical-system/)





## Step-by-step derivation

S001 · impliesBefore

X={0 through 5}; T(x)=(12x+(26)) mod 6

After

remainder representative always lies in X

Conditions: none

Fix the full finite state carrier and the same update rule;negative integers also use the standard remainder from0 through n−1.

Step identifiers and dependenciesRule: finite_total_map · Uses: G001





S002 · impliesBefore

x₀=5; transitions=2

After

initial orbit prefix=[5]

Conditions: none

Retain the initial state;steps=0 still has one known state,not an empty list.

Step identifiers and dependenciesRule: orbit_initial_state · Uses: G001, S001





S003 · calculationBefore

transition1: a·x := mul(12, 5)

After

transition1: a·x = 60

Conditions: none

Multiply the original coefficient by the current state;do not clip negative values to0.

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





S004 · calculationBefore

transition1: a·x+b := sum(60, 26)

After

transition1: a·x+b = 86

Conditions: none

Add the same offset before reducing modulo n.

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





S005 · impliesBefore

reduce 86 modulo 6

After

86=14·6+2

Conditions: none

The integer identity together with0≤remainder<n determines the next state.

Step identifiers and dependenciesRule: euclidean_remainder · Uses: G001, S004





S006 · calculationBefore

transition2: a·x := mul(12, 2)

After

transition2: a·x = 24

Conditions: none

Multiply the original coefficient by the current state;do not clip negative values to0.

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





S007 · calculationBefore

transition2: a·x+b := sum(24, 26)

After

transition2: a·x+b = 50

Conditions: none

Add the same offset before reducing modulo n.

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





S008 · impliesBefore

reduce 50 modulo 6

After

50=8·6+2

Conditions: none

The integer identity together with0≤remainder<n determines the next state.

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





S009 · impliesBefore

computed transitions=2

After

orbit=[5, 2, 2]; number of entries=3

Conditions: none

Apply the same T to the preceding result; k transitions give k+1 states.

Step identifiers and dependenciesRule: orbit_prefix_length · Uses: G001, S008





S010 · impliesBefore

a finite requested prefix

After

no unrequested least-period claim

Conditions: none

This output is the requested prefix;it is not an unverified least-period proof from a few orbit values.

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









## Reverse checks


- S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S007 · premise_and_result_audit — Recompute transition2: a·x+b with exact rational arithmetic, not rounded decimals.
- S006 · premise_and_result_audit — Recompute transition2: a·x with exact rational arithmetic, not rounded decimals.
- S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S004 · premise_and_result_audit — Recompute transition1: a·x+b with exact rational arithmetic, not rounded decimals.
- S003 · premise_and_result_audit — Recompute transition1: a·x 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

(6, 12, 26, 5, 2, [5, 2, 2])

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: 2986c75af15b51babe3eee781ff0f401773965469430564b1ace2c985fd3f1a1
- candidate record SHA-256: 40bc311314853f00bc96c14afbeb094a75230f60f7efa8b4f4c626f738b79b5b
- semantic review receipt SHA-256: 340d74dcc6e37df6249594a0b79a9ee2af804337b7847478b3c1342af9722861
- question-first witness SHA-256: 9a06233d190d31a16f13fb03b6c3ceba4cbb748fff6c997941f66ab1888dcca8
- Lean: NOT_RUN · human review: NOT_PERFORMED

[Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261013-advance-20261020-r01-discrete-dynamical-system-0037.json)




