Answer thismath......
2 answers:
You might be interested in
Answer: a. 0.14085
b. 3.826 x
c. 0.5437
d. 0.0811
Step-by-step explanation:
Given average amount parents and children spent per child on back-to-school clothes in Autumn 2010 , = $527
Given standard deviation , = $160
Let X = amount spent on a randomly selected child
Also Z =
a. Probability(X>$700) = P( >
) = P(Z>1.08125) = 0.14085 {Using Z % table}
b. P(X<100) = P( Z < ) = P(Z< -2.66875) = P(Z > 2.66875) = 3.826 x
c. P(450<X<700) = P(X<700) - P(X<=450)
P(X<700) = 1 - P(X>=700) = 1 - 0.14085 = 0.8592
P(X<=450) = P(Z<= ) = P(Z<= -0.48125) = P(Z<=0.48125) = 0.3155
So final P(450<X<700) = 0.8592 - 0.3155 = 0.5437
d. P(X<=300) = P(Z<= ) = P(Z<= -1.4188) = P(Z>=1.4188) = 0.0811
All the above probabilities are calculated using Z % table along with interpolation between two values.
To find out the largest number of snack bags that Rashad could make, we need to find the GCF of 24 and 56
Because,
GCF of 24 and 56 is the largest possible number that divides 24 and 56 exactly without any remainder. The factors of 24 and 56 are 1, 2, 3, 4, 6, 8, 12, 24 and 1, 2, 4, 7, 8, 14, 28, 56 respectively.
There are 3 commonly used methods to find the GCF of 24 and 56 - long division, Euclidean algorithm, and prime factorization.
By Prime factorisation :
Prime factorization of 24 and 56 is (2 × 2 × 2 × 3) and (2 × 2 × 2 × 7) respectively.
As visible, 24 and 56 have common prime factors. Hence, the GCF of 24 and 56 is 2 × 2 × 2 = 8.
By Euclidean algorithm :
As per the Euclidean Algorithm, GCF(X, Y) = GCF(Y, X mod Y) where X > Y and mod is the modulo operator.
Here X = 56 and Y = 24
- GCF(56, 24) = GCF(24, 56 mod 24) = GCF(24, 8)
- GCF(24, 8) = GCF(8, 24 mod 8) = GCF(8, 0)
- GCF(8, 0) = 8 (∵ GCF(X, 0) = |X|, where X ≠ 0)
Therefore, the value of GCF of 24 and 56 is 8.
By Long division :
GCF of 24 and 56 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.
- Step 1: Divide 56 (larger number) by 24 (smaller number).
- Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (24) by the remainder (8).
- Step 3: Repeat this process until the remainder = 0.
The corresponding divisor (8) is the GCF of 24 and 56.
Hence,
Hence,Rashad can make 8 snack bags
Learn more about GCF at : brainly.com/question/11444998
#SPJ4
