Want this question answered?
If you notice, there is a common difference between the terms: tn - tn-1 = -4 So the nth term is: tn = tn-1 - 4 For this recursive sequence to be defined though, you need something to start with as your tn-1. So start with t1= 3 and you're done.
Subtract -13 at each consecutive term and so the next term will be -34
The next number in the sequence 5-7-13-31 is 69.
Arithmetic
The nest number in the sequence is 18. Note that the difference between each number and the next number in the sequence follows the simple sequence of 1,2,3,4. Obviously the next in the sequence of increases is 5, so 13+5=18.
Let f(x) = the xth term in your sequence. If x = 1, then f(x) = 5; otherwise if x > 1, then f(x) = f(x - 1) + 4.
If you notice, there is a common difference between the terms: tn - tn-1 = -4 So the nth term is: tn = tn-1 - 4 For this recursive sequence to be defined though, you need something to start with as your tn-1. So start with t1= 3 and you're done.
Subtract -13 at each consecutive term and so the next term will be -34
The next number in the sequence 5-7-13-31 is 69.
Arithmetic
The term menarche describes onset of menstruation. This is usually charachterisic of age 12 or 13.
Well, the menstruation starts at the age of 12-13 in girls. The term for onset of menstruation is menarche .
There is no single solution for x2 + y2 = 13, as there are an infinite number of corresponding values that could be plugged in for x and y. x2 + y2 = 13 is a function that describes a circle. The circle would have a center point of 0, 0, and a radius of √13.
The nest number in the sequence is 18. Note that the difference between each number and the next number in the sequence follows the simple sequence of 1,2,3,4. Obviously the next in the sequence of increases is 5, so 13+5=18.
arithmetic
After 13, it's 18.
Advantages:Through Recursion one can Solve problems in easy way whileits iterative solution is very big and complex.Ex : tower of HanoiYou reduce size of the code when you use recursive call.Disadvantages :Recursive solution is always logical and it is verydifficult to trace.(debug and understand)Before each recursive calls current values of the variblesin the function is stored in the PCB, ie process controlblock and this PCB is pushed in the OS Stack.So sometimes alot of free memory is require for recursivesolutions.Remember : whatever could be done through recursion could bedone through iterative way but reverse is not true.