mirror of
https://github.com/python/cpython.git
synced 2025-08-04 00:48:58 +00:00
Illustrating by example one good reason not to trust a proof <wink>.
This commit is contained in:
parent
ab86c2be24
commit
e417de0e56
1 changed files with 3 additions and 3 deletions
|
@ -1791,9 +1791,9 @@ then we're asking whether asize digits >= f(bsize/2) digits + 2 bits. By #4,
|
|||
asize is at least f(bsize/2)+1 digits, so this in turn reduces to whether 1
|
||||
digit is enough to hold 2 bits. This is so since SHIFT=15 >= 2. If
|
||||
asize == bsize, then we're asking whether bsize digits is enough to hold
|
||||
f(bsize/2) digits + 2 bits, or equivalently (by #1) whether c(bsize/2) digits
|
||||
is enough to hold 2 bits. This is so if bsize >= 1, which holds because
|
||||
bsize >= KARATSUBA_CUTOFF >= 1.
|
||||
c(bsize/2) digits + 2 bits, or equivalently (by #1) whether f(bsize/2) digits
|
||||
is enough to hold 2 bits. This is so if bsize >= 2, which holds because
|
||||
bsize >= KARATSUBA_CUTOFF >= 2.
|
||||
|
||||
Note that since there's always enough room for (ah+al)*(bh+bl), and that's
|
||||
clearly >= each of ah*bh and al*bl, there's always enough room to subtract
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue