2 write the first four terms of the
recurswe rule f(1) = 4; f(n)=f(n-1)+5

let's add {f(x)=x+1}f(x)=x+1 and {g(x)=2x}g(x)=2x together to make a new function.

f(x)+g(x) =(x+1)+(2x)=x+1+2x=3x+1

let's call this new function hh. so we have:

{h(x)}={f(x)}+{g(x)}{=3x+1}h(x)=f(x)+g(x)=3x+1

we can also evaluate combined functions for particular inputs. let's evaluate function hh above for x=2x=2. below are two ways of doing this.

method 1: substitute x=2x=2 into the combined function hh.

h(x)

h(2)

​    

=3x+1

=3(2)+1

=7

​ since h(x)=f(x)+g(x)h(x)=f(x)+g(x), we can also find h(2)h(2) by finding f(2) +g(2)f(2)+g(2).

first, let's find f(2)f(2):

f(x)

f(2)

​    

=x+1

=2+1

=3

​  

now, let's find g(2)g(2):

g(x)

g(2)

​    

=2x

=2⋅2

=4

​  

so f(2)+g(2)=3+4=\greend7f(2)+g(2)=3+4=7.

notice that substituting x =2x=2 directly into function hh and finding f(2) + g(2)f(2)+g(2) gave us the same answer!

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for

(1, –1), (16, –4), (36, –6)

step-by-step explanation:

given that the function is

this can also be written as

we have to graph this function and check which list of points lie on the graph

see attachment for graph:

we find that the points lying are (1,-1) (16,-4) and (36,-6)

since square root is there we find that x can only be posiitve but y can be since square root both positive and negative.