Division Trick in 2 SecU0001f92f

Use Euclid's division algorithm to find the H.C.F. of 196 and 38220

Use Euclid's division algorithm to find the H.C.F. of 867 and 255

Using Euclid's division algorithm, find H.C.F. of 274170 and 17017.

Let F(x)=[cos x-sin x0sin x cos x0001] Show that F(x)F(y)=F(x+y)

Statement -1 for all natural numbers n , 2.7^(n)+3.5^(n)-5 is divisible by 24. Statement -2 if f(x) is divisible by x, then f(x+1)-f(x) is divisible by x+1,forall x in N .

if A=[[cos,sin x,0-sin x,cos x,00,0,1]]=f(x) then

Euclid's division lemma || Algorithm to find H.C.F || Example-1,2,3,4 ||Exemplar solved example

Can (y + 5) be the remainder on division of a polynomial f(y) by (y-2) ?