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 max⁡m,1≤i≤d∣∑1≤j≤mf(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 d≥1d\geq 1?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:62c07cf7a7d69de0770f4165af6cc0eae4032e123b4a8898ad645e18fe7552c5
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb