- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Tick the correct answer:
Number of non overlapping Triangle we can make in a n-gon ( polygon having n
sides) , by joining the vertices is
a. n-1
b. n-2
c. n-3
d. n+2
Given: A $n-$gon $( polygon)$ with $n$ sides.
To do: To find the number of non overlapping triangle we can make in a $n-$gon$( polygon)$.
Solution:
If we have a polygon with $n$ sides, then number of non overlapping triangles in a $n$-gon$( polygon)=n-2$.
Thus, option $( b)$ is correct.
Advertisements
To Continue Learning Please Login
Login with Google