Explore related knowledge and questions →

Question 1555: A Fixed-Length Discrete Orbit Prefix

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 8

← Question derivation index · Original question batch

R0002-01555 · q-20261013-advance-20261020-r01-discrete-dynamical-system-0030

Original question and givens

Use the complete finite self-map on Fin(9)={0,…,8} given by T(x)=(a*x+b) mod 9, a=5, b=5. 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=4, updates=4. 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(9)={0,…,8} given by T(x)=(a*x+b) mod 9, a=5, b=5. 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=4, updates=4. 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.

Step-by-step derivation

S001 · implies

Before

X={0 through 8}; T(x)=(5x+(5)) mod 9

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 dependencies

Rule: finite_total_map · Uses: G001

S002 · implies

Before

x₀=4; transitions=4

After

initial orbit prefix=[4]

Conditions: none

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

Step identifiers and dependencies

Rule: orbit_initial_state · Uses: G001, S001

S003 · calculation

Before

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

After

transition1: a·x = 20

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · calculation

Before

transition1: a·x+b := sum(20, 5)

After

transition1: a·x+b = 25

Conditions: none

Add the same offset before reducing modulo n.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · implies

Before

reduce 25 modulo 9

After

25=2·9+7

Conditions: none

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

Step identifiers and dependencies

Rule: euclidean_remainder · Uses: G001, S004

S006 · calculation

Before

transition2: a·x := mul(5, 7)

After

transition2: a·x = 35

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · calculation

Before

transition2: a·x+b := sum(35, 5)

After

transition2: a·x+b = 40

Conditions: none

Add the same offset before reducing modulo n.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S006

S008 · implies

Before

reduce 40 modulo 9

After

40=4·9+4

Conditions: none

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

Step identifiers and dependencies

Rule: euclidean_remainder · Uses: G001, S007

S009 · calculation

Before

transition3: a·x := mul(5, 4)

After

transition3: a·x = 20

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · calculation

Before

transition3: a·x+b := sum(20, 5)

After

transition3: a·x+b = 25

Conditions: none

Add the same offset before reducing modulo n.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S009

S011 · implies

Before

reduce 25 modulo 9

After

25=2·9+7

Conditions: none

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

Step identifiers and dependencies

Rule: euclidean_remainder · Uses: G001, S010

S012 · calculation

Before

transition4: a·x := mul(5, 7)

After

transition4: a·x = 35

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · calculation

Before

transition4: a·x+b := sum(35, 5)

After

transition4: a·x+b = 40

Conditions: none

Add the same offset before reducing modulo n.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S012

S014 · implies

Before

reduce 40 modulo 9

After

40=4·9+4

Conditions: none

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

Step identifiers and dependencies

Rule: euclidean_remainder · Uses: G001, S013

S015 · implies

Before

computed transitions=4

After

orbit=[4, 7, 4, 7, 4]; number of entries=5

Conditions: none

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

Step identifiers and dependencies

Rule: orbit_prefix_length · Uses: G001, S014

S016 · implies

Before

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 dependencies

Rule: finite_prefix_scope · Uses: G001, S015

Reverse checks

  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S013 · premise_and_result_audit — Recompute transition4: a·x+b with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Recompute transition4: a·x with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S010 · premise_and_result_audit — Recompute transition3: a·x+b with exact rational arithmetic, not rounded decimals.
  • S009 · premise_and_result_audit — Recompute transition3: a·x with exact rational arithmetic, not rounded decimals.
  • 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

(9, 5, 5, 4, 4, [4, 7, 4, 7, 4])

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: c3c5279f5c3763c2ccd50ff02517b61e202ae891751f18af18e79eadff9fea02
  • candidate record SHA-256: 8233a23d98bf306def509876d32cbfb758a86576249437bae71622c34a63065c
  • semantic review receipt SHA-256: 340d74dcc6e37df6249594a0b79a9ee2af804337b7847478b3c1342af9722861
  • question-first witness SHA-256: 9a06233d190d31a16f13fb03b6c3ceba4cbb748fff6c997941f66ab1888dcca8
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON