A REMARK ON PRIMALITY TESTING AND DECIMAL EXPANSIONS
From MaRDI portal
Publication:5389479
DOI10.1017/S1446788712000043zbMath1251.11089arXiv0802.3361OpenAlexW2143683667WikidataQ59650213 ScholiaQ59650213MaRDI QIDQ5389479
Publication date: 20 April 2012
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.3361
Applications of sieve methods (11N36) Congruences; primitive roots; residue systems (11A07) Primality (11Y11)
Related Items (12)
On a problem of Romanoff type ⋮ Digitally delicate primes ⋮ Widely Digitally Stable Numbers ⋮ On the number of prime factors of the composite numbers resulting after a change of digits of primes ⋮ Unnamed Item ⋮ ALMOST ALL PRIMES HAVE A MULTIPLE OF SMALL HAMMING WEIGHT ⋮ Chen's conjecture and its generalization ⋮ On the number of distinct prime factors of \(nj+a^hk\) ⋮ Primes that become composite after changing an arbitrary digit ⋮ Squarefree polynomials with prescribed coefficients ⋮ On the integers of the form \(p+b\) ⋮ On integers \(2(p+ia)\) not of the form \(a^k+\varphi (m)\)
Cites Work
- Unnamed Item
- On a problem of Gelfond: the sum of digits of prime numbers
- Integers represented as a sum of primes and powers of two.
- Subset sum ``cubes and the complexity of primality testing
- On the sum of a prime and of two powers of two
- Primes with preassigned digits
- Fermat numbers and integers of the form ak+al+pα
- Is the Euclidean Algorithm Optimal Among its Peers?
- Integers not of the form c(2a+2b)+pα
- On integers not of the form ±𝑝^{𝑎}±𝑞^{𝑏}
- On the integers not of the form p+2a+2b
- A lower bound for primality
This page was built for publication: A REMARK ON PRIMALITY TESTING AND DECIMAL EXPANSIONS