- 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,,...
🚀 NEW from the xtremepape.rs team: AI exam prep — 120,000+ worked solutions, and it marks your handwritten working from a photo. Sign in with your forum account & try it free → prepare.xtremepape.rs
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
thx a lot.......! u dnt knwhw mch u hlpd....thx again bro...![]()
🚀 NEW from the xtremepape.rs team: AI exam prep — 120,000+ worked solutions, and it marks your handwritten working from a photo. Sign in with your forum account & try it free → prepare.xtremepape.rs