## Left Descent Assemblies are Sieving Elements

### -- recall Sieve of Eratosthenes to identify primes and composites

-- here we want to identify integers in the abstract predecessor tree
(hoping to find all present)

-- the *n* of *dn* + *c* gives the
instantiation of an l.d.a.

-- the headers of l.d.a.s sieve in the {8n+5} subset of integers

-- a (very large) file of l.d.a. element formulas was prepared, and works as far as it went

-- the sieve can be *a priori* (like Eratosthenes')

for each surviving odd number, IDit, sieve whole l.d.a. set, and repeat

next slide
return to slide index