Can someone do this assuming that it is infinite and as well as assuming it's not infinite? Thanks!

see below

Step-by-step explanation:

4,7,12,19

We are adding 3,5,7,9..... each time

The sequence is not arithmetic because we are not adding a constant.  It is not geometric since we are not multiplying by a constant term each time

There is no common difference  or common ratio.

The explicit formula is

an =n^2 +3

The recursive formula is

(n+1)^2 +3 - (n^2 +3)

    n^2 +2n+1+3 - ( n^2+3)

      2n+1

a sub(n+1) = a sub( n) + 2n+1

The 10th term

an      = n^2 +3

Let n=10

an = 10^2+3

    = 100+3

    = 103

summation

see image

since the numbers are increasing and greater than 1 the sum does not exist

18

step-by-step explanation:

draw the shape and you will see that f and k are actually at adjacent vertices (points of the hexagon that are neighboring).   so find the distance between (1,2) and (4,2).   that is easy since (1,2) and (4,2) is just a vertical distance to count, which is 3.   it is a regular polygon which means all sides are congruent.   you have 6 sides (hexa) so multiply 6 by 3 to receive 18.

answer: a video game has three difficulty levels: easy, medium, and expert. the game's scoring works in such a way that a player has to score a fixed number of points to advance to the next level, and then the scoring starts over. the total score needed to clear all three difficulty levels is 7,500. two times the number of points needed to clear the easy level is 500 more than the number of points needed to clear the medium level. twice the number of points needed to clear the medium difficulty level is 1,500 more than the number of points needed to clear the expert level. if x, y, and z represent the easy, medium, and expert levels, respectively, and a is the coefficient matrix of the system of equations modeling this situation, identify the inverse matrix, a-1, and the solution matrix, x, of the system of equations.

ask for details followreport by buttfacelily 2 minutes ago

answers

rauschg

rauschg · hand

know the answer? add it here!

step-by-step explanation: