On Almost Primes
From MaRDI portal
Unter Fastprimzahlen versteht der Verf. zusammengesetzte natürliche Zahlen \(n\) mit \(2^n \equiv 2\; \text{mod n}\). Er beweist folgenden Satz: Für hinreichend große \(x\) erfüllt die Anzahl \(f(x)\) aller ungeraden Fastprimzahlen \(\leq x\) die Ungleichung: \[ f(x)\leq x \exp \{ (- \log^{1 \over 2} x)/3\}. \] Gerade Fastprimzahlen scheinen sehr selten zu sein. Nach einer Mitteilung von D. H. Lehmer gibt der Verf. die Zahl \(n = 161038 = 2 \cdot 73 \cdot 1103\).
Recommendations
Cited in
(12)- Recent developments in primality testing
- An analog of the generalized Hardy-Littlewood problem with almost prime numbers
- On a class of primality criteria
- Almost primes whose expansion in base \(r\) misses some digits
- Almost all primes satisfy the Atkin-Serre conjecture and are not extremal
- Higher Mertens constants for almost primes
- On almost prime \(k\)-tuples
- On pseudoprimes having special forms and a solution of K. Szymiczek's problem
- Some Pseudoprimes and Related Numbers Having Special Forms
- scientific article; zbMATH DE number 1985579 (Why is no real title available?)
- scientific article; zbMATH DE number 778469 (Why is no real title available?)
- On a degree of primality
This page was built for publication: On Almost Primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5797119)