Mathlib Map

Theorems · Theorem · number theory

Pell.xn_modEq_x2n_sub

∀ {a : ℕ} (a1 : 1 < a) {n j : ℕ}, j ≤ 2 * 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 51 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Pell.xn_modEq_x4n_sub · cited by 1Pell.xn_modEq_x4n_subadd_comm · cited by 1535add_commle_total · cited by 294le_totaltwo_mul · cited by 232two_mulNat.ModEq · cited by 225Nat.ModEqtsub_add_cancel_of_le · cited by 112tsub_add_cancel_of_lePell.xn · cited by 44Pell.xntsub_tsub_cancel_of_le · cited by 10tsub_tsub_cancel_of_lePell.xn_modEq_x2n_sub_lem · cited by 1Pell.xn_modEq_x2n_sub_lemPell.xn_modEq_x2n_subCITED BYCITES

Cites8

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.