Prescribing the binary digits of primes. II

From MaRDI portal
Publication:2339608

DOI10.1007/s11856-014-1129-5zbMath1310.11097arXiv1105.3895OpenAlexW4242494653MaRDI QIDQ2339608

Jean Bourgain

Publication date: 2 April 2015

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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




Related Items (27)

Digits of primesOn the Fourier-Walsh spectrum of the Moebius function. IIPseudorandom sequences derived from automatic sequencesPROPRIÉTÉS LOCALES DES CHIFFRES DES NOMBRES PREMIERSWeight of irreducible polynomials with coefficients in a finite fieldDirichlet, Sierpiński, and BenfordOn the exponential large sieve inequality for sparse sequences modulo primesPrimes with restricted digitsThe truncated sum-of-digits function of powersOn the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficientsAnalytic number theory. Abstracts from the workshop held November 6--12, 2022The work of James MaynardMissing digits and good approximationsReversible primesCharacter sums over sparse elements of finite fieldsPrescribing the binary digits of squarefree numbers and quadratic residuesIrreducible polynomials with several prescribed coefficientsThe Thue-Morse and Rudin-Shapiro sequences at primes in principal number fieldsOn numbers divisible by the product of their nonzero base b digitsArithmetic Properties of Integers in Chains and Reflections of g-ary ExpansionsSquarefree polynomials with prescribed coefficientsOn the distribution of the Rudin-Shapiro function for finite fieldsPrescribing digits in finite fieldsOn the digital representation of integers with bounded prime factorsA new proof of the Hansen-Mullen irreducibility conjecturePrime numbers in two basesThe ternary Goldbach problem with two Piatetski–Shapiro primes and a prime with a missing digit



Cites Work


This page was built for publication: Prescribing the binary digits of primes. II