Delphi.science

The Fibonacci remainder and Lucas norm of the product resultant for xⁿ − x − 1

Source: github.com/stalex444/fibonacci-lucas-resultant/tree/6eb7af0…

Stephanie Alexander

Palomar Registrypalomar/PALOMAR-2026-11-19-000031Nov 19, 2026math.NTscore 0

Let Rₙ(t) be the resultant in x of x² − x − 1 and tⁿ − txⁿ⁻¹ − xⁿ. For every n ≥ 3, we compute Rₙ(t) explicitly in ℤ[t], prove that its remainder modulo t² − t − 1 is (−F₂ₙ + (−1)ⁿ⁺¹)t − F₂ₙ₋₁, and identify the algebra norm of its residue in ℤ[φ] as (−1)ⁿ⁺¹L₂ₙ₋₁. The absolute norm is at least 11, with equality exactly when n = 3. This formalizes Stephanie Alexander’s Theorem 2 for the product resultant and derives the sharp minimum.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-19-000031
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000031/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000031/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'