Skip to content

Erdős problem 677

Start work

Denote by M(n,k)M(n, k) the least common multiple of the finite set {n+1,…,n+k}\{n+1, \dotsc, n+k\}. Is it true that for all m≥n+km \geq n + k, we get M(m,k)≠M(n,k)M(m, k) \neq M(n, k)?

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:0f2fd4a2aaf8199f0e4a36c8f05569c6e62f4236a286e50cb62898b37a9675a1
Metadata
sha256:a9ffe8b0041a0b059feea025532ef05abe31b7cb7d2acae56233d2cff15a3e67
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:dd3f66406c1e9a3a409d8f7b7a30ee2bec0c385b60882def82c0c6fd4c082eaf
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON