paper

The equation

arXiv:1105.1621 · doi:10.1112/S0025579300014820

Abstract

We prove that there are infinitely many integers such that and have the same number of distinct prime divisors.

The result is no obsolete: Buttkewitz found a non-computational proof, and the Goldston-Pintz-Yildirim-sieve yields more precise information

The equation $ω(n)=ω(n+1)$ · wovepaper