Can someone be nice enough to help me please ?

- wintersuntime

Can someone be nice enough to help me please ?

- schrodinger

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this

and **thousands** of other questions

- anonymous

Whats the question?

- wintersuntime

http://westada.org/cms/lib8/ID01904074/Centricity/Domain/793/3.7%20What%20Comes%20Next.Later.pdf

- wintersuntime

I need help with function A and B

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

- wintersuntime

- anonymous

look at the y's to figure out the pattern. What are they doing to get to the next number? Think in terms of addition and multiplication

- wintersuntime

multiplying by 2

- anonymous

right, so that's the answer to #1

- wintersuntime

For number 2 what it be f(x) = f(n-1) x 2

- anonymous

For the recursive formula, the first thing is to write the first term. It looks like they're using function notations, so start with f(1). y is 5 when x is 1, so the first part is
\[f(1)=5\]
Then since it's multiplying by 2,
\[f(n)=2f(n-1)\]

- anonymous

make sense?

- wintersuntime

So it would only be f(n)= 2f(n-1)

- anonymous

no, you need to keep f(1) = 5 as well.
The recursive formula only gives you a term if you know the previous term

- wintersuntime

so f(1)=5 2f(n-1)

- anonymous

yes

- anonymous

actually, no

- wintersuntime

between 5 and 2 i don't put nothing ?

- anonymous

Write it like this
\[f(1)=5, f(n)=2f(n-1)\]

- wintersuntime

oh it was like that

- anonymous

It's saying that the first term is 5.
Then to find the second term, multiply the first one by 2.
Then to find the third term, multiply the second by 2.
and so on.
So with a recursive formula, if you want to know the 67th term, you have to know the 66th. But to know the 66th, you have to know the 65th and so on. It's only useful to point out the pattern. Not really useful for anything else

- anonymous

The explicit one is the useful one.
\[f(n)=ar^{n-1}\]
a = first term
r = number you multiply by (called the common ratio)
Plug in your numbers to that formula to get the explicit formula

- wintersuntime

so i plug in 65?

- anonymous

no, your first term is 5, and you're multiplying by 2.
So plug in 5 for a and 2 for r to get the formula

- anonymous

\[f(n)=5(2)^{n-1}\]

- wintersuntime

oh

- anonymous

the function for A is geometric because it's multiplying by the same number to get to the next term.

- wintersuntime

Isn't it geometric

- anonymous

yeah geometric

- anonymous

I gtg. sorry I can't stay to help on the next one

- wintersuntime

its okay

Looking for something else?

Not the answer you are looking for? Search for more explanations.