diff options
author | pommicket <pommicket@gmail.com> | 2024-09-06 19:30:58 -0400 |
---|---|---|
committer | pommicket <pommicket@gmail.com> | 2024-09-06 19:30:58 -0400 |
commit | 7cdc2bcd6dc7437e68fef3ec6c31a947641781fa (patch) | |
tree | 48c52f2beab585b6aad7de1204302d6932fae4ef | |
parent | f7ad5d01d2b4db1c3f7f63807317f93a2a20bdf2 (diff) |
updated results
-rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -71,4 +71,4 @@ very small values of $k$ (this is motivated by the two known sporadic solutions go through each entry in the triangle, only storing one row in memory at a time, and do a binary search to check if the entry is ${n\choose k}$ for some small $k$. Using this method we can verify with just a few hours and megabytes of memory that no more solutions exist with ${n\choose k}<10^{123}, m < 3\times 10^6, k \leq 30$ (arguments `col-limit 30` after -modifying `UInt` to be 512-bit) or with ${n\choose k}<10^{152}, m < 10^7, k = 2$. +modifying `UInt` to be 512-bit) or with ${n\choose k}<10^{152}, m < 2\times 10^8, k = 2$. |