Question

Program for Bhaskara:

Answer 1

The error message i am getting is:

Error, (in Brounker) cannot determine if this expression is true or false: abs(a[200]/b[200]-5^(1/2)) < tol

Answer 2

isn't this the math forum :D

Answer 3

Brounker:=proc(n,m,tol)
local a,b,i;
a[1]:=1;
b[1]:=1;


for i from 1 to m-1 do
a[i+1]:=a[i]+b[i]*n;
b[i+1]:=a[i]+b[i];
if abs(a[m]/b[m]-sqrt(n))<tol then
return a[m]/b[m];
end if;
end do;
return "Bb FAIL"
end proc;

Answer 4

its the tolerence (tol)limit i am getting trouble with

Answer 5

huh? isn't this conway problem?

Answer 6

na, this is a different one

Answer 7

what is your algorithm? i can't read that ...

Answer 8

for i from 1 to m-1 do
a[i+1]:=a[i]+b[i]*n;
b[i+1]:=a[i]+b[i];

Answer 9

its suppose to give an approximation of sqrt(n)

Answer 10

Man ... i always use Newton's Rhapson's method for approximating ... can you give me some link

Answer 11

hold on

Answer 12

http://www.mathpath.org/Algor/squareroot/algor.bhaskara.brouncker.htm

Answer 13

you know what i think the problem might just be asking me to output the error, meaing the abs value of the final iterate -the sqrt(n)


I think i got it, sorry was wasting your time

Answer 14

do you necessarily need to use recursion?

Answer 15

try this

squareroot := proc (Q, n)
option remember;
description `What the hell`;
if n = 1 then
return (1+Q)/(1+1)
else
return (squareroot(Q, n-1)+Q)/(squareroot(Q, n-1)+1)
end if
end proc


squareroot(2, 12)

Answer 16

squareroot := proc (Q, n) option remember; description `I don't understand coding in Maple`; if n = 1 then return 1/2+(1/2)*Q else return (squareroot(Q, n-1)+Q)/(squareroot(Q, n-1)+1) end if end proc