Answers are grounded in this paper and cite their sources.
This paper analyzes the behavior of the greedy algorithm for the expansion of unit fractions of the form 3/k, where the denominator k belongs to the infinite family of composite numbers generated by the product of the form $(6x-1)(6y-1)$. The inefficiency of such an expansion is examined in comparison with shorter-length representations, linking the results to the OEIS A395997 sequence proposed by the author.
No takes yet. Share an insight, caveat, or question.
QUISPE et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: