GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 19 Oct 2018, 10:46

### 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

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

# Just want to ask question, rather gain clarity.

Author Message
Intern
Joined: 13 Apr 2017
Posts: 3

### Show Tags

13 Apr 2017, 15:42
Registered to obtain anonymous input, clarity for upcoming litigations.
Given a 'Sequential' descriptive label of, 17 character positions; each position 's Allowable Character 'Pool' limited to: A-Z, a-z, 0-9 (62 'n' values).

For one label, 4 values and their positions are known. 1st pos = a; 4th pos = 5; 10th pos = a; 15th po= Z, (though I think this irrelevant to solve the question)
How many complete unique 'label variations' can there be with these existing values in these positions?

Considering that Order matters & Repetitive or duplicating characters is allowed (1st & 10th pos exemplifies).
Facts: Pool: as Set 'n' = 62 ::
Ordered SubSet as 'x'= 13
[17 total - 4 known values leaves 13 positions left open]
Calculative Formula:: n^x // 62^13

Neither Combination nor Permutation? Nor complicated. Yeilded results May be 'listed' by filling ing vacancies from left to right in order.
This seems too easy to me, others want to twist it up in details & 'encourage' others to do same.

Isn't it obvious that the more 'known' values/locations the closer to Probable match to any one specific label?
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 6390
GMAT 1: 760 Q51 V42
GPA: 3.82

### Show Tags

19 Apr 2017, 00:01
TauriDragon wrote:
Registered to obtain anonymous input, clarity for upcoming litigations.
Given a 'Sequential' descriptive label of, 17 character positions; each position 's Allowable Character 'Pool' limited to: A-Z, a-z, 0-9 (62 'n' values).

For one label, 4 values and their positions are known. 1st pos = a; 4th pos = 5; 10th pos = a; 15th po= Z, (though I think this irrelevant to solve the question)
How many complete unique 'label variations' can there be with these existing values in these positions?

Considering that Order matters & Repetitive or duplicating characters is allowed (1st & 10th pos exemplifies).
Facts: Pool: as Set 'n' = 62 ::
Ordered SubSet as 'x'= 13
[17 total - 4 known values leaves 13 positions left open]
Calculative Formula:: n^x // 62^13

Neither Combination nor Permutation? Nor complicated. Yeilded results May be 'listed' by filling ing vacancies from left to right in order.
This seems too easy to me, others want to twist it up in details & 'encourage' others to do same.

Isn't it obvious that the more 'known' values/locations the closer to Probable match to any one specific label?

The area of this question is a repeated permutation.
The number of combinations is $$m^n$$, where $$m$$ is the number of choices and $$n$$ is the number of times to choose.

Generally speaking, since you understand a principle of repeated permutations, you feel this question is easy.
_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only \$99 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"

Re: Just want to ask question, rather gain clarity. &nbs [#permalink] 19 Apr 2017, 00:01
Display posts from previous: Sort by

# Just want to ask question, rather gain clarity.

Moderator: souvonik2k

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.