Year: 2025
Type: preprint
Abstract: We study solutions to the Egyptian fractions equation with the prime factors of the denominators constrained to lie in a fixed set of primes. We evaluate the effectiveness of the greedy algorithm in establishing bounds on such solutions. Additionally, we present improved algorithms for generating low-rank solutions and solutions restricted to specific prime sets. Computational results obtained using these algorithms are provided, alongside a discussion on their performance.
Source: arXiv (Cornell University)
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4415345116
Cites:
Cited by:
Related to: