Last visit was: 26 Apr 2026, 06:01 It is currently 26 Apr 2026, 06:01
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
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 26 Apr 2026
Posts: 109,836
Own Kudos:
Given Kudos: 105,893
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,836
Kudos: 811,359
 [16]
2
Kudos
Add Kudos
14
Bookmarks
Bookmark this Post
avatar
BigFatBassist
Joined: 27 Dec 2015
Last visit: 03 Jun 2017
Posts: 4
Own Kudos:
7
 [2]
Given Kudos: 3
Concentration: Statistics, Operations
GMAT 1: 730 Q48 V42
GMAT 1: 730 Q48 V42
Posts: 4
Kudos: 7
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
pkk1611
Joined: 23 Apr 2015
Last visit: 24 Aug 2018
Posts: 1
Posts: 1
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
davedekoos
Joined: 09 Jul 2013
Last visit: 07 Nov 2025
Posts: 96
Own Kudos:
347
 [3]
Given Kudos: 11
Posts: 96
Kudos: 347
 [3]
1
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
pkk1611
can you please explain the difference between without repetition and with repetition in permutation and combination means

Hi pkk,

In permutations and combinations, if repetition is allowed, then each event is independent from one another. For example, if we are picking a 4 digit code from the numbers 0-9 WITH repetition, then for each selection we can pick any number for each digit. The choices made for the first digit will not affect the choice for the second, third and fourth digits. In this case, the number of permutations would be \(10^4\). If we're dealing with combinations (where the order doesn't matter) (i.e. the code 1123 is equivalent to the code 3112, etc.), then the number of combinations is \(\frac{(r+n-1)!}{(r!)(n-1)!}\), where r is the number of digits in our code, and n is the amount of different numbers we can choose (0-9). So in this example the number of combinations with replacement is: \(\frac{(4+10-1)}{(4!)(10-1)!}=\frac{13!}{(4!)(9!)}\).

If repetition is not allowed, then each choice made restricts the subsequent choices. In our example, if I were to choose a code of 4 digits without repeating any digits, then the total permutations would be 10!/6! = 10*9*8*7. In other words, I can choose any number for the first digit, any of the 9 remaining numbers for the second digit, any of the 8 remaining numbers for the third digit, and any of the 7 remaining numbers for the last digit.

If we're talking about combinations (order is not important), then we just have to take into account all the ways a group of 4 numbers can be arranged, which is 4!. So the number of combinations without replacement would be \(\frac{10!}{(6!)(4!)}\).

For a nice detailed explanation with more examples, check out
https://www.mathsisfun.com/combinatorics ... tions.html


Cheers,
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,733
Own Kudos:
36,466
 [4]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,733
Kudos: 36,466
 [4]
1
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
Bunuel
The password for a computer account has to consist of exactly eight characters. Characters can be chosen from any of the following: letter of the alphabet, numerical digits from 0 to 9, a hyphen, or the exclamation mark. Upper-case letters (e.g., A) are considered different from lower-case letters (e.g., a), and characters can be repeated. Given these rules, how many different passwords are possible?

A. 2^9
B. 2^14
C. 2^18
D. 2^40
E. 2^48

Note: there are 64 characters to choose from: (26 lowercase letters + 26 uppercase letters + 10 digits + 1 hyphen + 1 exclamation mark = 64)

Take the task of creating a password and break it into stages.

Stage 1: Select the 1st character
We can complete stage 1 in 64 ways

Stage 2: Select the 2nd character
We can complete stage 2 in 64 ways

Stage 3: Select the 3rd character
We can complete stage 3 in 64 ways
.
.
.
.
Stage 8: Select the 8th character
We can complete stage 8 in 64 ways

By the Fundamental Counting Principle (FCP), we can complete all 8 stages (and thus create an 8-character code) in (64)(64)(64)(64)(64)(64)(64)(64) ways
This is the same as 64^8, but this is not one of the answer choices.

So, replace 64 with 2^6 to get:
64^8 = (2^6)^8
= 2^48
= E

Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. For more information about the FCP, watch our free video: https://www.gmatprepnow.com/module/gmat-counting/video/775

Cheers,
Brent
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,987
Own Kudos:
Posts: 38,987
Kudos: 1,118
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
109836 posts
Tuck School Moderator
852 posts