Skip to content

Erdős problem 402

Start work

Prove that, for any finite set A⊂NA\subset\mathbb{N}, there exist a,b∈Aa, b\in A such that gcd⁡(a,b)≤a/∣A∣. \gcd(a, b)\leq a/|A|.

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:6b76e6d74e20546979fa71417606acd165ae702dd1642a44a2edc406738e74cc
Metadata
sha256:57df0ccbb1dc62d6bc2911e3a3ac892bd2ed3ffa9a5a42d023d1ad51cb956b13
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:d3115336c2c972222a85396de9426e3253694b7dc03375721401399cf8d79f39
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON