Erdős problem 155Is 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?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 1552 retained source recordsCanvaspublic previewSource#155→ResultNone→Checks0