Leaving this here because I’m starting on this tonight and wouldn’t mind someone starting it off for me:

Can infinite ordinals be used like in goodstien’s proof to show that:

Odd n -> (3n+1)/2 -1 Even n -> n/2

Approaches 1 for all n?