Want this question answered?
Be notified when an answer is posted
what is the recursive formula for this geometric sequence?
It is often possible to find an explicit formula that gives the same answer as a given recursive formula - and vice versa. I don't think you can always find an explicit formula that gives the same answer.
Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.
a+ b = c
A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.A: Un+1 = Un + d is recursive with common difference d.B: Un+1 = Un * r is recursive with common ratio r.C: The definition seems incomplete.
biggest3 (a,b,c) = biggest2 (a, biggest2 (b,c))
I will explain in the easiest way the difference between the function and recursive function in C language. Simple Answer is argument of the function is differ but in the recursive function it is same:) Explanation: Function int function(int,int)// function declaration main() { int n; ...... ...... n=function(a,b); } int function(int c,int d) { ...... ...... ...... } recursive Function: int recursive(int,int)// recursive Function declaration main() { int n; ..... ..... ..... ..... n=recursive(a,b); } int recursive(int a,int b) { ..... .... .... .... } Carefully see, In the recursive Function the function arguments are same.
what is the recursive formula for this geometric sequence?
a+b=c, c+b=a, b+c=a
int pow (int a, int b) { if (b==0) return 1; else return a*pow(a,b-1); }
It is often possible to find an explicit formula that gives the same answer as a given recursive formula - and vice versa. I don't think you can always find an explicit formula that gives the same answer.
A or B or C = A + B + C - A and B - A and C - B and C - 2 (A and B and C) I'm not sure by the way;
a²+b²=c²
A over B+ C over B=A+C over B=N
Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.
It is a*a + b*b + c*c
non recursive function is excuted faster than recrussive