Highest perfect power of a product of integers less than $x$
\'Elie Goudout

TL;DR
This paper determines the asymptotic behavior of the highest perfect power obtainable from the product of a subset of integers less than x, revealing a precise exponential decay rate involving logarithmic factors.
Contribution
It establishes an exact asymptotic formula for the maximum perfect power from products of integers below x, a problem previously not precisely quantified.
Findings
Derived the asymptotic formula for w(x) involving exponential decay
Showed the dominant growth rate is governed by a specific logarithmic expression
Provided insights into the structure of products forming perfect powers
Abstract
For , we define as the highest integer for which there exist integers and such that . We show that \[w(x)=x\exp\big(-(\sqrt{2}+o(1))\sqrt{\log x\log\log x}\big).\]
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
