Erdős problem 276 · problems.science

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/276.lean

Formal Conjectures

FormalConjectures/ErdosProblems/276.leanErdos276.erdos_2761 lineExact file

1True ↔ ∃ a, Erdos276.IsLucasSequence a ∧ (∀ (k : ℕ), (a k).Composite) ∧ ∀ n > 1, ∃ k, n.gcd (a k) = 1

OpenStatement only, no proof

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Continue

Search problems.science