Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Divide Algorithm

IP.com Disclosure Number: IPCOM000081788D
Original Publication Date: 1974-Aug-01
Included in the Prior Art Database: 2005-Feb-28
Document File: 2 page(s) / 49K

Publishing Venue

IBM

Related People

Harboe, RW: AUTHOR [+3]

Abstract

In the equality Q=N/D; N being the known numerator, D being the known divisor and Q the unknown quotient; Q is obtained by successive subtractions of the divisor or X times divisor from the numerator, until the numerator becomes less than the divisor or equal to zero. Multiplier, X may be any digit from 2 through 9. The number with the largest digit in the first position (divisor or X times divisor) is always subtracted, if possible, thus minimizing the number of subtractions and comparisons. The optimum condition is achieved when X is equal to 3 or 4.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Divide Algorithm

In the equality Q=N/D; N being the known numerator, D being the known divisor and Q the unknown quotient; Q is obtained by successive subtractions of the divisor or X times divisor from the numerator, until the numerator becomes less than the divisor or equal to zero. Multiplier, X may be any digit from 2 through 9. The number with the largest digit in the first position (divisor or X times divisor) is always subtracted, if possible, thus minimizing the number of subtractions and comparisons. The optimum condition is achieved when X is equal to 3 or 4.

1

Page 2 of 2

2

[This page contains 4 pictures or other non-text objects]