Use the standard normal table to find the z-score that corresponds to the given percentile. If the area is not in the table, use the entry closest to the area. If the area is halfway between two entries, use the z-score halfway between the corresponding z-scores. If convenient, use technology to find the z-score.
P1
Answers
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,225 = 135 × 1 + 90
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,225 = 135 × 1 + 90Now, remainder 90 ≠ 0, thus again using division lemma for 90, we get,
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,225 = 135 × 1 + 90Now, remainder 90 ≠ 0, thus again using division lemma for 90, we get,135 = 90 × 1 + 45
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,225 = 135 × 1 + 90Now, remainder 90 ≠ 0, thus again using division lemma for 90, we get,135 = 90 × 1 + 45Again, 45 ≠ 0, repeating the above step for 45, we get,
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,225 = 135 × 1 + 90Now, remainder 90 ≠ 0, thus again using division lemma for 90, we get,135 = 90 × 1 + 45Again, 45 ≠ 0, repeating the above step for 45, we get,90 = 45 × 2 + 0
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,225 = 135 × 1 + 90Now, remainder 90 ≠ 0, thus again using division lemma for 90, we get,135 = 90 × 1 + 45Again, 45 ≠ 0, repeating the above step for 45, we get,90 = 45 × 2 + 0The remainder is now zero, so our method stops here. Since, in the last step, the divisor is 45, therefore, HCF (225,135) = HCF (135, 90) = HCF (90, 45) = 45.
As you can see, from the question 225 is greater than 135. Therefore, by Euclid’s division algorithm, we have,225 = 135 × 1 + 90Now, remainder 90 ≠ 0, thus again using division lemma for 90, we get,135 = 90 × 1 + 45Again, 45 ≠ 0, repeating the above step for 45, we get,90 = 45 × 2 + 0The remainder is now zero, so our method stops here. Since, in the last step, the divisor is 45, therefore, HCF (225,135) = HCF (135, 90) = HCF (90, 45) = 45.Hence, the HCF of 225 and 135 is 45.