Theorems · Theorem · number theory
Pell.xn_modEq_x4n_sub
∀ {a : ℕ} (a1 : 1 < a) {n j : ℕ}, j ≤ 2 * n → Pell.xn a1 (4 * n - j) ≡ Pell.xn a1 j [MOD Pell.xn a1 n]- Defined in
- Mathlib.NumberTheory.PellMatiyasevic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 52 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- le_reflproof · cited by 2,061
- add_commproof · cited by 1,535
- le_transproof · cited by 985
- Nat.ModEqstatement and proof · cited by 225
- Pell.xnstatement and proof · cited by 44
- Nat.ModEq.symmproof · cited by 29
- right_distribproof · cited by 26
- Nat.ModEq.transproof · cited by 21
- add_tsub_assoc_of_leproof · cited by 16
- Nat.ModEq.add_right_cancel'proof · cited by 3
- Pell.xn_modEq_x2n_addproof · cited by 2
- Pell.xn_modEq_x2n_subproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Pell.eq_of_xn_modEq'proof · cited by 1