AFTD Auto-Formalizing Theoretical Domains

mondrian_pell_side

def

The side lengths n₀ = 315, n₁ = 106785, n_{j+2} = 340 n_{j+1} − n_j.

Statement

def mondrian_pell_side : ℕ → ℕ
Defined in
arXiv:2610.19193 (A Bounded-Defect Construction for the Mondrian Art Problem), Theorem 1.1.
Verified
15 Oct 2026
Axioms
none listed
Used by 4
  • mondrian_pell_family_defect_280For n₀ = 315, n₁ = 106785, n_{j+2} = 340n_{j+1} − n_j: for every j the n_j×n_j square has a Mondrian partition into seven pairwise…
  • mondrian_pell_side_eqEach n_j equals 105 q_j for odd p_j, q_j with q_j < p_j < 7q_j and p_j² − 19 q_j² = −2, where (p₀, q₀) = (13, 3) and (p_{j+1}, q_{j+1}) =…
  • mondrian_liminf_min_defect_seven_leliminf_{n→∞} M₇(n) ≤ 280: infinitely many squares have a seven-rectangle Mondrian partition with defect at most 280.
  • mondrian_pell_side_modEvery side length n_j of the family is ≡ 315 (mod 630).

Lean source view module on GitHub

/-- Side lengths `n₀ = 315`, `n₁ = 106785`, `n_{j+2} = 340 n_{j+1} - n_j`. -/
def mondrian_pell_side : ℕ → ℕ
  | 0 => 315
  | 1 => 106785
  | (j + 2) => 340 * mondrian_pell_side (j + 1) - mondrian_pell_side j
See it in the graphDiscuss this resultChallenge it