# data[].attributes.body
a = Bq + r

# data[].attributes.body
if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that it satisfies the condition a = bq + r where 0 ≤ r ≤ b

# data[].attributes.body
a = bq +r

# data[].attributes.body
Ex:2,3,5,7
Every composite numbers can be expressed as a product of 2 prime numbers.
EDL=a=bq+r

# data[].attributes.headline
harshith suryavanshi.N                  

# data[].attributes.subject
harshith suryavanshi.N                  

# data[].attributes.body
prime numbers -
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.

# data[].attributes.body
1. a=bq+r
2.LCM
3.HCF
4.PRIME FACTORS
5.PRIME NUMBER

# data[].attributes.body
1. a=bq+r
2. 5,11,9
3.  Any composite number can be expressed as a product of its numbers. It has a unique factorization.
4. hcf
5. 3,5,7

# data[].attributes.body
Rakshitha 1)a=bq+r (2) examples of prime numbers is 3,5,7,11,13,17,19,23..( 3) FTA states

# data[].attributes.body
1)a=bq+r, where r is equal or greater than 0 but lesser than b .
2)prime numbers - 2,11,3,5
3) every composite number can be expressed as a product of 2 prime numbers .

# data[].attributes.body
1.EDL=a=bq+r
2.2,3,5,7 etc
3.Every composite number can be expressed in the form of 2 prime numbers.

# data[].attributes.body
euclids division lema - a=bq+r
where 0(=r( b
prime factorisation
factor tree

# data[].attributes.body
1.a=bq+r
2.2,3,5,7,etc
3.every composits number can be expressed as a product of prime number .Eg:30=2×5×3
4.

# data[].attributes.body
shashank

# data[].attributes.body
.EDL=a=bq+r

.prime numbers:no.which have only two numbers as there factors that is 1 and the no. itself. eg :2,3,5,7

.fundemental theorem of arithmetic states that every composite no. can be expressed as a product of prime no.

# data[].attributes.body
1. a=bq+r
2. 2, 3, 5,  7, 11.......
3. every composite number can be factorized as a product of prime numbers
4.

# data[].attributes.body
1. a = bq + r
2. 3, 5 , 7, 9
3.  any composite number can be expressed as the product of prime numbers : E g :  5+5+5+5= 25
5 is a prime number
4.  To find the HCF, find any prime factors that are in common between the products
To find the LCM, multiply the HCF by all the numbers in the products that have not yet been used.

# data[].attributes.body
1) a= bq+r
2)  EDL
3)prime number
4) HCF
5) 2,3,5,7,......

# data[].attributes.body
1) a= bq +r
2) 2,3,7,5,11,17

# data[].attributes.body
1. a=bq+r where r is greater or =0 r is lesser than b.
2. 2,11,17,3,5
3.fta states  that any composite number can be expressed as a product of its prime factors . It has a unique factorisation.
ex:20,15,30
4.we can find hcf by checking out the common factors.
lcm can be found when prime numbers are multiplied to  find the product

# data[].attributes.body
1. a=bq+r
prime factorisation
euclids division lemma

# data[].attributes.body
we learnt
euclids division lemma -  a=bq+r
prime number - 2, 3,5,7,11,9 etc
fundamental theorem of arithmetic - every composite number is made up of unique set of prime number but the order of prime number can be changed
eg - 6=2*3 or 6=3*2
where 3 *2 cannot be the factor of any other number

# data[].attributes.body
1. a=bq+r
2. prime numbers have only 2 factors
ex:2,3,5
3. every composite number can be expressed as product of prime numbers where the factorisation is unique.
4. hcf can be calculated through factor tree by checking out the common factors between them
in the question, 16 and 36 have 2 as common factor twice (2^2) hence hcf is 4
lcm can be found out by factorising through factor tree and the product of primes gives lcm
like 16=2^4 and 36 =2^2 * 3^2

# data[].attributes.body
Chandan
a=bq+r
Prime number
2,3,5,7,11,13,17,19,23,29,31....
FTA=Every composite number can be expressed as a product of prime numbers, and this is unique factorisation apart

# data[].attributes.body
1. a=bq+r
2. 2,3,5,7,11,23,29,......
3.  Any composite number can be expressed as a product of its numbers. It has a unique factorization.

# data[].attributes.body
1. a=bq+r
2.eg;- 2,3,5,7,11
3.every composite number can be expressed as product of prime no were the factorization is unique.
4.. hcf can be calculated through factor tree by checking out the common factors between them
in the question, 16 and 36 have 2 as common factor twice (2^2) hence hcf is 4
lcm can be found out by factorizing through factor tree and the product of primes gives

# data[].attributes.body
1) a=bq+r where 'a' is the dividend, 'b' is the divisor, 'q' is the quotient and 'r' is the remainder where 0<_ r <b
2) 2.3.5.7.11.13.17.19
3)Every prime number can be written as the product of prime numbers and this factorization of each composite number is unique.

# data[].attributes.body
BHAVANA

Euclids division lemma
a=bq+r

Fundamental theorem of arithmetic:every composite number can be expressed as a product of prime and this factorization is unique apart from order in which prime factors occur.
Eg:30=2×3×5

# data[].attributes.body
Recall
1. Euclid's division lemma.
2. Examples of prime numbers
3. Fundamental theorem of arithmetic
4. See the picture below and try to explain the method of calculating HCF and LCM using factor tree