Twin prime problem is well known in number theory. Sieve methods can only give almost primes because of the parity phenomenon. By the switching principle and an inequality of Ng type we prove a lower bound of the expected magnitude order for primes p such that p+2 has 2 or 3 prime factors and conditions on the largest and the least prime factor.
p+2 with few and bounded prime factors
SALERNO, Saverio;VITOLO, Antonio
1991-01-01
Abstract
Twin prime problem is well known in number theory. Sieve methods can only give almost primes because of the parity phenomenon. By the switching principle and an inequality of Ng type we prove a lower bound of the expected magnitude order for primes p such that p+2 has 2 or 3 prime factors and conditions on the largest and the least prime factor.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
