activity
20232026
most citedOn eventually greedy best underapproximations by Egyptian fractions

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

collaborators
Showing math.NTShow all

5 papers · 1 filter

math.NT2026

Eventually greedy best Egyptian underapproximations of rational numbers via optimal control

Vjekoslav Kovač, Quanyu Tang

We prove that every positive rational number has eventually greedy best Egyptian underapproximations, both when repetitions of the denominators are allowed and when the denominator…

math.NT2026

Irrationality of rapidly converging series: a problem of Erdős and Graham

Kevin Barreto, Jiwon Kang, Sang-hyun Kim +2

Answering a question of Erdős and Graham, we show that the double exponential growth condition for a strictly increasing sequence of positi…

math.NT2025

Lacunary sequences whose reciprocal sums represent all rational numbers in an interval

Wouter van Doorn, Vjekoslav Kovač

Disproving a conjecture of Bleicher and Erdős, we show that there exists a lacunary sequence of positive integers such that finite sums of reciprocals of its terms attain all ratio…

math.NT2024★ 2 cited

On eventually greedy best underapproximations by Egyptian fractions

Vjekoslav Kovač

Erdős and Graham found it conceivable that the best -term Egyptian underapproximation of almost every positive number for sufficiently large gets constructed in a greedy man…

math.NT2024★ 2 cited

On the set of points represented by harmonic subseries

Vjekoslav Kovač

We help Alice play a certain "convergence game" against Bob and win the prize, which is a constructive solution to a problem by Erdős and Graham, posed in their 1980 book on open q…