Last visit was: 23 Apr 2026, 22:42 It is currently 23 Apr 2026, 22:42
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
prab
Joined: 13 Aug 2010
Last visit: 23 Aug 2017
Posts: 84
Own Kudos:
135
 [12]
Given Kudos: 1
Posts: 84
Kudos: 135
 [12]
Kudos
Add Kudos
11
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
ankitranjan
Joined: 08 Sep 2010
Last visit: 13 Dec 2012
Posts: 109
Own Kudos:
861
 [5]
Given Kudos: 21
Location: India
Concentration: Finance
WE 1: 6 Year, Telecom(GSM)
Posts: 109
Kudos: 861
 [5]
4
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
General Discussion
User avatar
shrouded1
User avatar
Retired Moderator
Joined: 02 Sep 2010
Last visit: 29 Apr 2018
Posts: 608
Own Kudos:
3,230
 [4]
Given Kudos: 25
Location: London
Products:
Posts: 608
Kudos: 3,230
 [4]
1
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
avatar
jaoliveraaravena
Joined: 11 Jul 2017
Last visit: 25 Aug 2017
Posts: 2
Own Kudos:
4
 [3]
Posts: 2
Kudos: 4
 [3]
1
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
There is a rule for this:
For any geometric figure, the number of sides is equal to the number of vertexes. Let "n" be that number.

At first, you may think that n.n is the number of diagonals but that is not the case for two reasons.

First, with such procedure, you are counting each line joining two vertexes, including the edges of the figure, which are not diagonals. So, for each vertex, you need to discard two lateral lines. That is n-2. In addition, you need to discard the same vertex you are focusing on. That is n-2-1.

So far, we have n vertexes, each with n-1-2 diagonals coming from it, but that is not the end for a second reason. With n(n-2-1) you are counting each diagonal twice; so divide the number by 2.

The formula is then: n(n-3)/2.

For this question, we have that n(n-3)/2=44. Let's operate.

n(n-3)=88, you can solve the quadratic equation n^2-3n-88 and find that n is equal to 11 (remember that no negative number applies here); or you can notice that 88 must be the result of multiplying 8 x 11. So 11 is the answer.
User avatar
Kinshook
User avatar
Major Poster
Joined: 03 Jun 2019
Last visit: 23 Apr 2026
Posts: 5,987
Own Kudos:
Given Kudos: 163
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Products:
GMAT 1: 690 Q50 V34
Posts: 5,987
Kudos: 5,858
Kudos
Add Kudos
Bookmarks
Bookmark this Post
prab
How many sides does a polygon have, if it has 44 diagonals?

A polygon has 44 diagonals, and then numbers of sides are?

Hi prab Bunuel
Please provide options to the question.

Asked: A polygon has 44 diagonals, and then numbers of sides are?

If a polygon has n sides
the number of diagonals = n(n-3)/2 = 44;
n^ - 3n = 88 ;
n^2 - 3n - 88 = 0
n^2 - 11n + 8n - 88 = 0
(n-11)(n+8) = 0
n = 11
numbers of sides = n = 11
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,961
Own Kudos:
Posts: 38,961
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109802 posts
Tuck School Moderator
853 posts