AFTD Auto-Formalizing Theoretical Domains

derangements_no_two_cycles_quotient

def

For a natural number n, derangements_no_two_cycles_quotient n is the quotient of the number of derangements of Fin n without 2-cycles divided by (n - 1) * (n - 2).

Statement

def derangements_no_two_cycles_quotient (n : ℕ) : ℕ
Defined in
scout/2610-40342-a-p-adic-valuation-calculus-for-permutations-with-restricte.md:1608
Verified
07 Nov 2026
Axioms
none listed
Built on 1
  • derangements_no_two_cycles_countFor a natural number n, derangements_no_two_cycles_count n is the number of permutations of Fin n that have no cycles of length 1 and no…
Used by 2

Read back from the Lean

The definition derangements_no_two_cycles_quotient assigns to each natural number $n$ the natural number quotient of the number of permutations of $\text{Fin } n$ having no cycles of length 1 or 2, divided by $(n - 1) * (n - 2)$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The quotient Q_n = T(n,2) / ((n-1)(n-2)) for column 2 of derangements without 2-cycles. -/
def derangements_no_two_cycles_quotient (n : ℕ) : ℕ := derangements_no_two_cycles_count n / ((n - 1) * (n - 2))
See it in the graphDiscuss this resultChallenge it