Skip to content

Erdős Problem 535 #776

@mo271

Description

@mo271

What is the conjecture

https://www.erdosproblems.com/535

Let $r\geq 3$, and let $f_r(N)$ denote the size of the largest subset of $\{1,\ldots,N\}$ such that no subset of size $r$ has the same pairwise greatest common divisor between all elements. Estimate $f_r(N)$.

Status: open

Choose either option

  • I plan on working on this conjecture
  • This issue is up for grabs: I would like to see this conjecture added by somebody else

Metadata

Metadata

Assignees

No one assigned

    Labels

    Type

    No type

    Projects

    No projects

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions