In googology Edit
In Greek-based number-naming systems, 21 is associated with prefix "henicosa-", and with prefix "unviginti-" in Latin systems.
It is equal to S(3) with the S function, a variant of the Busy beaver function. This means 21 is the maximum finite number of steps that can be performed using a 3-state, 2-color Turing machine.
Googological functions returning 21Edit
- weak Goodstein function: \(g(4)=21\).