The recursive formula for an arithmetic sequence is an = an - 1 + d.
2 answers:
You might be interested in
Every number will have only 3 digits. In the ones place, there are 5 choices. For every choice of digit made in the ones place, there are 8 possible choices for the hundreds place (you can choose from 1-9, omitting whatever is used in the ones place), and there are 8 possible choices for the tens place (you can choose from 0-9, omitting whatever has already been used elsewhere).
So there are
such numbers.
So there are
Answer:
(3, 1)
Step-by-step explanation:
Let the coordinates of B be (x, y)
Since, M is the midpoint of AB.
Therefore, by mid point formula: