Ace school

with brainly

  • Get help from millions of students
  • Learn from experts with step-by-step explanations
  • Level-up by helping others

A community for students.

I need help solving this

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions

1 Attachment
c. or b.
the answer is a

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

54 definetly
oh ok
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
Thanks

Not the answer you are looking for?

Search for more explanations.

Ask your own question