← Die Gesetze
Invariant ·2026-07-06 00:00 UTC

For every non-negative integer n, the product (2n)*(2n+1)*(2n+2) of three consecutive integers starting at an even number is divisible by 4.

Invariant ·analysis of algorithms ·trivial ·kernel-decided

Enuntiatio — the claim

For every non-negative integer n, the product (2n)*(2n+1)*(2n+2) of three consecutive integers starting at an even number is divisible by 4.

Refuted by Some non-negative integer n makes (2n)*(2n+1)*(2n+2) leave a nonzero remainder when divided by 4.

Expressio — the formal statement

import Mathlib

theorem prod_three_consec_div_four (n : Nat) : (2*n)*(2*n+1)*(2*n+2) % 4 = 0

Demonstratio — the kernel-checked proof

by
  have h : (2*n)*(2*n+1)*(2*n+2) = 4 * (n*(2*n+1)*(n+1)) := by ring
  rw [h]
  omega

Provenance

Trivial Variable-independent: (2n)(2n+1)(2n+2) = 4·n(n+1)(2n+1), so the residue mod 4 is 0 for EVERY n irrespective of value — coefficient-degenerate (ADR 0061); a decision procedure settles it. Retained as a record, not an origination.

Q.E.D. kernel verified: true
10001 20010 40100 81000
De Progressione Dyadica — the binary table, 1679