|
|
|
|
|
| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 9 Feb 2008 11:26:11 IST
|
|
|
hey itz easy..coz..i no it..c ..1st...1 side common..means..of n points 2 pts gone ..bt only 1 side common so remaining 2 adjacent pts also gone..so remaining n-4pts..rite....so for every side u can get n-4 pts..total sides is n...so total no. or triangles is..[n][n-4]....
on similar lines u can do for to adjacent sides....wen u select ny2 adjacent sides..ur triangle becomes unique..i.e.after selecting 2 sides only 1 triangle is possible...total no of ways u can select 2 adjacent sides is......gues!!!! it is n......can do lik tis...12 23 34 45 56 67 78 89 910 .....[n-1 n][n 1]...got it....
ans 1.....[n][n-4]
ans 2 n
so if u understood plz..rate me....bye!!!!!!!!
|
this reply: 2 points
(with 0 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
|
|
|
|
|
Moderation Team
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
