Christian Hercher

collaborators

3 papers

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 $ϕ (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 $ϕ (n) = \frac{2}{3} \cdot (n + 1)$ . He discovered the solutions $n\in\{5, 5…

math.NT2024

On the Sum of Squarefree Integers and a Power of Two

Christian Hercher

Erdos conjectured that every odd number greater than one can be expressed as the sum of a squarefree number and a power of two. Subsequently, Odlyzko and McCranie provided numerica…

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

On Positive Integers n with ϕ(n)=32​⋅(n+1)

On the Sum of Squarefree Integers and a Power of Two

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