A summer program and resource for middle school students showing high promise in mathematics



Bhaskara-Brouncker Algorithm

Let Q be a non-square intger.
The Bhaskara-Brouncker Algorithm gives successive approximations of √Q as ai/bi, where a0 = b0 = 1, and
ai+1 = ai + biQ
bi+1 = ai + bi
This is the Bhaskara-Brouncker algorithm whose dervation we omit.

Now, setting xi = ai/bi,
we get the following surprising formula for successive approximations to √Q:
xi+1 = (xi + Q)/(xi +1) with x0 = 1.

Ü   BACK

 

MathPath - "BRIGHT AND EARLY"



Send suggestions to webmaster@mathpath.org
Copyright © 2001-   MathPath
Last updated - November 20, 2003