Skip to content

Erdős problem 276

Start work

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 n≥0n \ge 0 such that all aka_k are composite, and yet no integer has a common factor with every term of the sequence?

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:c8abd5a05d586393777209dbcf7623f8a5c506e76f42eb8154023a40e75db28f
Metadata
sha256:e3c4518a5c5d2d94042aee33f955134fa8c67ac2255401fcb8077aa6b2990fd0
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:6182518b52afb35128c95cdcd47bfd5e66b5c00e44df1a0d849a31c01906253e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON