Six fundamental equations for the constant congruence speed in any numeral system
Description
One-page note summarizing six central equations describing the constant congruence speed of integer tetration bases in arbitrary numeral systems $r > 1$. These formulas compactly condense the fundamental results established in the referenced works, including the complete characterization for prime radices, the explicit cases $r =6$ and $r = 10$, and several general constructions valid for all squarefree $r > 2$. The note serves as a concise reference for the main properties and behaviors of (constant) congruence speed across different numeral systems.
Files
Six fundamental equations for the constant congruence speed in any numeral system [FINAL].pdf
Files
(326.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:18fd33ff8b6fcb937803e532fa00db71
|
326.7 kB | Preview Download |
Additional details
Related works
- References
- Preprint: 10.5281/zenodo.17744007 (DOI)
- Journal article: 10.7546/nntdm.2022.28.3.441-457 (DOI)
Dates
- Available
-
2025-12-01