Skip to content

Erdős problem 1193

Let A⊂NA\subset \mathbb{N} and let g(n)g(n) be a non-decreasing function of nn which is always >0>0.

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:322a1bf14df04e89d338c49956a6f21bcc9e0445cb3d4cca95f513eb4e5dac5f
Metadata
sha256:baef08daa588ecefb92864f6919356da57e9e0806ed8466b00e7b29f459d9ec4
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:082713ad5ced813f175d75d98943137c8dc07fe834b8c3e2e4f07f0eefb474bc
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb