Highest perfect power of a product of integers less than x

DOI10.1142/S1793042118501233MaRDI QIDQ3177705zbMATH OpenWikidataFDO

Authors Élie Goudout

Publication date 1 August 2018

Published in International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.08731

zbMATH Keywords

perfect powersfriable numbers

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Rate of growth of arithmetic functions (11N56)

Abstract: For $xgeq3$, we define $w(x)$ as the highest integer $w$ for which there exist integers $m,ygeq1$ and $1leq{n}_1<dots<n_{m}leqx$ such that $n_{1}cdots{n}_m=y^w$. We show that [w(x)=xexp�ig(-(sqrt{2}+o(1))sqrt{log xloglog x}�ig).]

Recommendations

• Products of distinct integers being high powers
• Perfect powers in products of integers from a block of consecutive integers
• Counting the perfect powers
• Products of disjoint blocks of integers being high powers
• Perfect powers including duplications

Cites work

• Products of distinct integers being high powers

Cited in

(2)

• Integers with dense divisors. II
• Products of distinct integers being high powers

This page was built for publication: Highest perfect power of a product of integers less than \(x\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177705)