Answer:
I think it is yes
Step-by-step explanation:
Answer: The greatest number of pages Kenji can decorate = 3
Step-by-step explanation:
Given: Total heart stickers = 15
Total star stickers =12
If all the papers identical, with the same combination of heart and star stickers and no stickers left over.
Then the greatest number of pages Kenji can decorate = GCD(15,12) [GCD=greatest common divisor]
Since 15 = 3 x 5
12=2 x 2 x 3
GCD(15,12) =3
Hence, the greatest number of pages Kenji can decorate = 3
Answer: y=
Step-by-step explanation: The slope of a perpendicular line is always negative and the reciprocal (opposite fraction) of the regular slope so the slope would be 
. If the line passes through (-10,-6) then the y intercept would be (0,-7) because every time x goes 10 right y goes down 1 because of the slope.
Answer:
we reject H0 and conclude that management's belief about variance is untrue.
Step-by-step explanation:
H0 : σ² = 250
H1 : σ² ≠ 250
Sample size, n = 25
xbar = 50.6 ; s² = 500
α = 0.01 ;
The test statistic :
χ² = [(n - 1)s²] ÷ σ²
χ² = [(25 - 1)* 500] ÷ 250
χ² = (24 * 500) / 250
χ² = 12000 / 250
χ² = 48
The critical value:
df = n-1 ; 25 - 1 = 24
χ²(0.01/2 ; 24) = 45.559
Decison :
Reject H0 : if |χ² statistic| > critical value
Since 48 > 45.559
Hemce, we reject H0 and conclude that management's belief about variance is untrue.
