OAI/Combinatorics/EditApproximation/Binary/BinaryDivisionWork.lean

GitHub source file

5 declarations, 0 contain sorry, 0 declared as axioms

Binary long division. A high-prefix quotient and remainder are extended by one source bit, then compared with the positive divisor and reduced by at most one ripple-borrow subtraction.

  1. theorem OAI.EditApproximation.bitDivModWithWork_value line 15
  2. theorem OAI.EditApproximation.bitDivModWithWork_lengths line 57
  3. theorem OAI.EditApproximation.bitDivModWithWork_cost line 71
  4. theorem OAI.EditApproximation.binaryNaturalDivModWithWork_spec line 86
  5. theorem OAI.EditApproximation.binaryNaturalDivModWithWork_cost line 99