What is the slope of the line passing through the points (2,7) and (-1,3)?

Brilliant_brown [7]

7. 20
8. 680
9. 700
10. 4,000
11. 106,000
12. 5,800

7 0

3 years ago

Billy is playing a game using a bag with 11 marbles inside. The bag contains 3 red, 3 orange, 1 yellow, 2 purple marbles, and 2

Dmitrij [34]

Answer: 3/55

Step-by-step explanation:

From the information given, the bag contains 3 red, 3 orange, 1 yellow, 2 purple marbles, and 2 Pink marbles. Each time he picks an orange marble, she will win a prize.

If he picks a marble the first time, the probability of picking an orange marble will be 3/11. After that we will have 10 marbles left as one has been picked and have 2 orange marbles left, then the probability of picking another orange marble will be 2/10.

Therefore, the probability he will win a prize on both picks will be:

= 3/11 × 2/10

= 6/110

= 3/55

4 0

2 years ago

The train clock run fast and gain 4 minutes every 3 days. How many minutes and seconds will it have gained at the end of 2 days.

Katarina [22]

Answer:

2 minutes, 40 seconds

Step-by-step explanation:

set up a proportion and cross-multiply:

4/3 = x/2

3x = 8

x = 2 2/3 which is 2 minutes, 40 seconds

8 0

3 years ago

Five more than four times a number is greater than seven

kolezko [41]

Answer:

5+ 4x > 7, x > 1/2

Step-by-step explanation:

8 0

3 years ago

In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally up and to the right. ho

valentina_108 [34]

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard

<h3>Further explanation</h3>

The probability of an event is defined as the possibility of an event occurring against sample space.

$\large { \boxed {P(A) = \frac{\text{Number of Favorable Outcomes to A}}{\text {Total Number of Outcomes}} } }$

<h2>Permutation ( Arrangement )</h2>

Permutation is the number of ways to arrange objects.

$\large {\boxed {^nP_r = \frac{n!}{(n - r)!} } }$

<h2>Combination ( Selection )</h2>

Combination is the number of ways to select objects.

$\large {\boxed {^nC_r = \frac{n!}{r! (n - r)!} } }$

Let us tackle the problem.

This problem is similar to Pascal Triangle.

The Lord can move to the right or up in one way only.

We can put "1" in each box on the bottom and left to represent 1 possible movement.

To get the possibility of movement to another box, we will add the possibility of movement to the left, right, and diagonal squares as shown in Figure 1.

This process is repeated for the next box as shown in Figure 2.

Finally, after this process is repeated until the top right box, we get the results as shown in Figure 3.

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard.

<h3>Learn more</h3>

Different Birthdays : brainly.com/question/7567074
Dependent or Independent Events : brainly.com/question/12029535
Mutually exclusive : brainly.com/question/3464581

<h3>Answer details</h3>

Grade: High School

Subject: Mathematics

Chapter: Probability

Keywords: Probability , Sample , Space , Six , Dice , Die , Binomial , Distribution , Mean , Variance , Standard Deviation

7 0

3 years ago