352 c i~.~ ~?i~,~ p:"ili" !ii~!i ~;~ 6 Square Root by Digit Recurrence
For k < 0, the minimum U is produced at the upper end of the interval
Ii
and
the maximum L at the lower end of the interval. Substituting we get
min(Uk_l(Ii) ) --
2(2 -1 + (i + 1) • 2-~)(k - 1 + p)
+(1 - p - k)(2r
+ 1 - p
- k)r -(j+l)
6.52
max(Lk(/i)) -- 2(2 -1 +i • 2-~)(k
- p) + (k
- P) 2r-(j+l)
These expressions are used in expression (6.48) to determine the result-digit
selection. However, since they depend on j, a different selection function might
result for different j. To have a single selection function
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.