There are 1540 combinations. Then, we'll divide them by three because were not just finding the amount of combinations, but the time it'd take to play them all.
We get 513.333(cont.)
thats not really possible, so we're gonna go with 514 instead, rounding up. Normally we'd round down, because the number behind the decimal is below 5, but we really want to make sure we get every combination in there.
We know that applying the law of cosines a² = b²+ c²<span> – 2*b*c*cos(A) cos (A)=[b</span>²+c²-a²]/[2*b*c] in this problem a=10 b=17 c=18 so cos (A)=[17²+18²-10²]/[2*17*18]-----> cos (A)=0.8382 A=arc cos (0.8382)-----> A=33.05°-----> A=33°
To find the greatest common factor using prime factorization by only using prime number divided into the dividend then you continue til it reaches 1 then the prime factorization would look like this e.g. 2×3×5×11
