Answer:
H0: p(1980) = p(2010) ; H1 : P(1980) > P(2010)
0.02
Step-by-step explanation:
Given that:
Sample size in both 1980 and 2010 = 1000 samples :
Proportion in favor :
P(1980) = 0.66
P(2010) = 0.64
To test the hypothesis :
Null hypothesis :
Proportion in favor are the same in both years
Null hypothesis = H0 = p(1980) = p(2010)
Alternative hypothesis :
Proportion in favor in 1980 is greater than that in 2010
Alternative hypothesis = H1 : P(1980) > P(2010)
The sample statistic :
P(1980) - p(2010)
0.66 - 0.64
= 0.02
Answer:
k is an acute angle
L is a right angle
J is a acute angle
Step-by-step explanation:
Answer:
1/2
Step-by-step explanation:
√84= √4•√21= final answer is
±2√21
Answer:
17
Step-by-step explanation:
Here in this question for finding the numbers that will divide 398, 436 and 542 leaving remainder 7, 11 and 15 respectively we have to first subtract the remainder of the following. By this step we find the highest common factor of the numbers.
And then the required number is the HCF of the following numbers that are formed when the remainder are subtracted from them.
Clearly, the required number is the HCF of the numbers 398−7=391,436−11=425, and, 542−15=527
We will find the HCF of 391, 425 and 527 by prime factorization method.
391=17×23425=52×17527=17×31
Hence, HCF of 391, 4250 and 527 is 17 because the greatest common factor from all the numbers is 17 only.
So we can say that the largest number that will divide 398, 436 and 542 leaving remainders 7, 11 and 15 respectively is 17.
Note: - whenever we face such a type of question the key concept for solving this question is whenever in the question it is asking about the largest number it divides. You should always think about the highest common factor i.e. HCF. we have to subtract remainder because you have to find a factor that means it should be perfectly divisible so to make divisible we subtract remainder. because remainder is the extra number so on subtracting remainder it becomes divisible.