Theorems · Theorem · number theory
Pell.xn_modEq_x2n_sub_lem
∀ {a : ℕ} (a1 : 1 < a) {n j : ℕ}, j ≤ n → Pell.xn a1 (2 * n - j) + Pell.xn a1 j ≡ 0 [MOD Pell.xn a1 n]- Defined in
- Mathlib.NumberTheory.PellMatiyasevic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 50 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- zero_addproof · cited by 2,366
- mul_commproof · cited by 2,262
- add_assocproof · cited by 746
- Nat.cast_addproof · cited by 586
- Nat.cast_mulproof · cited by 309
- two_mulproof · cited by 232
- Nat.ModEqstatement and proof · cited by 225
- dvd_mul_rightproof · cited by 89
- Pell.xnstatement and proof · cited by 44
- Pell.ynproof · cited by 37
- sub_add_eq_add_subproof · cited by 29
- add_tsub_assoc_of_leproof · cited by 16
Cited by1
Results whose statement or proof uses this declaration.
- Pell.xn_modEq_x2n_subproof · cited by 1