Skip to content

Erdős problem 402

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|.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:d3115336c2c972222a85396de9426e3253694b7dc03375721401399cf8d79f39
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page