1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
zzz [600]
3 years ago
12

Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1?

Mathematics
2 answers:
Lady_Fox [76]3 years ago
7 0

Answer:

The answer is C

Step-by-step explanation:

Llana [10]3 years ago
4 0

Answer:

f(n)=-2\cdot f(n-1), where f(1)=3

Step-by-step explanation:

The given sequence is; 3, –6, 12, –24, 48, …

The first term of this sequence is

f(1)=3

There is a common ratio of r=\frac{-6}{3}=-2

We can actually use any other two consecutive terms in the sequence to obtain the common ratio.

The recursive formula is given by:

f(n)=r\cdot f(n-1)

We plug in the common ratio to get:

f(n)=-2\cdot f(n-1), where f(1)=3

You might be interested in
Choose the best representation 8/11
Fudgin [204]

Answer:

where is option...........??

8 0
3 years ago
Read 2 more answers
HELP is a volunteer group that raises money each year for community services. The group
stiks02 [169]
$6,200 bc they gave half of what they made to the youth programs.
3 0
3 years ago
Read 2 more answers
Do we use Pythagorean theorem to find missing sides or missing angles in a right triangle
Marina86 [1]
To find missing lengths of sides
hope this helped have a nice day

8 0
3 years ago
Will mark brainliest​
yaroslaw [1]

Answer:

34 is it

Step-by-step explanation:

3 0
3 years ago
A circle has been split into 8 sectors each of which can be colored as 4 different colors, and no consecutive sectors are colore
Eva8 [605]

Answer:

5832 ways

Step-by-step explanation:

Since the circle has 8 sectors and there is 4 colour,

Assuming the sectors are numbered 1 to 8,

Sector 1 : can be coloured with any of the 4 colour in 4 ways

Sector 2 can be coloured with any of the remaining 3 colours in 3 ways

Sector 3 in 3 ways without using the colour in sector 2

Sector 4 in 3 ways without using the colour in sector 3

Sector 5 in 3 ways without using the colour in sector 4

Sector 6 in 3 ways without using the colour in sector 5

Sector 7 in 3 ways without using the colour in sector 6

Sector 8 in 2 ways without using the colours in sector 1 and 7

Number of ways of colouring = 4*3*3*3*3*3*3*2 = 5832 ways

3 0
3 years ago
Other questions:
  • A factory makes 394 motorcycles each week. If there are 52 weeks in a year, how many motorcycles will they make in a year
    15·1 answer
  • Please help meee!!!!!
    6·2 answers
  • What is the surface area of this square pyramid?
    8·1 answer
  • Please solve easy question in photo! Question 1
    12·2 answers
  • A stick l feet long is broken into two parts, one of which is twice as long as the other. How long is the shorter piece?
    10·2 answers
  • Find two integers whose sum is -1 and product is -42
    13·2 answers
  • The table shows the number of sodas left in the vending machine after each hour.
    8·1 answer
  • Answer this question i’ll give brainliest
    8·2 answers
  • Help please <br> What is the answer?
    7·1 answer
  • Victoria bought 14 chicken wings for 19.60. If victoria spent 23.80, how many chicken wings did she buy
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!