On the smallest abundant number not divisible by the first k primes

MaRDI QIDQ558379zbMATH OpenFDO

Authors Douglas E. Iannucci

Publication date 5 July 2005

Published in Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.bbms/1113318127

zbMATH Keywords

arithmetical functions

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Rate of growth of arithmetic functions (11N56) Values of arithmetic functions; tables (11Y70)

Review text

A positive integer \(n\) is called abundant, if \(\sigma(n)>2n\), where \(\sigma(n)\) denotes the sum of the positive divisors of \(n\). The smallest odd abundant number is 945. Let \(p_1=2, p_2=3, p_3,p_4,\dots\) the primes in ascending order. The author denotes by \(A(k)\) the smallest abundant number not divisible by \(p_1,p_2,\dots,p_k\) and proves elementarily \[ (1-\varepsilon)(k\ln k)^{2-\varepsilon}<\ln A(k)<(1+ \varepsilon)(k \ln k)^{2+\varepsilon}, \] whenever \(k\) is sufficiently large and computes \(A(k)\) for \(1\leq k\leq 7\).

Recommendations

• On the distribution of primitive abundant numbers
• Über die Dichte abundanter Zahlen
• On the Density of the Abundant Numbers
• On Abundant-Like Numbers
• On Primitive Abundant Numbers

Cited in

(3)

• On the smallest number with a given number of divisors
• \(\mathscr {B}\)-free sets and dynamics
• scientific article; zbMATH DE number 1912095 (Why is no real title available?)

This page was built for publication: On the smallest abundant number not divisible by the first \(k\) primes

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