Answer:
Step-by-step explanation:
<u>Recursive sequence
</u>
In a recursive sequence formula, each term is computed as a function of one or more previous terms. In the formula
n is the number of the term we want to calculate. If n=8, then the formula becomes
We can see is the previous term. It means we need to be able to compute . But we also need to compute and so on until some known data is reached. The question provides five terms,
8 Tatami mats are needed to cover the floor.
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
27.75/5 = $5.55 per book
32.16/6 = $5.36 per book
The online store is the cheapest because it has the lowest unit rate
Answer:
Associative property of multiplication.
Step-by-step explanation: