Skip to content

Erdős problem 789

Let h(n)h(n) be maximal such that if A⊆ZA\subseteq \mathbb{Z} with ∣A∣=n\lvert A\rvert=n then there is B⊆AB\subseteq A with ∣B∣≥h(n)\lvert B\rvert \geq h(n) such that if a1+⋯+ar=b1+⋯+bsa_1+\cdots+a_r=b_1+\cdots+b_s with ai,bi∈Ba_i,b_i\in B then r=sr=s.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:c67a22cb9f898e4f26bf270597db2ff36b115aa80333f76f3e2c502609186c09
Metadata
sha256:d361fa2fe7d11a91cea65f876056560e21ac91815a0f48b72702212e9da871b1
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:29fe3ae14a2a10dafef466f4e1456c14855e9a4737783055b488c4450fd74fde
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb