Prescribing the binary digits of primes
From MaRDI portal
Publication:1955791
DOI10.1007/s11856-012-0104-2zbMath1309.11065OpenAlexW2042041813MaRDI QIDQ1955791
Publication date: 18 June 2013
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-012-0104-2
Related Items (15)
Pseudorandom sequences derived from automatic sequences ⋮ PROPRIÉTÉS LOCALES DES CHIFFRES DES NOMBRES PREMIERS ⋮ Weight of irreducible polynomials with coefficients in a finite field ⋮ Dirichlet, Sierpiński, and Benford ⋮ On the exponential large sieve inequality for sparse sequences modulo primes ⋮ Analytic number theory. Abstracts from the workshop held November 6--12, 2022 ⋮ Reversible primes ⋮ Character sums over sparse elements of finite fields ⋮ Prescribing the binary digits of squarefree numbers and quadratic residues ⋮ On numbers divisible by the product of their nonzero base b digits ⋮ On the distribution of the Rudin-Shapiro function for finite fields ⋮ Prescribing digits in finite fields ⋮ Monotone Boolean functions capture their primes ⋮ Prime numbers in two bases ⋮ Prescribing the binary digits of primes. II
Cites Work
This page was built for publication: Prescribing the binary digits of primes