G(n) = -50 - 15n Complete the recursive formula of g(n). g(1) = g(n) = g(n-1)+

Mathematics

1 answer:

Bingel [31]3 years ago

3 0

-50-15n =g(n-)+

-50. -50

-15n=g(n-)50
-15. -15

N=g(-15n)50

You might be interested in

3(x + 4) - x/2 when x = 2

QveST [7]

Answer:

Step-by-step explanation:

Plug the 2 in where every "x" is. Then PEMDAS

3(2+4) - 2/2

3(6) - 2/2

18 - 2/2

18 - 1

5 0

3 years ago

Read 2 more answers

Criminal investigators use biometric matching for fingerprint recognition, facial recognition, and iris recognition. When matchi

Art [367]

Answer:

It is not a Type I error neither a Type II error.

Step-by-step explanation:

Let $\mu$ be the true mean match score. The null hypothesis is $H_{0}: \mu = 80$ and the alternative hypothesis is $H_{1}: \mu > 80$ (upper-tail alternative). When the test shows that the mean match score is more than 80 when actually is equal to 80 a Type I error is made. On the other hand, when the test shows that the mean match score is equal to 80 when actually is more than 80 a type II error is made. Therefore, when the test shows that the mean match score is more than 80 when the person does not actually have a fingerprint match, does not correspond to a Type I error neither to a Type II error.