"Like if I have 5 tshirts and i want to gift them to my 5 cousins named A,B,C,D,E, so find number of ways in which particular cousin won't get their particular tshirts." So number of ways: D(n)=n!*(1-1/1!+1/2!-1/3!+.....(-1)^n*1/n!)) Where...
Question 1 Use Euclid's division algorithm to find the HCF of 1)135 and 225 Since 225>135 we apply the division lemma to 225 and 135 to obtain 225= 135×1+90 Since r is not equal to 0 135=90×1+45 Since...