Skip to content

Erdős problem 487

Start work

Let A⊆NA\subseteq \mathbb{N} have positive density. Must there exist distinct a,b,c∈Aa,b,c\in A such that [a,b]=c[a,b]=c (where [a,b][a,b] is the least common multiple of aa and bb)?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:c703a9c96f786a4f3f301eef5a698e3e644066109890257d6f4002effda66dfe
Metadata
sha256:183e809bc6c74464b961bdf324605a5ae3aa03d3d7e5bb1e694d9610eca732a1
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:9563eb3e94e5ed5f43503b928e8ad4de30f2476ff66cfa91d6c93969ad876337
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON