Registry · Definition I.D19d established formalized

I.D19d — Greedy Peel Algorithm

Greedy peel-off: (1) find A = largest prime dividing X, (2) find C = maximal tetration height, (3) find B = maximal exponent, (4) D = remainder. Deterministic and terminating.

Book I Part 4 Ch. 17

Dependency Graph

Depends on (2)

I.D19c I.T09

Depended on by (3)

I.D16 I.D23 I.L04

Lean Formalization

Module: TauLib.BookI.Coordinates.TowerAtoms

Symbol: Tau.Coordinates.greedy_peel