Skip to content

Erdős problem 889

Let v(n,k)v(n,k) count the prime factors of n+kn+k which do not divide n+in+i for 0i<k0\leq i < k. Is it true that v0(n)=maxk0v(n,k)v_0(n)=\max_{k\geq 0}v(n,k)\to \infty as nn\to \infty?

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:4096a2ba78dc75089d5d559ba395cab538fed4664c815e3ef048e580b4eddd0d
Metadata
sha256:f3963a273c29edf4c703fe034ecf6145433ec59f4e6e46499645b83739947480
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:ebfb2593920fd84f3b5b8bc8b00bc79b55952c98bc08bcef449d40f93c0c3009
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page