Possible congruence speed in given numeration system

Read full text
Authors: Gabriele Di Pietro
Cited by: 0
References: 2

Abstract

This Python program, given a numeration system and an interval of bases, shows the possible congruence speed of each base by analyzing the first steps of tetration. Results such as 0 or "not determined" are related to undefined congruence speed. The adjective "possible" is used because the program analyses the first steps of tetration, and the congruence speed may not reach stability in this "first step". For a better result, it is useful to use this program in combination with this one: https://zenodo.org/records/18176959.

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
7 January 2026
Language
EN