Characterizing the Set Elements in the Abstract Predecessor Tree

-- all are unique, thus avoiding loops

-- integer solution of eqn 2 for Tp(n)=n yields n=1, i=2, thus excluding a forest of trees

-- would like to determine the tree's contents (to see if all integers are present)

-- would like a description characterizing each set

-- use {dn+c} as the expression characterizing {Tp} subsets

-- {dn+c} is equivalent to Tp in { c[d] }

-- extensions are {8n+5}, i.e. the odd integers in {5[8]}

next slide             return to slide index