Skip to content

Erdős problem 650

Let f(m)f(m) be such that if A⊆{1,…,N}A\subseteq \{1,\ldots,N\} has ∣A∣=m\lvert A\rvert=m then every interval in [1,∞)[1,\infty) of length 2N2N contains ≥f(m)\geq f(m) many distinct integers b1,…,brb_1,\ldots,b_r where each bib_i is divisible by some ai∈Aa_i\in A, where a1,…,ara_1,\ldots,a_r are distinct.

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:f0fa42be2dec6972a81c4bb6f51e60f8519b97eccbef7b172bfaec567064caa0
Metadata
sha256:663b2862b47a4afefa34554404fa350fca1deec7c6d3b61eaf2634aa1b892f8b
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:6c38c273248b961dc984097f9225f1130e2a30fb2c7b713956d54b36388db9bd
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb