Question

Using euclid algorithm ,find the hcf of 405and 2520

Answer 1

Answer:

45

Step-by-step explanation:

Hey mate ,

Hope your safe,

So here is your answer:

Euclid's division lemma:

Let a and b any two positive integers . Then there exist two

unique q and r such that

a = bq + r ,

0 less or equal to ' r ' less than b.

a ) 405 and 2520 , start with the larger integer that is , 2520

Apply the division lemma to 2520 and 405 ,

2520 = 405 × 6 + 90

Since the remainder 90 , we apply the division lemma to

405 and 90

405 = 90 × 4 + 45

90 = 45 × 2 + 0

The remainder has now become zero, so procedure stops.

Therefore ,

HCF( 405 , 2520 ) = 45.

hope it helps you mate..

pls mark me the brainliest answer..

:)