Prove the five-request binary full-guard product inequality for every m>=5 (k=5 of #4275 OQ2; no new κ) - #4607

Prove the five-request binary full-guard product inequality for every m>=5 (k=5 of #4275 OQ2; no new κ)#4607

Mister-Meeseeks merged 1 commit into

CrocSwap:mainCrocSwap/integer-mult-bounds:mainfrom

pinterbanget:five-eventpinterbanget/integer-mult-bounds:five-eventCopy head branch name to clipboard