Question

1. State Euclid division algorithm
2. Find the HCF of 148 & 124 by Euclid div. algorithm.
3. State Fundamental theorem of arithmetic,
4. Express 5005 as a product of prime factors.
5. HCF(306, 657) -9, find LCM.
6. Prove V5 is irrational
7. Prove 3-2V5 is irrational,
8. Without actual division check whether 77/210 is terminating or non
9. What can you say about the prime factors of 1.314
10. Find no. of zeros of -
11. Find the zeros and verify the relation between the
zeros and the coefficients (i) x² + 7x + 10 (ii) x² - 3
12. Find a quadratic polynomial whose sum and product of zeros are -
13. Find a quadratic polynomial whose are 2-v2 and 3+V2
14. Find all other zeros of 2x* - 3x - 3x + 6x - 2 if two of the zeros are
15. On dividing xl-3x + x + 2 by g(x), the quotient and remainder a
Find pix)
coincident
​

Answer 1

Answer:

1. 1. euclid division lemma is the basis of Euclid Division algorithm . To calculate hcf of two positive integer a and b use euclids method

i hope it will help you

pls mark me as brainlist

Answer 2

2) HCF= 4

Step-by-step explanation:

Using Euclid's Algorithm Theorem a = bq+r,

148= 124(1)+24

(dividing 148 by 124, we get quotient=1 and remainder= 24)

124= 24(5)+4

(dividing 124 by 24, we get quotient=5 and remainder= 4)

24= 4(6)+0

(dividing 24 by 4, we get quotient=6 and remainder= 0)

Therefore HCF = 4