<h2>Explanation:</h2><h2></h2>
The diagram is missing but I'll assume that the arc BDC is:
And another arc, let's call it FGH. measures:
If those arc are equal, then this equation is true:
Substituting k into the first equation:
The following problem refers to strings in A, B, ..., Z.
1 answer:
Answer: 676
Step-by-step explanation:
The total number of letters in English alphabet {From A to Z} = 26
We assume that the repetition of letters is allowed.
If we fix H at the first position , then the number of ways to make three-letter strings that begin with H is given by :-
Hence, the number of ways to make three-letter strings that begin with H is 676.
You might be interested in
Answer:
see below. The solution is the doubly-shaded area.
Step-by-step explanation:
Each boundary line will be dashed, because the "or equal to" case is <em>not included</em>. Each shaded area will be above the corresponding boundary line because the comparison symbol is y > .... That is, only y-values greater than (above) those in the boundary line are part of the solution.
Of course, the boundary lines are graphed in the usual way. Each crosses the y-axis at the value of the constant in its equation. Each has a slope (rise/run) that is the value of the x-coefficient in the equation.
