No more than seven names can be on the ballot for homecoming queen. at least one must be a junior and at least three must be seniors. how many different ballots are possible and what is the system used to solve the problem? (hint: let "j" represent "x" and "s" represent "y" and graph)

the terms of a geometric sequence can be found by beginning with the first term and multiplying by the common ratio repeatedly. a recursive formula for a geometric sequence with common ratio r is given by an=ran−1 a n = r a n − 1 for n≥2 n ≥ 2 .

step-by-step explanation:

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation:

the one below it is a function

just keep asking questions until you have a better understanding.

step-by-step explanation: