Skip to content

Erdős problem 889

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ebfb2593920fd84f3b5b8bc8b00bc79b55952c98bc08bcef449d40f93c0c3009
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON