Skip to content

Erdős problem 155

Start work

Is it true that for every k≥1k \geq 1 we have F(N+k)≤F(N)+1 F(N + k) \leq F(N) + 1 for all sufficiently large NN?

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:9b12394c6d0376c46d107d216a6060439864da18d256e4e89f190e57f50d6310
Metadata
sha256:91ea87bfcd07490403e1e45f5e22ae5ea12a2269b6770a8b9fa566ea48084e32
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:caa085193d10cc58b99ff3e6aa7bb35fa041ac62237ccd7f1fd650edbf89ee85
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON