Explaination: Bijective rational bases replace 0 with a digit representing the value of the base. This allows every positive integer to be represented without using 0. For bijective irrational bases, a single replacement digit isn’t enough. Different strings of zeros can have different whole-number values, so each zero-string that represents a whole number gets its own digit. For example, in bijective sqrootian binary: 10 ≈ 1.41 → 0 is replaced by / 100 = 2 → 00 is replaced by 2 This allows us to remove zeros while still representing the numbers available in the regular irrational base. (But it may cause duplicate representations from time to time) next base will be related to three
@RodolfoYT12345 @Number17_guy @sAunokarreem1234 @BaseBands @7ty8lx @sb71376 @LJmonster13 @Igorhenrique123456 c2a
