Erdős problem 155 · problems.science

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

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:9b12394c6d0376c46d107d216a6060439864da18d256e4e89f190e57f50d6310
Metadata: sha256:91ea87bfcd07490403e1e45f5e22ae5ea12a2269b6770a8b9fa566ea48084e32
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:caa085193d10cc58b99ff3e6aa7bb35fa041ac62237ccd7f1fd650edbf89ee85

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207