8 citations · 10 across the 4 of their papers we have counts for
4 papers
Complexity of natural numbers and arithmetic compact sets
Juan Arias de Reyna
The complexity of a natural number is the least number of needed to represent using the 5 symbols . A natural number is called stable is $…
Algorithms for determining integer complexity
J. Arias de Reyna, J. van de Lune
We present three algorithms to compute the complexity of all natural numbers . The first of them is a brute force algorithm, computing all these complexitie…
"How many 's are needed?" revisited
J. Arias de Reyna, J. van de Lune
We present a rigorous and relatively fast method for the computation of the "complexity" of a natural number (sequence A005245), and answer some "old and new" questions related to…
On the distribution (mod 1) of the normalized zeros of the Riemann Zeta-function
Juan Arias de Reyna
We consider the problem whether the ordinates of the non-trivial zeros of are uniformly distributed modulo the Gram points, or equivalently, if the normalized zeros …