C. Hercher

collaborators

3 papers

cs.FL2025

Castor Ministerialis

Christian Hercher

The famous problem of Busy Beavers can be stated as the question on how long a $n$ -state Turing machine (using a 2-symbol alphabet or -- in a generalization -- a $m$ -symbol alphabe…

math.NT2025

On one of ErdÅs' Problems -- An Efficient Search for Benelux Pairs

Christian Hercher

ErdÅs asked for positive integers $m < n$ , such that $m$ and $n$ have the same set of prime factors, $m + 1$ and $n + 1$ have the same set of prime factors, and $m + 2$ and $n + 2$ have the…

math.NT2025

On Positive Integers $n$ with $I ¨ (n) = \frac{2}{3} \cdot (n + 1)$

Christian Hercher

While solving a special case of a question of ErdÅs and Graham Steinerberger asks for all integers $n$ with $I ¨ (n) = \frac{2}{3} \cdot (n + 1)$ . He discovered the solutions $n\in\{5,…

Castor Ministerialis

On one of ErdÅs' Problems -- An Efficient Search for Benelux Pairs

On Positive Integers n with I¨(n)=32​⋅(n+1)

On one of ErdÅs' Problems -- An Efficient Search for Benelux Pairs

On Positive Integers $n$ with $I ¨ (n) = \frac{2}{3} \cdot (n + 1)$