4. Find f (2), f (3), f (4), and f (5) if f is defined recursively by f (0) = f (1) = 1 and for n = 1, 2, . . . a) f (n + 1) = f (n) − f (n − 1). b) f (n + 1) = f (n)f (n − 1). c) f (n + 1) = f (n)2 + f (n − 1)3. d) f (n + 1) = f (n)/f (n − 1).

a) f(2) = 0; f(3) = f(4) = -1; f(5) = 0

b) f(2)=f(3)=f(4)=f(5) = 1

c) f(2) = 2; f(3) = 5; f(4) = 27; f(5) = 734

d) f(2)=f(3)=f(4)=f(5) = 1

Step-by-step explanation:

7

step-by-step explanation:

yuo ned the activity or vertical angle of the form of 1,7 but 2,2 has a c4,2 as it verticie so i not have a car

13

step-by-step explanation:

169-1=168

168-3=165

165-5=160

160-7=153

153-9=144

144-11=133

133-13=120

120-15=105

105-17=88

88-19=69

69-21=48

48-23=25

25-25=0

since it took 13times to completely subtract it hence its square root is 13