On the digital representation of smooth numbers

DOI10.1017/S0305004117000640MaRDI QIDQ4555845zbMATH OpenFDO

Authors Hajime Kaneko, Yann Bugeaud

Publication date 23 November 2018

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

smooth numbersbase \(b\)

Mathematics Subject Classification ID

Radix representation; digital problems (11A63)

Abstract: Let $bge2$ be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer which is not a multiple of $b$ cannot have simultaneously only few distinct prime factors and only few nonzero digits in its representation in base $b$.

Recommendations

• Smooth numbers: computational number theory and beyond
• scientific article; zbMATH DE number 849975
• Diophantine approximation with smooth numbers
• On the Zeckendorf representation of smooth numbers
• On the digital representation of integers with bounded prime factors
• Smoothing ‘smooth’ numbers
• Digital Representations Using the Greatest Integer Function
• 3-Smooth Representations of Integers
• SMOOTH NUMBERS IN SHORT INTERVALS
• An extension of the digital method based on \(b\)-adic integers

Cites work

• scientific article; zbMATH DE number 1305342 (Why is no real title available?)
• scientific article; zbMATH DE number 5679656 (Why is no real title available?)
• A result on the digits of aⁿ
• An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
• On the representation of Fibonacci and Lucas numbers in an integer base
• On the representation of an integer in two different bases.
• On two theorems of Gelfond and some of their applications
• P-adic logarithmic forms and group varieties III
• Perfect powers with few binary digits and related Diophantine problems, II
• S-unit points on analytic hypersurfaces

Cited in

(13)

• Products of integers with few nonzero digits
• NOTE ON FOURIER–STIELTJES COEFFICIENTS OF COIN-TOSSING MEASURES
• On the Zeckendorf representation of smooth numbers
• Smooth numbers with few nonzero binary digits
• On numbers divisible by the product of their nonzero base \(b\) digits
• On the digital representation of integers with bounded prime factors
• Computational fun with sturdy and flimsy numbers
• scientific article; zbMATH DE number 7674532 (Why is no real title available?)
• \(S\)-parts of sums of terms of linear recurrence sequences
• On the number of distinct prime factors of \(nj+a^hk\)
• Reversible primes
• Digital Representations Using the Greatest Integer Function
• Sums of a smooth number and a number with missing digits

This page was built for publication: On the digital representation of smooth numbers

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