Post your question in the Comment section below, and a GRE expert will answer it as fast as humanly possible.

- Video Course
- Video Course Overview
- General GRE Info and Strategies - 7 videos (free)
- Quantitative Comparison - 7 videos (free)
- Arithmetic - 42 videos
- Powers and Roots - 43 videos
- Algebra and Equation Solving - 78 videos
- Word Problems - 54 videos
- Geometry - 48 videos
- Integer Properties - 34 videos
- Statistics - 28 videos
- Counting - 27 videos
- Probability - 25 videos
- Data Interpretation - 24 videos
- Analytical Writing - 9 videos (free)
- Sentence Equivalence - 39 videos (free)
- Text Completion - 51 videos
- Reading Comprehension - 16 videos

- Study Guide
- Philosophy
- Office Hours
- Extras
- Prices

## Comment on

Counting Strategies - Part II## Dear sir,

I m trying to solve all the reinforcement activities. Apart from these from where I should practice the Gre level questions. (Especially counting and data interpretation) Kindly suggest.

Regards

## GRE Prep Club is an excellent

GRE Prep Club is an excellent source of all GRE questions (official questions and unofficial questions).

Just use their question filter (here https://gre.myprepclub.com/forum/viewforumtags.php) to filter your questions by question type.

Cheers,

Brent

## Thanks for the help.

## Hi, I had difficulty solving

What is the approach in solving this question?

Thanks,

Manmeet

## This is a crazy hard question

This is a crazy hard question.

Here's my full solution: https://gre.myprepclub.com/forum/tricky-there-are-n-teams-playing-in-a-b...

Cheers,

Brent

## Hi Brent,

In the Magoosh sample problem with the 7 points on a circle and creating triangles from the points, how is the fact that three verticies next to each other will not form a triangle? Does 7C3 account for that?

## Question link: https://www

Question link: https://www.youtube.com/watch?v=OQpybhVoPms

But 3 adjacent points WILL form a triangle.

You may be thinking of counting questions that are set up similarly, but ask you to count the number of DIAGONALS (not triangles).

When counting diagonals, we must recognize that connecting one vertex to an adjacent vertex will not create a diagonal.

Does that help?

Cheers,

Brent

## Ahh yes, that's what I was

## Here are two questions that

Here are two questions that cover that concept:

- https://gre.myprepclub.com/forum/how-many-diagonals-are-there-in-an-octa...

- https://gre.myprepclub.com/forum/the-diagonal-of-a-polygon-is-a-line-seg...

Cheers,

Brent

## https://gre.myprepclub.com/forum

Hi,

In step3, how did you arrive at the expression for the no. of games won: n * (n-1)(n-9)

## Question link: https:/

Question link: https://gre.myprepclub.com/forum/tricky-there-are-n-teams-playing-in-a-b...

I believe you're referring to pranab01's solution (my solution doesn't involve the variable n).

I'm not sure how pranab01 got that algebraic expression.

It should just be (n-1)(n-9) [note (n)(n-1)(n-9)]

If we continue with pranab01's solution, we see that the n mysteriously disappears!!

Here's my full solution: https://gre.myprepclub.com/forum/tricky-there-are-n-teams-playing-in-a-b...

Cheers,

Brent

## Hi Dear please can you solve

For an 8-a-side football match, a coach has to choose the team from a squad of 12 boys. Only three of them can play as a goalkeeper and these three cannot play any other position. The other boys can play all the other positions - defense, midfield and forward. If the team should have 1 goal keeper, 3 defenders, 3 midfielders and 1 forward, in how many ways can the coach select the team?

a. 495

b. 108

c. 544320

d. 12580

e. 15120

## Here's my full solution:

Here's my full solution: https://gre.myprepclub.com/forum/for-an-8-a-side-football-match-a-coach-...

Cheers,

Brent

## One of the reinforcement

The "1 president and 3 other members" is confusing, so this is written a little strangely and I would have advocated for it to be thrown out. I treated this question as purely FCP...10 x 9 x 8 x 7. You can see how easily confused this can get. It should have said, "1 president AND HIS COMMITTEE OF 3 MEMBERS." That way, we know that we can use the combinations rule for the 3 members. As the problem stands as written, you can easily treat those 3 members as stand-alones (hence, FCP only). See what I mean?

## Question link: https:/

Question link: https://gre.myprepclub.com/forum/of-a-group-of-10-pta-members-a-committe...

The question reads as follows: Of a group of 10 PTA members, a committee will be selected that has 1 president and 3 other members. How many different committees could be selected?

I don't see the ambiguity here. We need a 4-person committee, and one of those people will be president.

This is an official GRE question, and the test-makers spend a lot of time and money ensuring about their questions are clear and free of ambiguity.

## Have to avoid those 160 to

## Yes, it would be great if

Yes, it would be great if there were more official counting and probability questions.

Please keep in mind that, just because a question was too difficult for you to answer does not necessarily mean it's too difficult to be an official GRE question.

While I may include links to questions that hover in the 168-170 range, I only do so if the question meets the test-makers' strict standards.

Trust me, there are TONS of awful/unrepresentative GRE questions out there.

## https://gre.myprepclub.com/forum

For this question , i understand the way in which you break the problem into stages . But apart from goal keeper rest all are alike . Why cant we use 3C1 (Goaljeeper)* 9C7 (rest others) to calculate

## Question link: https:/

Question link: https://gre.myprepclub.com/forum/for-an-8-a-side-football-match-a-coach-...

9C7 tells us the number of ways to select 7 players from 9 players, but this approach doesn't assign a position to any of the players.

## https://gre.myprepclub.com/forum

Can we expect such questions in GRE exam?

## That question is probably

That question is probably skirting the edge of 170.

The difficulty level is probably beyond the scope of the GRE.