Theorems · Theorem · number theory
ArithmeticFunction.carmichael_two_pow_of_ne_two
∀ {n : ℕ}, n ≠ 2 → ArithmeticFunction.carmichael (2 ^ n) = 2 ^ (n - 2)Note that 2 ^ (n - 2) = 1 when n ≤ 1.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 162 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites25
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- mul_oneproof · cited by 3,885
- Unitsproof · cited by 2,804
- Units.valproof · cited by 1,966
- ZModproof · cited by 1,024
- Nat.cardproof · cited by 844
- Iff.notproof · cited by 489
- orderOfproof · cited by 324
- ArithmeticFunctionstatement · cited by 290
- Nat.card_eq_fintype_cardproof · cited by 200
- Monoid.exponentproof · cited by 128
- Nat.prime_twoproof · cited by 55
Cited by1
Results whose statement or proof uses this declaration.
- ArithmeticFunction.two_mul_carmichael_two_pow_of_three_le_eq_totientproof · cited by 0