Erdős problem 453 · problems.science

Is it true that, for all sufficiently large $n$ , there exists some $i<n$ such that $p_n^2 < p_{n+i}p_{n-i},$ where $p_k$ is the $k$ th prime?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:a5aadfc5fe5346d7776645b86b9ff9e3d6cb4190eb5f78b609ae0be263bf40a8
Metadata: sha256:ca75c7b341316a961427cfd524b9dcce4e917a1a5dde4487d914c5b81453b18c
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:6a7c414a70dbaf5a6a0c419d91249c81117f8e941d035f0c3bde397301cb3688

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207