Proof step
Ore-algebra identity of two definitions
All-n equality of two definitions
- Concludes
- shift_x_plus_one of Triangle read by rows: T(n,k) is the number of circular binary words of length n having k occurrences of 01 (0 <= k <= floor(n/2)).
- Premises
- none: a direct theorem check
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-f6823543a2580d4a· JSON- Operation
- All-n equality of two definitions
{ "operation": "definition_equality" } - Claims
- Certificate
definition_equality, SHA-256736a867aaeb50485619cdd3908d499a0da29032b24351086a65c7194e65a94fb, 11,285 bytes (3,106 compressed); downloadpolytool replayed the certificate when the step was written.