Skip to content

Erdős problem 276

Is there an infinite Lucas sequence a0,a1,a_0, a_1, \ldots where an+2=an+1+ana_{n+2} = a_{n+1} + a_n for n0n \ge 0 such that all aka_k are composite, and yet no integer has a common factor with every term of the sequence?

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:c8abd5a05d586393777209dbcf7623f8a5c506e76f42eb8154023a40e75db28f
Metadata
sha256:e3c4518a5c5d2d94042aee33f955134fa8c67ac2255401fcb8077aa6b2990fd0
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6182518b52afb35128c95cdcd47bfd5e66b5c00e44df1a0d849a31c01906253e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page