Question

state euclids division lemma and fundamental theoremof arithmetic

Answer 1

According to euclids devision lemma - for any 2 positive integer and b there r the unique integers qand r that satify the condition a=bq+r where 0=or less than r and r is less than b and fundamental theorm of arithmatic is -every composite no. Can be expressed as product of prime no. This factorization is unique apart from the order in which the factor occurs for eg of E.D.Lis 7= 3×2+1 and eg of FTM is 10=2×5hope it helps u and dont forget to make my answer the barinliest plz i really need that

Answer 2

Euclid Division lemma statement:- For any two positive integer a and b, there exist a unique whole no. q and r.

Such that a=bq + r where (0≤r<b)

Fundamental theorem of Arithmetic statement:-Every integer greater than one either is prime number or unique.