Finite Rogers–Ramanujan continued fraction at a primitive n-th root of unity, n ≡ 2, 3 (mod 5)
ProvedRamanujanLostNotebook.PartV.entry_16_2_3number-theoryramanujan-lost-notebook
Let and let be a primitive th root of unity. Then : with , , and , , one has and . Differs from the printed source: the book writes the value of the fraction as ; it is stated here as together with , the condition (which makes the printed quotient defined) being ours.
Preamble
import Mathlib import Definitions.Def_RamanujanLostNotebook_PartV_ch16_rrcfDen import Definitions.Def_RamanujanLostNotebook_PartV_ch16_rrcfNum
Formal statement
namespace RamanujanLostNotebook.PartV
theorem entry_16_2_3 (m : ℕ) (x : ℂ) (hn : (m + 1) % 5 = 2 ∨ (m + 1) % 5 = 3)
(hx : IsPrimitiveRoot x (m + 1)) :
rrcfNum 1 x m = 0 ∧ rrcfDen 1 x m ≠ 0 := by sorry
end RamanujanLostNotebook.PartVSource
G. E. Andrews and B. C. Berndt, Ramanujan's Lost Notebook, Part V, Springer 2018, Chapter 16, Entry 16.2.3, p. 360, eq. (16.2.9).