A. Leonardis

most citedThe notion of "Unimaginable Numbers" in computational number theory

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing math.NTShow all

1 paper · 1 filter

math.NT2019

Hybrid Continued Fractions and $n$ -adic algorithms, with applications to cryptography and "unimaginable' numbers

Antonino Leonardis

This paper continues the author's previous studies on continued fractions and Heron's algorithm, as from his former JMM2017 presentation (see \cite{CF.HA}).\par\medskip Extending t…

Hybrid Continued Fractions and n-adic algorithms, with applications to cryptography and "unimaginable' numbers

Hybrid Continued Fractions and $n$ -adic algorithms, with applications to cryptography and "unimaginable' numbers