User Portlet
| Discussions |
|---|
| A proof that the bRank[L] == 2L may exist, but in the absence of that, I wanted to check specific values of L with exact arithmetic. Numerical approximations are a step down in rigor. The rank test is just a way to check that there is a zero... |