Compute the minimum digits needed to represent N states in a chosen radix (e.g. 256 states need 2 hex digits).
例如 256 种状态在 16 进制下需 2 位。
| Item | Formula / Rule | Source / Standard |
|---|---|---|
| Digit count | Digits = ⌊logb(N)⌋ + 1 for N > 0 with radix b | ISO 80000-2:2019, Mathematical signs and symbols |
| Bit footprint | Bits needed = ⌈n × log2(b)⌉ | Knuth, TAOCP Vol. 2 §4.1 Positional Number Systems |
| Word alignment | Each digit of a 2k radix maps to exactly k binary bits | ISO/IEC 2382 Information technology vocabulary |