A community for students.
Here's the question you clicked on:
 0 viewing
waheguru
 3 years ago
I need help solving this
waheguru
 3 years ago
I need help solving this

This Question is Closed

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Think of any vertex. It can't connect to itself, nor the two neighboring vertices already connected by edges, but that still leaves 9 vertices to connect to. 12 vertices each connected to 9 other vertices would seem to imply 108 diagonals... except you are doublecounting everything (a diagonal from A to B is the same as a diagonal from B to A). So divide this number by 2. Note: The general formula for the number of diagonals in an ngon is: n(n3) / 2 Answer: 54 diagonals
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.