@audiq7 said:what is the smallest integer n for which any subset of (1,2,3,4....20) of size n must contain two numbers that differ by 8?
13 i think should be the ans
@audiq7 said:what is the smallest integer n for which any subset of (1,2,3,4....20) of size n must contain two numbers that differ by 8?
@ScareCrow28 said:In a triangle PQR, PQ = QR, S and T are points on PR and PQ respectively such that RQ = QS = ST = TP. Then /_ PTS (in degrees) lies in the range(a) (75, 90) (b) (105, 120) (c) (135, 150) (d) (120, 135) (e) none of the foregoing
@wovfactorAPS said:pls.check the question againis it PQ=PR by any chance?S doesnt exist as per the given condition..atleast iam getting so..
@maddy2807 said:@ScareCrow28 please explain the triangle question?
@ScareCrow28 said:Take a triangle PQR...make points as given in the question.. take /_PRQ = x, /_RPQ = z You will have to make equations..you will find that.. x=3zNow in triangle PQR.. PQR+QRP+RPQ = 180=> 2z+a(suppose) + z+3z = 180=> a= 180-6z >= 0 ...=> zAlso.. /_PTS = 180-2z => /_PTS >= 120 ... I did it like this..Please check@audiq7Sorry for late reply..was not able to post for sometime
@wovfactorAPS said:AS per the qustion PQ=QRso /_PRQ=/_RPQhow did u get x=3z?
@ScareCrow28 said:Consider two different cloth cutting processes. In the first one, n circular cloth pieces are cut from a square cloth piece of side s in the following steps: the original square of side s is divided into n smaller squares, not necessarily of the same size; then a circle of maximum possible area is cut from each of the smaller squares. In the second process, only one circle of maximum possible area is cut from the square of side s and the process ends there. The cloth pieces remaining after cutting the circles are scrapped in both the processes. The ratio of the total scrap cloth generated in the former to that in the latter is: (∏ = circumference of the circle/diameter of the circle)(a) 1:1 (b) √2:1 (c) n(4-∏)/(4n-∏) (d) (4n-∏)/n(4-∏) (e) 1:√2

@ScareCrow28 said:Consider two different cloth cutting processes. In the first one, n circular cloth pieces are cut from a square cloth piece of side s in the following steps: the original square of side s is divided into n smaller squares, not necessarily of the same size; then a circle of maximum possible area is cut from each of the smaller squares. In the second process, only one circle of maximum possible area is cut from the square of side s and the process ends there. The cloth pieces remaining after cutting the circles are scrapped in both the processes. The ratio of the total scrap cloth generated in the former to that in the latter is: (∏ = circumference of the circle/diameter of the circle)(a) 1:1 (b) √2:1 (c) n(4-∏)/(4n-∏) (d) (4n-∏)/n(4-∏) (e) 1:√2
@audiq7 said:what is the smallest integer n for which any subset of (1,2,3,4....20) of size n must contain two numbers that differ by 8?
@nick_baba said:is it 9 by any chance..???
how many different seven digit no.s are there such that the sum of all the digits is even??
@audiq7 said:bhai the ans is 13
@nick_baba said:bhai wo to maine dekha earlier posts me..but kuch clear nai hai...?? why cant it be 9??
@audiq7 said:how many different seven digit no.s are there such that the sum of all the digits is even??
Something like..7C6+9C6+11C6...