activity
20222026
most citedNumber of stable digits of any integer tetration

21 citations · 40 across the 14 of their papers we have counts for

collaborators
Showing math.GMShow all

7 papers · 1 filter

math.GM2026

On the relation between perfect powers and tetration frozen digits

Marco Ripà

This paper provides a link between integer exponentiation and integer tetration since it is devoted to introducing some peculiar sets of perfect powers characterized by any given v…

math.GM2024

Graham's number stable digits: An exact solution

Marco Ripà

In the decimal numeral system, we prove that the well-known Graham's number, (i.e., ( times)), and any base tetration who…

math.GM2024

Euclidean Tours in Fairy Chess

Gabriele Di Pietro, Marco Ripà

The present paper aims to extend the knight's tour problem for -dimensional grids of the form to other fairy chess leapers. Accordingly, we constructively show the e…

math.GM2024★ 2 cited

Solving the years old points problem with the clockwise-algorithm

Marco Ripà

In this paper, we present the clockwise-algorithm that solves the extension in -dimensions of the infamous nine-dot problem, the well-known two-dimensional thinking outside the…

math.GM2022★ 21 cited

Number of stable digits of any integer tetration

Marco Ripà, Luca Onnis

In the present paper we provide a formula that allows to compute the number of stable digits of any integer tetration base . The number of stable digits, at the g…

math.GM2022

Minimum-Link Covering Trails for any Hypercubic Lattice

Marco Ripà

In 1994, Kranakis et al. published a conjecture about the minimum link-length of every rectilinear covering path for the -dimensional grid $P(n,k) := \{0,1, \dots, n-1\} \times…

math.GM2022

On some open problems concerning perfect powers

Marco Ripà

The starting point of our paper is Kashihara's open problem number , concerning the sequence of the OEIS, asking how many terms are powers of integers. We confirm his…