Write a recursive formula for the sequence of numbers.

Step-by-step explanation:

an = a1 + 4×[2^(n -1) - 1]

9514 1404 393

  a[1] = 3

  a[n] = 2×a[n-1] +1

Step-by-step explanation:

We observe the first differences are ...

  7-3 = 4

  15-7 = 8

  31-15 = 16

  63-31 = 32

The first differences increase by a factor of 2, so we expect the recursive formula will have a term that looks like "2×a[n-1]".

The second term is 2·3+1 = 7.

The third term is 2·7+1 = 15.

This suggests our recursive formula is ...

  a[1] = 3

  a[n] = 2×a[n-1] +1

.24

step-by-step explanation:

the probability is   .24

the first player had the highest probability of getting a silver marble

the game could be made fair by adding back the marble that was drawn after each draw

-12 > a

step-by-step explanation:

-11 > 1 + a

subtract 1 from each side

-11 -1> 1 -1+ a

-12 > a