Arithmetic properties of positive integers with fixed digit sum
The author proves 7 propositions about the set \(A_{b,s}\) of all positive integers \(n\) which are not multiples of \(b\) and whose sum of digits in base \(b\) is precisely \(s\). For instance: Proposition 2: Let \(P(n)\) be the largest prime factor of \(n\). Then for every \(\varepsilon > 0\) there exist infinitely many positive integers \(n\in A_{b,s}\) with \(P(n)< n^{\varepsilon}\); Propositions 4 and 5: There exist infinitely many positive integers \(n\in A_{b,s}\) for which \(\omega (n)>\exp(\frac{c_{5}\log_{2}n}{\log_{3}n})\) and \(\Omega(n)=o(\log n)\) where \(\omega (n) \) means as usually the number of distinct prime factors of \(n\) ; \(\Omega(n)\) - the same, but counting the multiplicity of the primes, \(c_{5}\) is a positive computable constant depending only on \(b\) and \(s\). The author proposes the following problem: Prove or disprove that \(\lim_{{n\rightarrow\infty} \atop{n\in A_{b,s}}} \frac{\omega(n)\log_{2}n}{\log n}=0\).
- On the number of prime factors of integers characterized by digit properties
- On the arithmetic structure of sets characterized by sum of digits properties
- Arithmetic properties of numbers with restricted digits
- On the arithmetic structure of the integers whose sum of digits is fixed
- On arithmetic properties of integers with missing digits. II: Prime factors
- Almost primes whose expansion in base \(r\) misses some digits
- Approximate formulas for some functions of prime numbers
- Arithmetic properties of numbers with restricted digits
- Diophantine approximations and diophantine equations
- Diophantine equations with power sums and universal Hilbert sets
- How smooth is (2ⁿ+3)?
- scientific article; zbMATH DE number 3534568 (Why is no real title available?)
- scientific article; zbMATH DE number 1182207 (Why is no real title available?)
- scientific article; zbMATH DE number 1985589 (Why is no real title available?)
- scientific article; zbMATH DE number 3064221 (Why is no real title available?)
- Logarithmic forms and group varieties.
- Méthodes de crible et fonctions sommes des chiffres
- On the arithmetic structure of sets characterized by sum of digits properties
- On the arithmetic structure of the integers whose sum of digits is fixed
- On the number of prime factors of integers characterized by digit properties
- On the representation of an integer in two different bases.
- p-adic logarithmic forms and group varieties II
- Petites valeurs de la fonction d'Euler
- Prime divisors of sparse integers
- PV-numbers and sets of multiplicity
- S-unit equations over number fields
- Sums of digits and almost primes
- The equations 2N 2M 2L=z^2
- The Number of Non-Zero Digits of n!
- Difference of the digital sums of an integer base b and its prime factors
- Positive integers divisible by the product of their nonzero digits
- \(S\)-parts of sums of terms of linear recurrence sequences
- Arithmetic properties of the integer part of the powers of an algebraic number
- scientific article; zbMATH DE number 4093549 (Why is no real title available?)
- scientific article; zbMATH DE number 40763 (Why is no real title available?)
- scientific article; zbMATH DE number 1180842 (Why is no real title available?)
- Arithmetic properties of numbers with restricted digits
- On a problem of Bednarek
- An algorithm for studying the digit sum of large integers
- On numbers divisible by the product of their nonzero base \(b\) digits
- Prescribing the binary digits of squarefree numbers and quadratic residues
- A REMARK ON PRIMALITY TESTING AND DECIMAL EXPANSIONS
- On the number of prime factors of integers characterized by digit properties
- On the \(g\)-ary expansions of Apéry, Motzkin, Schröder and other combinatorial numbers
- Means of Numbers with Fixed Hamming Weight
This page was built for publication: Arithmetic properties of positive integers with fixed digit sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879625)
