Answer:
$1.19
Step-by-step explanation:
$2.38/2 weeks
f (n + 1) = f(n) – 5 is the recursive formula can be used to generate the sequence below, where f(1) = 6 and n ≥ 1
<h3><u>Solution:</u></h3>
Given that,
f(1) = 6 and n ≥ 1
Given sequence is 6, 1, -4, -9, -14
<em><u>Let us first analyse the logic used in this sequence</u></em>
6 - 5 = 1
1 - 5 = -4
-4 - 5 = -9
-9 - 5 = -14
Thus the next terms in sequence are obtained by subtracting 5 from previous term
Thus a recursive formula can be formed as:
f (n + 1) = f(n) – 5
Where "n" is the nth term
Let us check our recursive formula:
f(1+ 1) = f(1) - 5
f(2) = f(1) - 5
f(2) = 6 - 5 = 1
Thus we have got f(2) = 1 which is correct as per given sequence
First, we will get the factors of 32:
32 = 1x32 = 2x16 = 4x8
Now, we will find the arrangements of the tiles
Note: we will exclude that she can can form one column including all 32 tiles or 32 columns with 1 tiles in each as these are the trivial answers.
To find the possibilities, we will use the factors 2, 16, 4 and 8.
Tyra can form:
2 column with 16 tiles in each
16 columns with 2 tiles in each
4 column with 8 tiles in each
8 columns with 4 tiles in each
Answer:
C
Step-by-step explanation:
Answer:
it is G.33
brainliest plz
Step-by-step explanation: