Post your question in the Comment section below, and we’ll answer it as fast as humanly possible.

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

- Study Guide
- Office Hours
- Extras
- Guarantees
- Prices

## Comment on

Distributing Coins## why isn't here "multiply"?

## In this lesson, we're looking

In this lesson, we're looking at the technique of Listing & Counting, in which we simply list all possible outcomes and them count those outcomes.

So, there aren't any sophisticated counting techniques involved here (like using the Fundamental Counting Principle, which involves multiplication)

## can you please explain how

## There's no way to solve this

There's no way to solve this question using the fundamental counting principle, unless we consider a crazy number of cases. The purpose of the question is to show the utility of listing and counting.

## I have one more question,

how many 3 digit number can be formed so that addition of 3 digit will yield 6. choose any digit out of 0,1,2,3,4,5,6.

please help me in understanding this.

## That question requires us to

That question requires us to use a technique known as partitioning, which is beyond the scope of the GRE.

If you're interested in learning more, see my response to the the following question: http://www.beatthegmat.com/very-tricky-counting-problem-t25349.html

## Add a comment