Calculating Diagonals of a Polygon: What are the Values of p and q?

  • Thread starter Thread starter Natasha1
  • Start date Start date
  • Tags Tags
    Polygon
Click For Summary

Homework Help Overview

The discussion revolves around calculating the number of diagonals in a polygon with n sides, expressed in the form 1/p . n . (n-q), where p and q are integers. Participants are exploring the values of p and q through reasoning and examples.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants attempt to derive the values of p and q, with some suggesting specific values based on examples. There are discussions about the number of diagonals in polygons of various sides, including triangles and quadrilaterals, and how to compute them from a given vertex.

Discussion Status

The discussion includes attempts to clarify the relationship between the number of sides and diagonals, with some participants providing calculations for specific cases. There is an ongoing exploration of reasoning methods to derive the formula without relying solely on trial and error.

Contextual Notes

Some participants express frustration with the need for more effort in problem-solving, while others emphasize the importance of reasoning through the problem rather than guessing values for p and q.

Natasha1
Messages
494
Reaction score
9

Homework Statement


A polygon with n sides has a total of 1/p . n . (n-q) diagonals, where p and q are integers.

(i) Find the values of p and q.

Homework Equations

The Attempt at a Solution


Can someone just help me to start on this? I know that q = 3 and p = 2 but how?
 
Physics news on Phys.org
Natasha1 said:

Homework Statement


A polygon with n sides has a total of 1/p . n . (n-q) diagonals, where p and q are integers.

(i) Find the values of p and q.

Homework Equations

The Attempt at a Solution


Can someone just help me to start on this? I know that q = 3 and p = 2 but how?
Take a polygon with n=10 (for example). How many diagonals can you draw from one of the corners?
 
  • Like
Likes   Reactions: Natasha1
9
 
Natasha1 said:
9
No. A diagonal links the corner to one of the other non-adjacent corners. How many of these are there (still with n=10)?
 
  • Like
Likes   Reactions: Natasha1
8
 
Natasha1 said:
8
No. A corner has 2 adjacent corners, and there is no diagonal linking a corner with itself. So, still with n=10, how many diagonals are there starting in one corner?
 
  • Like
Likes   Reactions: Natasha1
If you take a triangle with 3 sides (obviously), there are no diagonals, right?
 
Natasha1 said:
If you take a triangle with 3 sides (obviously), there are no diagonals, right?
Yes, that is correct. A corner of a triangle has two adjacent corners, and that's it. No possibility to draw a diagonal there.
 
  • Like
Likes   Reactions: Natasha1
So a 4 sided polygon as only 1 diagonal, am I correct?
 
  • #10
Natasha1 said:

The Attempt at a Solution


Can someone just help me to start on this? I know that q = 3 and p = 2 but how?
In future posts, you need to show more of an effort than this.
 
  • #11
Natasha1 said:
So a 4 sided polygon as only 1 diagonal, am I correct?
No. A 4 sided polygon has 2 diagonals.
 
  • Like
Likes   Reactions: Natasha1
  • #12
But apart from trial and error is there any other way I can do this?

4 sides polygon
1/2 . 4 . (4-3) = 2 diagonals
5 sides polygon
1/2 . 5 . (5-3) = 5 diagonals
6 sides polygon
1/2 . 6 . (6-3) = 9 diagonals

And so on...
 
  • #13
Mark44 said:
In future posts, you need to show more of an effort than this.
Apologies
 
  • #14
Natasha1 said:
But apart from trial and error is there any other way I can do this?
Yes, there is. I was trying to get you there by reasoning.

So, still with n=10, how many diagonals are there starting in one corner?
 
  • Like
Likes   Reactions: Natasha1
  • #15
4 sided polygon
1/2 . 4 . (4-3) = 2 diagonals
5 sided polygon
1/2 . 5 . (5-3) = 5 diagonals
6 sided polygon
1/2 . 6 . (6-3) = 9 diagonals
...
10 sided polygon
1/2 . 10 . (10-3) = 35 diagonals
 
  • #16
Is there anyway I can do this problem without doing it like i have, guessing what p and q are...

How can one prove it?
 
  • #17
Natasha1 said:
Is there anyway I can do this problem without doing it like i have, guessing what p and q are...

How can one prove it?
By reasoning how many diagonals there are. It is possible, it is easy, but you have to try it.

Outline:
Take one corner, and compute the number of diagonals it lies on. We were almost there: there is a diagonal linking that corner to any other corner, except itself and its two adjacent corners. That makes n - 1 - 2 = n -3 diagonals from that one corner.
Now, this is the case for each one of the n corners. So now you can compute the total number of diagonals, but don't forget that each diagonal connects two corners.

Good night.
 
  • Like
Likes   Reactions: Natasha1 and SammyS
  • #18
Got it thanks!
 

Similar threads

  • · Replies 19 ·
Replies
19
Views
4K
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
9
Views
2K
Replies
1
Views
2K
Replies
7
Views
14K
Replies
2
Views
3K