Answer:
reflective
Step-by-step explanation:
best guess
4^21/5^6
Multiply the the powers through the parentheses.
Answer:
(c) BC ≅ BC, reflexive property
Step-by-step explanation:
The conclusion of this proof derives from CPCTC and the SAS congruence postulate. In order for SAS to apply, corresponding sides and the angle between them must be shown to be congruent. The congruence statement ...
ΔABC ≅ ΔDCB
tells you these pairs of sides and angles are congruent:
- AB ≅ DC . . . . statement 2
- ∠ABC ≅ ∠DCB . . . . statement 4
- BC ≅ CB . . . . (missing statement 5)
- AC ≅ DB . . . . statement 7
That is, the statement needed to complete the proof is a statement that segment BC is congruent to itself. That congruence is a result of the reflexive property of congruence.
Answer: 1800
Step-by-step explanation:
Given : A certain system has two components.
Number of different models of the first component = 6
Number of different models of the second component = 10
A salesman must select 2 of the first component and 3 of the second to take on a sales call , so we use combinations ( ∵ order of selection not matters)
The number of different sets of components can the salesman take = 
![\dfrac{6!}{2!(6-2)!}\times\dfrac{10!}{3!(10-3)!}\ \ [\because\ ^nC_r=\dfrac{n!}{r!(n-r)!}]](https://tex.z-dn.net/?f=%5Cdfrac%7B6%21%7D%7B2%21%286-2%29%21%7D%5Ctimes%5Cdfrac%7B10%21%7D%7B3%21%2810-3%29%21%7D%5C%20%5C%20%5B%5Cbecause%5C%20%5EnC_r%3D%5Cdfrac%7Bn%21%7D%7Br%21%28n-r%29%21%7D%5D)
Hence, the number of different sets of components can the salesman take = 1800
It should be:
y=-1/2x +1
im not super sure on this but i hope it helped (:
