Theorems · Theorem · number theory
GenContFract.of_s_succ
∀ {K : Type u_1} [inst : DivisionRing K] [inst_1 : LinearOrder K] [inst_2 : FloorRing K] (v : K) [IsStrictOrderedRing K]
(n : ℕ), (GenContFract.of v).s.get? (n + 1) = (GenContFract.of (Int.fract v)⁻¹).s.get? nRecurrence for the GenContFract.of an element v of K in terms of that of the inverse of
the fractional part of v.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites28
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- IsStrictOrderedRingstatement and proof · cited by 2,490
- eq_or_neproof · cited by 1,117
- DivisionRingstatement and proof · cited by 1,062
- FloorRingstatement and proof · cited by 405
- Stream'.Seqproof · cited by 226
- Int.floorproof · cited by 225
- Int.cast_zeroproof · cited by 188
- inv_zeroproof · cited by 184
- Stream'.Seq.get?statement and proof · cited by 122
- Int.fractstatement and proof · cited by 114
- GenContFract.Pairstatement and proof · cited by 85
Cited by1
Results whose statement or proof uses this declaration.
- GenContFract.of_s_tailproof · cited by 1