Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

waheguru

  • 3 years ago

I need help solving this

  • This Question is Closed
  1. waheguru
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    1 Attachment
  2. KellySund
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    c. or b.

  3. Myammecutie
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    the answer is a

  4. Myammecutie
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    54 definetly

  5. KellySund
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    oh ok

  6. Myammecutie
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    Think 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 double-counting 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 n-gon is: n(n-3) / 2 Answer: 54 diagonals

  7. waheguru
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Thanks

  8. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy