Sandra lays 3.75 tiles in one hour
I spent a lil time on it but I’ll let you know in a lil but if I have the answer:)
Answer:
Explicit formula: a(n)=3n-6
Recursive formula: a(n)=-3+(n-1)3 <--
Step-by-step explanation:
a(n)=3n-6 where a(1)=3(1)-6=-3 and d=3
<u>Plug values into recursive formula:</u>
a(n)=a1+(n-1)d
a(n)=-3+(n-1)3
Answer:
32
Step-by-step explanation:
n(G or F) = n(G) + n(F) - n(G and F)
Total will be the greatest when the intersection is empty
Largest number = 15 + 17 = 32
The correct answer is D.
A function cannot have an x-value that corresponds to more than one y-value.
In this table, the x-value '8' corresponds to two separate y-values; 8 and 5, making it invalid as a function.
