All categories

3 years ago

PLEASEEEE HELPP !

Mathematics

2 answers:

Kobotan [32]3 years ago

6 0

Answer:

$slope (m) = -5$

Step-by-step explanation:

The slope can be calculated using two points, (2, 60) and (4, 50) as shown below:

$slope (m) = \frac{y_2 - y_1}{x_2 - x_1}$ , where,

$(2, 60) = (x_1, y_1)$

$(4, 50) = (x_2, y_2)$

Plug in the values into the equation

$slope (m) = \frac{50 - 60}{4 - 2}$

$slope (m) = \frac{-10}{2}$

$slope (m) = -5$

Marat540 [252]3 years ago

6 0

Answer:

x=6

Step-by-step explanation:

You might be interested in

The slope of the line passing through (-9,-6) and (-15,y) is 2/3. what is the value of y

Simora [160]

The value of y is -10

3 0

3 years ago

Read 2 more answers

PLS HELP ASAP THANKS ILL GIVE BRAINLKEST PLS THANKS PLS ASAP

Lesechka [4]

Answer:

(8,0)

Step-by-step explanation

6 0

2 years ago

Read 2 more answers

Alexa can blow 15 balloons in 20 minutes. Sara can blow 18

mylen [45]

rate of blowing balloons of Alexa = 15/20 = 0.75

rate of blowing balloons of Sara = 18/25 = 0.72

rate of blowing balloons of Shirley= 16/21 = 0.76

rate of blowing balloons of Sam = 12/23 = 0.52

from above calculation we concluded Shirley can blow balloons at the fastest rate!

3 0

3 years ago

5. Write an equation for the line representing each of the following situations.

gregori [183]

1. Y = 10x
2. Y = 100 + 30x
3. Y = 50 + 1x
5. Y = 15 + .12x

5 0

3 years ago

Read 2 more answers

How many permutations of the 26 letters of the English alphabet do not contain any of the strings fish, rat, or bird

NARA [144]

The number of permutations of the 26 letters of the English alphabet that do not contain any of the strings fish, rat, or bird is 402619359782336797900800000

Let

$\mathcal{E}=\{\text{All lowercase letters of the English Alphabet}\}\\\\B=\overline{\{b,i,r,d\}} \cup \{bird\}\\\\F=\overline{\{f,i,s,h\}} \cup \{fish\}\\\\R=\overline{\{r,a,t\}} \cup \{rat\}\\\\FR=\overline{\{f,i,s,h,r,a,t\}} \cup \{fish,rat\}$

Then

$Perm(\mathcal{E})=\{\text{All orderings of all the elements of } \mathcal{E}\}\\\\Perm(B)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing bird}\}\\\\Perm(F)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing fish}\}\\\\Perm(R)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing rat}\}\\\\Perm(FR)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing both fish and rat}\}\\$

Note that since

$F \cap R=\varnothing$ , $Perm(F)\cap Perm(R)\ne \varnothing$

But since

$B \cap R \ne \varnothing$ , $Perm(B)\cap Perm(R)= \varnothing$

and

$B \cap F \ne \varnothing$ , $Perm(B)\cap Perm(F)= \varnothing$

Since

$|\mathcal{E} |=26 \text{, then, } |Perm(\mathcal{E})|=26! \\\\|B|=26-4+1=23 \text{, then, } |Perm(B)|=23!\\\\|F|=26-4+1=23 \text{, then, } |Perm(F)|=23!\\\\|R|=26-3+1=24 \text{, then, } |Perm(R)|=24!\\\\|FR|=26-7+2=21 \text{, then, } |Perm(FR)|=21!\\$

where $|Perm(X)|=\text{number of possible permutations of the elements of X taking all at once}$

and

$|Perm(F) \cup Perm(R)| = |Perm(F)| + |Perm(R)| - |Perm(FR)|\\= 23!+24!- 21! \text{ possibilities}$

What we are looking for is the number of permutations of the 26 letters of the alphabet that do not contain the strings fish, rat or bird, or

$|Perm(\mathcal{E})|-|Perm(B)|-|Perm(F)\cup Perm(R)|\\= 26!-23!-(23!+24!- 21!)\\= 402619359782336797900800000 \text{ possibilities}$

This link contains another solved problem on permutations:

brainly.com/question/7951365

6 0

2 years ago