Erdős–Turán conjecture on largest prime factors of consecutive integers
Determine whether the asymptotic density of positive integers n satisfying P^+(n)<P^+(n+1) is equal to 1/2.
References
In the 1930s, Erdős and Turán [14] formulated the following conjecture in a correspondence.
One of Erdős and Turán's conjectures (see [22]) asserts that the asymptotic density of integers $n$ satisfying $P+(n)<P+(n+1)$ is 1/2.
In 1978, Erdős and Pomerance [4] observed that the patterns \begin{align*} P+(n-1)>P+(n)<P+(n+1),\ \text{or}\ P+(n-1)<P^+(n)>P+(n+1) \end{align*} and \begin{align*} P+(n-1)<P+(n)<P+(n+1) \end{align*} both occur infinitely often and conjectured that these two patterns occur for a positive density of $n$.
Unfortunately, it seems we cannot make $\delta$ independent of the choice of $u$. Thus we seem unable to obtain \begin{align*} \sum_{\substack{n\leq x\P+(n)>P+(n+1)<P+(n+2)<P+(n+3)}1\gg x. \end{align*}