✦ 5 frontiers

read-only vieweressays

erdős #186

← #185 · #187 → (packet.json; erdosproblems.com)

Let $F (N)$ be the maximal size of $A \subseteq {1, \dots, N}$ which is 'non-averaging', so that no $n \in A$ is the arithmetic mean of at least two elements in $A$ . What is the order of growth of $F (N)$ ?

Worked, still open.

additive combinatorics · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

oeis

A389784 — a(n) is the maximum size of a subset A of {1,...,n} such that no element in A is the average of a subset of A with cardinality at least 2.1,2,2,3,4,4,4,4,4,5,6,6,6,6,6,7,7,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,1

links

Create a formalisation here · link

status

solved

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub