Download presentation
Presentation is loading. Please wait.
Published byHorace Randall Modified over 9 years ago
1
Partial Quotients A Division Algorithm
2
The Partial Quotients Algorithm uses a series of “at least, but less than” estimates of how many b’s in a. You might begin with multiples of 10 – they’re easiest. There are at least ten 12’s in 158 (10 x 12=120), but fewer than twenty. (20 x 12 = 240) There are more than three (3 x 12 = 36), but fewer than four (4 x 12 = 48). Record 3 as the next guess Since 2 is less than 12, you can stop estimating. The final result is the sum of the guesses (10 + 3 = 13) plus what is left over (remainder of 2 ) 12 158 10 – 1st guess - 120 38 Subtract 3 – 2 nd guess - 36 2 13 Sum of guesses Subtract
3
Let’s try another one 36 7,891 100 – 1st guess - 3,600 4,291 Subtract 100 – 2 nd guess - 3,600 7 219 R7 Sum of guesses Subtract 691 10 – 3 rd guess - 360 331 9 – 4th guess - 324
4
Now do this one on your own. 43 8,572 100 – 1st guess - 4,300 4272 Subtract 90 – 2 nd guess -3870 15 199 R 15 Sum of guesses Subtract 402 7 – 3 rd guess - 301 101 2 – 4th guess - 86
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.