Theoremintro
Palindrome count bound
Also called at most n+1 distinct palindromes.
A string of length n has at most n+1 distinct palindromic substrings, counting the empty string.
A string of length n has at most n+1 distinct palindromic substrings, counting the empty string.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag R2KDEY Edit this page History Report an error