Mohamed decided to track the number of leaves on the tree in his backyard each year. the first year, there were 500 leaves. each year thereafter, the number of leaves was 40% more than the year before. let f(n) be the number of leaves on the tree in Mohamed's backyard in the n^th year since he started tracking it. f is a sequence. what kind of sequence is it?
Number of leaves on the tree in first year = 500
The number of leaves was 40% more than the year before.
So rate of increase is 40/100 = 0.4
We use exponential growth formula,
f(n) = a(1+r)^n
Where a is the initial number, r is the rate of growth, n is the number of years
We know a= 500, r= 0.4
f(n) = 500(1+0.4)^n
f(n) = 500(1.4)^n
Plug in n=1,2,3...
f(1) = 500
f(2) = 500 * 1.4^1
f(3) = 500 * 1.4^2 and so on
From this we can see that the common ratio is 1.4
Hence it is a Geometric sequence.
Answer: the height in inches, of the pile after 3 weeks is 34 11/12 inches
Step-by-step explanation:
Each consecutive week for the next 5 weeks the height of pile increase by 8 7/12 inches. Converting 8 7/12 inches to improper fraction, it becomes 103/12 inches. The height is increasing in an arithmetic progression. The formula for determining the nth term of an arithmetic sequence is expressed as
Tn = a + (n - 1)d
Where
a represents the first term of the sequence.
d represents the common difference.
n represents the number of terms in the sequence.
From the information given,
a = 17 3/4= 71/4 inches
d = 103/12 inches
n = 3 weeks
the height in inches, of the pile after 3 weeks, T3. Therefore,
T3 = 71/4 + (3 - 1)103/12
T3 = 71/4 + 2 × 103/12 = 71/4 + 103/6
T3 = 419/12 inches = 34 11/12 inches
Step-by-step explanation:
first do prime factorization of 324= 2×2×3×3×3×3
= 2 square, 3 square,3 square
therefore 324 is a perfect square
Now,
prime factorization of 588=2×2×3×7×7
= 2 square,7 square ,3
therefore 588 is not a perfect square
Answer:
first of all I can't see nothing
I answered ALL your 15 problems. Sorry, I took long.
Please mark me brainliest if this helped you. That will help me a lot ...
I hope it helps!