 Hello friends, welcome to the session. I am Alka we are going to discuss real numbers use Euclid's division algorithm to find the SCF of 867 and 255. So let me tell you the basic concept that is Euclid's division algorithm which is to obtain SCF of C and D where C is more than D step first applying Euclid's division lemma that is on dividing C by D we get Q as a cushion and R as a remainder where R is always more than or equal to 0 which should always be less than D. If R equal to 0 this implies that D is the SCF of C and D but if R is not equal to 0 then we apply the division lemma to D and R and this process keeps on going till R equal to 0 thus the divisor at that stage that is D will be the required SCF. So let's have the solution we have to find the SCF of 867 and 255 here we see that C equal to 867 and D equal to 255 now apply the Euclid's division lemma we get 867 when divided by 255 we get 3 as a cushion and 102 as a remainder here we see that R equal to 102 is not equal to 0 this implies that we'll apply the division lemma again apply division lemma to D that is 255 and R which is 102 so this can be written as 255 only divided by 102 gives 2 as a cushion and 51 as a remainder here we see that R equal to 51 is not equal to 0 so again we apply the division lemma apply division lemma 102 and 51 so this gives us 102 on being divided by 51 gives 2 as a cushion and 0 as a remainder here we see that R equal to 0 so this implies that 51 equal to D is the SCF SCF of 867 and 255 is 51 hope you understood the solution I'll end the session goodbye and take care