A game spinner has regions that are numbered 1 through 8. If the spinner is used twice, what is the probability that the first n
1 answer:
Answer:
Step-by-step explanation:
Let probability of getting a 3 on a spin be denoted as "P(3)", and
probability of getting a 5 on a spin be denoted as "P(5)"
Also, in probability,
"AND" means "multiplication", and
"OR" means "addition"
We want probability first number is "3" "AND" next number is "5". So we find inidividual probabilities and MULTIPLY.
Numbers 1 through 8 are written int he spinner, each once. So,
There is 1 "3", hence
P(3) = 1/8
There is also 1 "5", hence
P(5) = 1/8
So P(3 and 5) = 1/8 * 1/8 = 1/64
You might be interested in
Answer:
attached below
Step-by-step explanation:
Work the information to set inequalities that represent each condition or restriction.
2) Name the variables.
c: number of color copies
b: number of black-and-white copies
3) Model each restriction:
i) <span>It takes 3 minutes to print a color copy and 1 minute to print a black-and-white copy.
</span><span>
</span><span>3c + b
</span><span>
</span><span>
</span><span>ii) He needs to print at least 6 copies ⇒ c + b ≥ 6
</span><span>
</span><span>
</span><span>iv) And must have the copies completed in no more than 12 minutes ⇒</span>
3c + b ≤ 12
<span />
4) Additional restrictions are c ≥ 0, and b ≥ 0 (i.e. only positive values for the number of each kind of copies are acceptable)
5) This is how you graph that:
i) 3c + b ≤ 12: draw the line 3c + b = 12 and shade the region up and to the right of the line.
ii) c + b ≥ 6: draw the line c + b = 6 and shade the region down and to the left of the line.
iii) since c ≥ 0 and b ≥ 0, the region is in the first quadrant.
iv) The final region is the intersection of the above mentioned shaded regions.
v) You can see such graph in the attached figure.
2) Name the variables.
c: number of color copies
b: number of black-and-white copies
3) Model each restriction:
i) <span>It takes 3 minutes to print a color copy and 1 minute to print a black-and-white copy.
</span><span>
</span><span>3c + b
</span><span>
</span><span>
</span><span>ii) He needs to print at least 6 copies ⇒ c + b ≥ 6
</span><span>
</span><span>
</span><span>iv) And must have the copies completed in no more than 12 minutes ⇒</span>
3c + b ≤ 12
<span />
4) Additional restrictions are c ≥ 0, and b ≥ 0 (i.e. only positive values for the number of each kind of copies are acceptable)
5) This is how you graph that:
i) 3c + b ≤ 12: draw the line 3c + b = 12 and shade the region up and to the right of the line.
ii) c + b ≥ 6: draw the line c + b = 6 and shade the region down and to the left of the line.
iii) since c ≥ 0 and b ≥ 0, the region is in the first quadrant.
iv) The final region is the intersection of the above mentioned shaded regions.
v) You can see such graph in the attached figure.