1 real numbers
1 Euclid's division algorithm -
a = bq + r
a- greater
b- smaller
(0<_r>b )
2 Hcf( a. b) * Lcm (a.b) = a*b
3 Terminating Denomerotor = 1/
(2n.5m )
4 products of composite and prime
number is always a composite number
5 products of composite and composite
number is composite number
1 Euclid's division algorithm -
a = bq + r
a- greater
b- smaller
(0<_r>b )
2 Hcf( a. b) * Lcm (a.b) = a*b
3 Terminating Denomerotor = 1/
(2n.5m )
4 products of composite and prime
number is always a composite number
5 products of composite and composite
number is composite number
