
Comment: The result is no obsolete: Buttkewitz found a non-computational proof, and the Goldston-Pintz-Yildirim-sieve yields more precise information
We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.
11N37, number of distinct prime factors, Mathematics - Number Theory, Asymptotic results on arithmetic functions
11N37, number of distinct prime factors, Mathematics - Number Theory, Asymptotic results on arithmetic functions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
