← All problems

Erdős Problem #319 — Minimal vanishing signed reciprocal sums

1 year old · traced to

For a positive integer NN, write [N]={1,…,N}[N]=\{1,\ldots,N\}. Define M(N)M(N) to be the largest cardinality of a set A⊆[N]A\subseteq[N] for which there is a sign assignment δ:A→{−1,1}\delta:A\to\{-1,1\} satisfying

∑n∈Aδ(n)n=0\sum_{n\in A}\frac{\delta(n)}{n}=0

and, for every nonempty proper subset A′⊊AA'\subsetneq A,

∑n∈A′δ(n)n≠0.\sum_{n\in A'}\frac{\delta(n)}{n}\ne 0.

What is M(N)M(N)? In particular, the condition requires the signed relation to vanish on all of AA but on no nonempty proper subset, using the signs assigned on AA. Erdős Problem #319

Background

Erdős and Graham posed the problem in their 1980 collection of problems in combinatorial number theory. It asks for a large relation among the reciprocals of distinct integers in [N][N] that is minimal with respect to retaining its terms and their assigned signs: no nonempty proper selection of those signed terms may itself sum to zero. Erdős and Graham (1980) Erdős Problem #319

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.