Skip to content

Erdős problem 488

Let AA be a finite set and B={n≥1:a∣n for some a∈A}.B=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}. Is it true that, for every m>n≥max⁡(A)m>n\geq \max(A), ∣B∩[1,m]∣m<2∣B∩[1,n]∣n?\frac{\lvert B\cap [1,m]\rvert }{m}< 2\frac{\lvert B\cap [1,n]\rvert}{n}?

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:cb6986ab4996f0f858f2c2ee856d68ab0766b8be5fc80fb8b18880f4ba56a13f
Metadata
sha256:feb11464277dcc4f6a47650671882f3bc71cafe2ebb8a97ecc2df5e789da748d
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:5d82ea8f71fbfaa9cd58e9c657fa5e18db10276cd917aa4500749da9130f11ea
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb