Answer:
Step-by-step explanation:
a1=7
a2=13
c.d. d=13-7=6
an=a1+(n-1)d
an=7+(n-1)6=7+6n-6=6n-1
recursive formula
c.d .=an-a(n-1)
6=a_{n}-a_{n-1}
a_{n}=a_{n-1}+6
You would be able to find this out using the calculator
Answer:

Step-by-step explanation:
we have

Let


Exchanges the variables x for y and y for x

Isolate the variable y


Let


Answer:

Step-by-step explanation:
This can be solved using the binomial distribution because the cars arriving at the stop are independent of each other. This means we will use:

Where p is the probability of success, q = 1 - p is the probability of failure and n is the number of cars sampled.
p = 0.4
q = 0.6
n = 4
Therefore,

This is equal to


Q (-1,-2) that is your answer.