Ask question

Ask question

All categories

3 years ago

6

Tell whether the sequence , , , . . . is arithmetic, geometric, or neither. Find the next three terms of the sequence. A. neithe

r; 7, -20, 61 B. geometric;7, -20, 61 C. arithmetic; , , D. geometric; , ,

1 answer:

Nastasia [14]3 years ago

5 0

Looking at the predicted three terms, the sequence seems to neither arithmetic nor geometric.<span />

You might be interested in

g Problem 7. (10 points) A random sample of 100 Cooper County residents showed that 18 are college graduates and a second random

GrogVix [38]

Answer:

The relative risk of being a college graduate for Boone County residents as compared to Cooper County residents is 3.11.

Step-by-step explanation:

Denote the events as follows:

<em>C</em> = Cooper County resident

<em>B</em> = Boone County resident

<em>G</em> = graduate

<em>NG</em> = non-graduate

The information provided is summarized as follows:

G NG Total

C 18 82 100

B 28 22 50

Total 46 104 150

Compute the relative risk of being a college graduate for Boone County residents as compared to Cooper County residents as follows:

$\text{Relative Risk}=\frac{\text{Graduates in Boone County}}{\text{Graduates in Cooper County}}$

$=\frac{28/50}{18/100}\\\\=\frac{28}{50}\times \frac{100}{18}\\\\=3.11111\\\\\approx 3.11$

Thus, the relative risk of being a college graduate for Boone County residents as compared to Cooper County residents is 3.11.

7 0

4 years ago

Mustafa wants to cross a dungeon. The dungeon has n cells, and in every cell, there are m monsters. To cross each cell he has to

VladimirAG [237]

The minimum strength he must have in the beginning so that he can cross n cells is gotten from; Strength[n - 1] = min_i Energy[n-1] [i]

How to create an Algorithm?

Let us call Energy [N][M]) the energy needed to kill each monster, and Conf [N][M] the associated confidence.

Let us call Stren[N] the minimum energy that you will need to pass each cell.

We need to select the good monster at each step. The issue is that at first cell for example, you cannot make the good decision without considering all the next cells. A DP solution or a DFS one will certainly work. However, the complexity would be quite high.

Thus using a greedy solution at the condition to start from the end would be the best thing to do.

At the last cell, the needed strength is easily calculated:

Strength[n - 1] = min_i Energy[n-1] [i]

The next strengths are then iteratively calculated, from back to the top:

Strength[j] = min_i (Energy[j][i], Energy[j][i] - Conf[j][i] + Strength[j+1]) For all j

Final result: Strength[0]

Complexity: linear O(NM). Impossible to do better as you have to consider each monster.

Read more about Creating Algorithms at; brainly.com/question/13800096

#SPJ1

4 0

2 years ago

Please help me!!!!!!!!!

kifflom [539]

The vertex tells you the graph is translated left 2 and vertically by k.

so it will be y = a|x+2| + k

absolute value graphs are v-shaped

opens downward means "a" will be negative.

then it is given that "a" is +/-4. which we know from the previous info that it's -4.

the last info, that it goes through (-3,-1) gives k.
the only options are the last two. The equation: y = -4|x+2| +3 is the only one that works for the point given.

5 0

3 years ago

How many cups in 10 quarts

bagirrra123 [75]

40 cups (4 cups per quart).

3 0

3 years ago

Read 2 more answers

A software company is releasing one of their products on a CD. The manufacturer charges a $5,500 setup fee and $1.00 per CD. App

zlopas [31]

Given:
set-up fee 5,500
variable fee 1 per CD.

Cost per CD is $5.50

5.50 - 1= 4.50

5,500 / 4.50 = 1,222 CDs Choice A.

1*1,222 = 1,222
1,222 + 5,500 = 6,722
6,722/1,222 = 5.50

6 0

3 years ago

Read 2 more answers