Original question and givens
Use the complete finite self-map on Fin(8)={0,…,7}, T(x)=(a*x+b) mod 8, a=0, b=-5. Take least nonnegative residues even for negative a*x+b. Fixed points, return times and least positive periods are different notions; the conclusion concerns this finite model only. x=3, proposed positive return time p=4. Give (modulus,a,b,x,p,T^p(x),returns to x?,least positive period or null if x is not periodic,is the least period exactly p?).
G001 — Use the complete finite self-map on Fin(8)={0,…,7}, T(x)=(a*x+b) mod 8, a=0, b=-5. Take least nonnegative residues even for negative a*x+b. Fixed points, return times and least positive periods are different notions; the conclusion concerns this finite model only. x=3, proposed positive return time p=4. Give (modulus,a,b,x,p,T^p(x),returns to x?,least positive period or null if x is not periodic,is the least period exactly p?).
Step-by-step derivation
S001 · implies
Before
n=8; a=0; b=-5
After
S={0,...,7}; T(z)=(a·z+b) mod nConditions: none
Remainders lie in0,...,n−1,so every state has one successor in the same finite set;negative dividends do not produce negative canonical remainders.
Step identifiers and dependencies
Rule: finite_self_map · Uses: G001
S002 · implies
Before
start=3
After
record each state before its first successor calculation
Conditions: none
Start with the specified point itself,not its first successor.
Step identifiers and dependencies
Rule: orbit_initial_state · Uses: G001, S001
S003 · calculation
Before
least period step1 product := mul(0, 3)
After
least period step1 product = 0
Conditions: none
Multiply the current state by the original coefficient a,retaining its sign.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
least period step1 affine value := sum(0, -5)
After
least period step1 affine value = -5
Conditions: none
Then add the original constant b;this integer is not yet the canonical state.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · implies
Before
Euclidean division of -5 by 8
After
-5=-1·8+3
Conditions: none
Check the transition using quotient and nonnegative remainder;n>0 and0≤remainder<n ensure uniqueness.
Step identifiers and dependencies
Rule: orbit_successor · Uses: G001, S004
S006 · implies
Before
distinct trace=[3]; first repeated state=3
After
cycle_start=0; starting-point least period=1
Conditions: none
The first repeated state locates the cycle entry.If it is the initial point,the preceding states are distinct,so the first return is the least positive period.If entry is later,the initial point lies outside the cycle and never returns.
Step identifiers and dependencies
Rule: finite_orbit_certificate · Uses: G001, S005
S007 · calculation
Before
return audit1 product := mul(0, 3)
After
return audit1 product = 0
Conditions: none
Multiply the current state by the original coefficient a,retaining its sign.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
return audit1 affine value := sum(0, -5)
After
return audit1 affine value = -5
Conditions: none
Then add the original constant b;this integer is not yet the canonical state.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · implies
Before
Euclidean division of -5 by 8
After
-5=-1·8+3
Conditions: none
Check the transition using quotient and nonnegative remainder;n>0 and0≤remainder<n ensure uniqueness.
Step identifiers and dependencies
Rule: orbit_successor · Uses: G001, S008
S010 · calculation
Before
return audit2 product := mul(0, 3)
After
return audit2 product = 0
Conditions: none
Multiply the current state by the original coefficient a,retaining its sign.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
return audit2 affine value := sum(0, -5)
After
return audit2 affine value = -5
Conditions: none
Then add the original constant b;this integer is not yet the canonical state.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · implies
Before
Euclidean division of -5 by 8
After
-5=-1·8+3
Conditions: none
Check the transition using quotient and nonnegative remainder;n>0 and0≤remainder<n ensure uniqueness.
Step identifiers and dependencies
Rule: orbit_successor · Uses: G001, S011
S013 · calculation
Before
return audit3 product := mul(0, 3)
After
return audit3 product = 0
Conditions: none
Multiply the current state by the original coefficient a,retaining its sign.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · calculation
Before
return audit3 affine value := sum(0, -5)
After
return audit3 affine value = -5
Conditions: none
Then add the original constant b;this integer is not yet the canonical state.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S013
S015 · implies
Before
Euclidean division of -5 by 8
After
-5=-1·8+3
Conditions: none
Check the transition using quotient and nonnegative remainder;n>0 and0≤remainder<n ensure uniqueness.
Step identifiers and dependencies
Rule: orbit_successor · Uses: G001, S014
S016 · calculation
Before
return audit4 product := mul(0, 3)
After
return audit4 product = 0
Conditions: none
Multiply the current state by the original coefficient a,retaining its sign.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S015
S017 · calculation
Before
return audit4 affine value := sum(0, -5)
After
return audit4 affine value = -5
Conditions: none
Then add the original constant b;this integer is not yet the canonical state.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S016
S018 · implies
Before
Euclidean division of -5 by 8
After
-5=-1·8+3
Conditions: none
Check the transition using quotient and nonnegative remainder;n>0 and0≤remainder<n ensure uniqueness.
Step identifiers and dependencies
Rule: orbit_successor · Uses: G001, S017
S019 · implies
Before
T^4(3)=3; least period=1
After
returns=Yes; period exactly p=No
Conditions: none
T^p(x)=x records a return.If the least positive period is d,return times are positive multiples of d;not every return time p is the least period.
Step identifiers and dependencies
Rule: return_vs_least_period · Uses: G001, S018