Then the condition is: [ N = [S(N)]^,L(N) ]
| ( N ) | Digits (base 10) | Sum of digits ( S ) | ( L ) | ( S^L = N ) | |--------|----------------|----------------------|--------|---------------| | 81 | 8,1 | 9 | 2 | 9^2 = 81 | | 512 | 5,1,2 | 8 | 3 | 8^3 = 512 | | 2401 | 2,4,0,1 | 7 | 4 | 7^4 = 2401 | Badulla Badu Numbers--------
This article provides the most comprehensive public examination of Badulla Badu Numbers to date — exploring their possible origins, mathematical properties, cultural significance, and why they might matter to modern data science, cryptography, and folk arithmetic. Then the condition is: [ N = [S(N)]^,L(N)
We are stuck at 2? That's a fixed point, not a pair. A true Badulla Badu pair requires oscillation. So perhaps N=37 yields a trivial fixed point, not a "Badu pair." A true Badulla Badu Number only emerges when the iteration produces a two-cycle like 3,5 or 2,4. A true Badulla Badu pair requires oscillation
But cryptographically, could be used as initialization vectors in block ciphers because their reverse-add property ensures a symmetric diffusion layer.
Badulla Badu Numbers may be a mathematical in-joke, a phantom sequence, or a clue to a deeper pattern yet undiscovered. Whether they are real or not, they remind us that the joy of numbers often lies not in their existence, but in the hunt.
We need ( N = S^L ), where ( L = \lfloor \log_b N \rfloor + 1 ), and ( S ) is digit sum.