Theoremcore
Miller-Rabin error bound
Also called Rabin's theorem on strong liars.
For composite n, at most a quarter of bases are strong liars.
For composite n, at most a quarter of bases are strong liars.
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 XV8E5A Edit this page History Report an error