All categories

3 years ago

The perimeters of two squares are in the ratio 2 : 4. The perimeter of

Mathematics

1 answer:

Bess [88]3 years ago

8 0

Answer:

Step-by-step explanation:

2 : 4

8 : 16

You might be interested in

What is the definition of a term?

liberstina [14]

Answer:

Step-by-step explanation:

In math, a term is a combination of coefficients, constants and /or variables, each combination being separated by either a + sign or a - sign.

7 0

3 years ago

What is the equation of this line?

Svetlanka [38]

Answer:

A y=-2x-2 I think so sorry if wrong

8 0

3 years ago

Can somebody please help me with this asapp please .

yan [13]

Answer:

Step-by-step explanation:

8x6 is 48

7x6 is 42

so 5x6 is 30

4 0

3 years ago

Sam has softball practice every 3 days and drama lessons every 7 days. On what day will both occur?

sweet [91]

Answer:

the 21st day

Step-by-step explanation:

21 is 3 and 7's least common multiple

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