We have that
<span>n (n-1) -4
for n=1
a1=1*(1-1)-4------> a1=-4
for n=2
</span>a2=2*(2-1)-4------> a2=-2
for n=3
a3=3*(3-1)-4------> a3=2
for n=4
a4=4*(4-1)-4------> a4=8
the answer is
-4,-2, 2, 8
Answer:
12 minutes
Step-by-step explanation:



So, he spent 12 minutes jogging.
Answer:
6 swimmers in the first heat can be arranged in 1716 different ways.
Step-by-step explanation:
A swim meet has 13 contestants signed up. To calculate the arrangement of first 6 swimmers in first heat we will use combinations because order doesn't matter.
So to select 6 swimmers out of 13 contestants number of different ways
= 
= 
= 
= 
= 
= 1716
Therefore, 6 swimmers in the first heat can be arranged in 1716 different ways.
I have no clue you have to do something like x2-x1 over y1-y2 and you get yoyu answer from that.