- Messages
- 1,634
- Reaction score
- 4,971
- Points
- 273
hi everyone, em gonna participate n a maths compitition n if anyone can help meh wid following questionzz,,...
We are currently struggling to cover the operational costs of Xtremepapers, as a result we might have to shut this website down. Please donate if we have helped you and help make a difference in other students' lives!
Click here to Donate Now (View Announcement)
ok so at first there are 5 heads5. A dragon has five heads. Every time a head is chopped of, new heads grow. If six
heads are chopped of one by one, how many heads will the dragon finally have?
(A) 25 (B) 28 (C) 29 (D) 30 (E) 35
here vertices are the 'corners' of the triangles lyk here the red points8. The diagram shows two triangles. In how many ways can
you choose two vertices, one in each triangle, so that the straight line through the vertices does
not cross either triangle?
(A) 1 (B) 2 (C) 3 (D) 4 (E) more than 4
thx a lot.......! u dnt knwhw mch u hlpd....thx again bro...here vertices are the 'corners' of the triangles lyk here the red points
now you join one corner from each triangle to the other one in such a way that it doesnt cross any triangle
you repeat this procedure like this
thats the maximum number of lines you can put through vertices
ans is D) 4
its alrity!!thx a lot.......! u dnt knwhw mch u hlpd....thx again bro...
For almost 10 years, the site XtremePapers has been trying very hard to serve its users.
However, we are now struggling to cover its operational costs due to unforeseen circumstances. If we helped you in any way, kindly contribute and be the part of this effort. No act of kindness, no matter how small, is ever wasted.
Click here to Donate Now