Answer: 6 snack bags.
Step-by-step explanation:
For this exercise it is important to remember the Greatest Common Divisor (GCD). This is defined as the largest positive intener by which you can divided evenly "n" numbers.
In this case, you know that Jane has 18 juice boxes, 24 bags of peanuts and 36 apples. Therefore, the steps are the following:
1. You need to descompose 18, 24 and 36 into their prime factors, as below:

2. Now you must choose the common ones with the smallest exponent and multiply them.
Then, you get:

Therefore, the greatest number of snack bags that Jane can make is: 6 snack bags.
<span>let:
m1 = 2xy a
m2 = 2xy b
m3 = 2x2y c
since 2 and 3 have a common factor let b=2n
m1 = 2xy a
m2 = 2xy 2 n
m3 = 2x2y c
or simply
m1 = 2xy a
m2 = 2xy 2n
m3 = 2xy 2c
given that anc have no common factors</span>
Answer:
i think the answer is:
<u> B. 0.0142</u>
Step-by-step explanation:
Answer:
262.25 inches
Step-by-step explanation:
65% of 165 is 107.25
107.25+165=272.25
so the truck is 262.25 inches long
Answer:
Therefore the only statement that is not true is b.)
Step-by-step explanation:
There employees are 6 secretaries, 5 consultants and 4 partners in the firm.
a.) The probability that a secretary wins in the first draw
= 
b.) The probability that a secretary wins a ticket on second draw. It has been given that a ticket was won on the first draw by a consultant.
p(secretary wins on second draw | consultant wins on first draw)
=
=
.
The probability that a ticket was won on the first draw by a consultant a secretary wins a ticket on second draw =
is not true.
The probability that a secretary wins on the second draw = 
c.) The probability that a consultant wins on the first draw =

d.) The probability of two secretaries winning both tickets
= (probability of a secretary winning in the first draw) × (The probability that a secretary wins on the second draw)
= 
Therefore the only statement that is not true is b.)