Answer:
Step-by-step explanation:a or b ?
Answer:
19
Step-by-step explanation:
Answer:
8
Step-by-step explanation:
2
Answer:
<I= 15degrees
Step-by-step explanation:
Using the cosine rule formulae;
j² = i²+k²-2i cos <J
j² = 37²+57² - 2(37)(57)cos <141
j² = 1369+ 3249- 4218cos <141
j² = 4618- 4218cos <141
j² = 4618-(-3,278)
j²= 7,896
j = √7,896
j = 88.86inches
Next is to get <I
i² = j²+k²-2jk cos <I
37² = 88.86²+57² - 2(88.86)(57)cos <I
1369 = 7,896.0996+ 3249- 10,130.04cos <I
1369 = 11,145.0996 - 10,130.04cos <I
1369 - 11,145.0996 = - 10,130.04cos <I
-9,776.0996=- 10,130.04cos <I
cos <I =9,776.0996 /10,130.04
cos<I = 0.96506
<I = 15.19
<I= 15degrees
Since we are trying to find the number of sequences can be made <em>without repetition</em>, we are going to use a combination.
The formula for combinations is:
is the total number of elements in the set
is the number of those elements you are desiring
Since there are 10 total digits, 
in this scenario. Since we are choosing 6 digits of the 10 for our sequence, 
in this scenario. Thus, we are trying to find 
. This can be found as shown:
There are 210 total combinations.
