Sums of digits and almost primes
This paper is devoted to the problem of existence of almost primes in sets of integers generated by finite automata (where words are identified with integers via their expansion in a base). It is proved that for every irreducible automaton there is a constant \(k\) such that the generated sequence contains infinitely many numbers having at most \(k\) prime factors. The sets defined by \(\{n:s(n) \equiv b \pmod q\}\), where \(s(n)\) is the sum of binary digits of \(n\), are particular cases, and these are investigated in detail. It is proved that these always contain infinitely many numbers (even \(\gg x/ \log x\) below \(x)\) with at most two prime factors. If \({\mathcal Q}\) is a set of residue classes modulo \(q\) and \(|{\mathcal Q} |\geq 0.722q\), then there are infinitely many primes \(p\) such that the residue of \(s(p)\) modulo \(q\) is in \({\mathcal Q}\). These results are achieved by proving (analytically) a statistical result on the joint distribution of \(n\) modulo \(d\) and \(s(n)\) modulo \(q\), analogous to the Bombieri-Vinogradov theorem on primes, and applying weighted sieve methods.
- A summation formula related to the binary digits
- Construction et Régularité des Fonctions d’Échelle
- Fonctions harmoniques pour un opérateur de transition et applications
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 1303746 (Why is no real title available?)
- On a Conjecture of Balog
- On an extremal property of the Rudin‐Shapiro sequence
- On the Barban-Davenport-Halberstam Theorem: Iii
- On the Distribution of αp; Modulo One
- On the Number of Binary Digits in a Multiple of Three
- Primes in short intervals
- Rosser's sieve
- Some Theorems on Fourier Coefficients
- Strongly mixing g-measures
- Sums and differences of quartic norms
- Sur les nombres qui ont des propriétés additives et multiplicatives données
- Sur un Theoreme Spectral et son Application aux Noyaux Lipchitziens
- The distribution of the sum of digits (\bmod𝑝)
- Théorie ergodique pour des classes d'opérations non completement continues
- Théorème de Brun-Titchmarsh; application au théorème de Fermat
- Topics in multiplicative number theory
- The sum of digits of primes in \(\mathbb Z[i]\)
- Euler, Pisot, Prouhet-Thue-Morse, Wallis and the duplication of sines
- On Gelfond's conjecture about the sum of digits of prime numbers
- Exponential sums and prime divisors of sparse integers
- Divisors of numbers with missing digits
- On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
- On arithmetic properties of integers with missing digits. II: Prime factors
- The Thue-Morse sequence
- Digits of primes
- Moments of a Thue-Morse generating function
- On evil Kronecker sequences and lacunary trigonometric products
- Prime divisors of sparse integers
- Almost primes whose expansion in base \(r\) misses some digits
- Two arithmetic applications of perturbations of composition operators
- The level of distribution of the sum-of-digits function of linear recurrence number systems
- Pseudorandom sequences derived from automatic sequences
- The Thue-Morse and Rudin-Shapiro sequences at primes in principal number fields
- \(L^\infty\)-estimation of generalized Thue-Morse trigonometric polynomials and ergodic maximization
- Polynomial values and generators with missing digits in finite fields
- Normality of the Thue-Morse sequence along Piatetski-Shapiro sequences. II
- Positive integers divisible by the product of their nonzero digits
- Numbers with fixed sum of digits in linear recurrent number systems
- Metric results on the discrepancy of sequences \((a_{n}{\alpha})_{n\geqslant 1}\) modulo one for integer sequences \((a_{n})_{n\geqslant 1}\) of polynomial growth
- The sum of digits function in finite fields
- Primes whose sum of digits is prime and metric number theory
- Piatetski-Shapiro sequences via Beatty sequences
- On sequences with prescribed metric discrepancy behavior
- Moser-Newman phenomenon for square-free numbers
- Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation
- On the digits of shifted primes
- scientific article; zbMATH DE number 2099178 (Why is no real title available?)
- On uniformity of \(q\)-multiplicative sequences
- The level of distribution of the Thue–Morse sequence
- scientific article; zbMATH DE number 6723393 (Why is no real title available?)
- Zero-density sets containing integers with at most two prime factors
- Computational fun with sturdy and flimsy numbers
- The level of distribution of the sum-of-digits function in arithmetic progressions
- Asymptotic behaviour of multiperiodic functions scaled by Pisot numbers.
- Prime numbers in two bases
- Waring's problem with digital restrictions
- Sums of digits of multiples of integers
- Arithmetic properties of positive integers with fixed digit sum
- On a problem of Gelfond: the sum of digits of prime numbers
- The study of collision and avalanche effect in a family of pseudorandom binary sequences
This page was built for publication: Sums of digits and almost primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923247)
