Skip to content

Erdős problem 1119

Let m\mathfrak{m} be an infinite cardinal with ℵ0<m<c=2ℵ0\aleph_0 < \mathfrak{m} < \mathfrak{c} = 2^{\aleph_0}. Let {fα}\{f_\alpha\} be a family of entire functions such that, for every z0∈Cz_0 \in \mathbb{C}, there are at most m\mathfrak{m} distinct values of fα(z0)f_\alpha(z_0). Must {fα}\{f_\alpha\} have cardinality at most m\mathfrak{m}?

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:e2968ad8a54f887e4976bc36f924d03f3018dc11ee0e1b0dcb57cedf616e4849
Metadata
sha256:d7b45c7cafde203588517f8a599d08986db6b1d1ebdd4dde66e92944a549ae4d
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:fa7897947b99af401c55046961424acb95770b03340fc042a741e2e03f2dab94
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb