Answer:
There are 177,100 ways.
Step-by-step explanation:
Since there is no regard to order, we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
In this question:
6 keyboards from a set of 25. So
There are 177,100 ways.
Answer:
4140
Step-by-step explanation:
use (n-2)180
n = number of sides
(25-2)180
(23)180
4140
Answer:
∆ ADB = ∆ ADC
Step-by-step explanation:
Answer:
The trinomial is not a perfect square trinomial because the third term is not a square.
Step-by-step explanation:
A trinomial is an expression composed of three terms that are joined together by addition or subtraction.
A perfect square is created when a value is multiplied times itself. Thus, , making the trinomial a² + 2ab + b² a perfect square.
To show that a trinomial is a perfect square you must show that if the first and third terms are squares, figure out what they're squares of. Multiply those things, multiply that product by 2, and then compare your result with the original quadratic's middle term. If you've got a match (ignoring the sign), then you've got a perfect-square trinomial.
The trinomial is not a perfect square trinomial because the third term is not a square.
Answer:
(2^3)^2
Step-by-step explanation:
hope this helps you