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 aiAa_i\in A, where a1,,ara_1,\ldots,a_r are distinct.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6c38c273248b961dc984097f9225f1130e2a30fb2c7b713956d54b36388db9bd
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page