The middle section is n(n+1)
The top row is n+2
The bottom row is 2n+1
So the rule for the total number of tiles will be the sum of the above rules...
s(n)=n(n+1)+n+2+2n+1
s(n)=n^2+n+n+2+2n+1
s(n)=n^2+4n+3
Answer:
The answer is 3.65 x 10^3 power.
Step-by-step explanation:
In scientific notation, you need only the one's place, so 36.5 would not work. I hope this helps, I know this is a day late and you probably figured it out, but just in case you didn't, here is the answer :)
Answer:
you can use math to explain others wrong by maybe doing calculations
Step-by-step explanation:
Answer:
64
Step-by-step explanation:
can be found by first finding 
then taking that result and putting it into the function 
.
means we are going to take the expression 
and evaluate it for 
:
So 
.
So we have this so far:
.
was found by replacing 
in 
with .
