Skip to content

Erdős problem 178

Let A1,A2,A_1,A_2,\ldots be an infinite collection of infinite sets of integers, say Ai={ai1<ai2<}A_i=\{a_{i1}<a_{i2}<\cdots\}. Does there exist some f:N{1,1}f:\mathbb{N}\to\{-1,1\} such that maxm,1id1jmf(aij)d1\max_{m, 1\leq i\leq d} \left\lvert \sum_{1\leq j\leq m} f(a_{ij})\right\rvert \ll_d 1 for all d1d\geq 1?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:ef77fa0f16508cd2303b1a0dece360f0bfc85cee0ad83fb88999af3cb16478ee
Metadata
sha256:65f691d82be43913bfb04b641c000ccf7d3024e6af5d883d29a88b28e361673e
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:62c07cf7a7d69de0770f4165af6cc0eae4032e123b4a8898ad645e18fe7552c5
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page