Skip to content

Erdős problem 370

Are there infinitely many nn such that the largest prime factor of nn is <n12< n^{\frac{1}{2}} and the largest prime factor of n+1n + 1 is <(n+1)12< (n + 1)^{\frac{1}{2}}.

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:d020f2b08cec9dc7b82561ab651e36737e698d1464e948879716cdec14667f93
Metadata
sha256:878c3039e272f2fe6b3aad07b7cd5ffe5e9691f13e3c8c7b60e92d33af405f26
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6b79ee6e298605a0ae17545ff11d7957628a8b12d7b0d852a3da5c3e14374aac
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page