Answer:
8 thousandths + 6 ones 8 thousandths = 6016 thousandths
Step-by-step explanation:
Answer:
I think it is 16006
Step-by-step explanation:
this because 8 thousands=8000
+
8000+6=8006
soooo,
8000+8006=16006 is the answer
hope you find it useful
may explain in a phrase).
Answer: Any isosceles triangle is a counter example. More specifically, a triangle with sides 7, 7 and 3
When forming your triangle, make sure you apply the triangle inequality theorem. This is the idea where adding any two sides leads to a result larger than the third side. So we have
7+7 = 14 which is larger than 3
7+3 = 10 which is larger than 7
By definition, an isosceles triangle has two congruent sides. Some books say "at least 2 congruent sides", but I'll go with the first definition. If you want all three sides to be congruent, then you'd go for the term "equilateral".
Answer:
Your question needs more data, however; See a complete question and see how it is answered for your guidance.
Step-by-step explanation:
Total estimated machine hours
= Total manufacturing overhead / Plantwide predetermined overhead rate
= ( 255000 + 155000 ) / 10.00
= 41000 MH
Machine hours expected in Department 2
= Total estimated machine hours - Machine hours of Department 1
= 41000 - 15500
= 25500 MH
Answer:
The area of the gazing land is square miles.
Step-by-step explanation:
Given that, 30 miles of fencing can be used to enclose a rectangular piece of grazing land along a straight piece of river.
Let the length of the rectangular piece of gazing which is along the river be y and the width of the rectangular piece of gazing be x.
Along the river side, no fence is required.
Therefore total length of fence is = 2(x+y)-x
=2y+x
∴2y+x=30
⇒2y=30-x
The area of the rectangular piece of gazing is = Length×width
=xy
square miles.
There are 9P3 = 504 ways the positions can be filled because the order in which the applicants are chosen doesn’t matter.
B.
There are 9C3 = 84 ways the positions can be filled because the order in which the applicants are chosen doesn’t matter.
C.
There are 9P3 = 504 ways the positions can be filled because the order in which the applicants are chosen matters.
D.
There are 9C3 = 84 ways the positions can be filled because the order in which the applicants are chosen matters.
The situation which is best described there is 9P3 = 504 ways the positions can be filled with order matters so option (C) will be correct.
Combination and permutation are two alternative strategies in mathematics to break up a collection of components into groups. This subset's components can be listed in any order when concatenated. The components of the subgroup are listed in a permutation in a particular order.
npr = factorial n/ factorial (n -r)
Given that,
Number of applicants = 9
Number of jobs = 3
Since the jobs are certain to the applicant so the order will matter.
Numberof ways to choose 3 people among 9 jobs
9p3 = factorial 9/factorial (9 -3)
9p3 = 9 × 8 × 7 × factorial 6/factorial 6
9p3 = 504
So there will be a total of 504 ways to feel the position such that order will also matter.
To learn more about permutation and combination
#SPJ2
Answer:
the correct answer is C
Step-by-step explanation:
; )