Using the Pythagorean theorem:
a^2 + 24^2 = 26^2
a^2 + 576 = 676
a^2 = 676 - 576
a^2 = 100
a = SQRT(100)
a = 10
To find the number of non-defective chips, we simply use this equation:
2,000 * 4/5
8000/5
Now you simply divide:
1600
1600 chips aren't defective
M-6 is the expression that shows how far Allison has to run
Women can be seated in 89 ways.
Let Sn be the number of possible seating arrangements with n women. Consider n≥3 and focus on the rightmost woman. If she goes back to her seat, then there are Sn−1 ways to seat the remaining n−1 women. If he is sitting in the penultimate seat, then the woman who was sitting there before must now sit in the rightmost seat.
This gives us Sn−2 ways to seat another n−2 woman, so we get the recursion Sn=Sn−1+Sn−2. Starting with S1=1 and S2=2 we can calculate S10=89.
For more information about permutation, visit brainly.com/question/11732255
#SPJ4
