answersLogoWhite

0

A decagon.

Proof:

In an n sided polygon, each vertex would be have (n-3) diagonals attached to it, as it would be connected to every vertex other than itself and the two next to it by a diagonal. There are n sides, so there are n(n-3) ends of diagonals. Therefore there are (n(n-3))/2 diagonals in the polygon.

Taking the number of diagonals to be 35, we have:

(n(n-3))/2 = 35

n(n-3) = 70

which gives the quadratic

n2-3n-70 = 0

Solving this gives n = 10 and -7. -7 can be ignored, so the answer is 10.

User Avatar

Wiki User

13y ago

Still curious? Ask our experts.

Chat with our AI personalities

JudyJudy
Simplicity is my specialty.
Chat with Judy
EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra
MaxineMaxine
I respect you enough to keep it real.
Chat with Maxine

Add your answer:

Earn +20 pts
Q: What polygon has 35 diagonals?
Write your answer...
Submit
Still have questions?
magnify glass
imp