p. 472 — precisely two fixed seeds
ProvedCarryRNG.SWB.fixed_iff_trivialp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-number-generationsubtract-with-borrow
Fix and lags . A Method 1 state is unchanged by one subtract-with-borrow step if and only if it is one of the two trivial seeds:
This identifies the two period-one exceptions to the order-of-base claim.
Preamble
import Definitions.Def_CarryRNG_SWB_step import Definitions.Def_CarryRNG_AWC_zeroSeed import Definitions.Def_CarryRNG_AWC_topSeed
Formal statement
namespace CarryRNG.SWB
/-- Page 472: Method 1 has precisely the two stated fixed seeds. -/
theorem fixed_iff_trivial (b : ℕ) (L : CarryRNG.AWC.Lags) (hb : 2 ≤ b) (z : CarryRNG.AWC.State b L.r) :
step b L hb z = z ↔ z = CarryRNG.AWC.zeroSeed b L.r hb ∨ z = CarryRNG.AWC.topSeed b L.r hb := by sorry
end CarryRNG.SWB
Source
G. Marsaglia and A. Zaman, A new class of random number generators, Ann. Appl. Probab. 1 (1991), p. 472, Section 4.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.