>>12256177It’s the answer to a recursive question.
This is a kek:
[ ]
This is nine of them:
[ ][ ][ ][ ][ ][ ][ ][ ][ ]
How many times can you fit nine keks into a kek?
None. Ok 0.
What if you divide it into 10 minikeks?
[ ][ ][ ][ ][ ][ ][ ][ ][ ][ ]
[ ][ ][ ][ ][ ][ ][ ][ ][ ]
9 minikeks fit in there 1 time. We’ll move over a decimal place to keep track of how it was smaller pieces. 0.1
But there’s still one minikek left over.
[ ]
What if you divide the minikek into a micro kek?
[ ][ ][ ][ ][ ][ ][ ][ ][ ][ ]
[ ][ ][ ][ ][ ][ ][ ][ ][ ]
Nine micro keks fit into a micro kek 1 time.
But there’s still one microkek.
What if you break it up into 10 nanokeks...
A decimal is a recursive “do while” loop that never terminates until the keks perfectly fit inside. But we can see from observing it that it can never break the pattern of having 1 left over and fitting 1 time. So if 0.111... is an abstraction we can use to say the answer to the question.