Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Dec 1310:00 AM EST
-12:00 PM EST
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.
Dec 1411:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test.- Dec 15
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Dec 1608:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes!
13 Apr 2017, 16:09
Kudos
Bookmarks
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?
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?
17 Apr 2017, 20:26
Kudos
Bookmarks
TauriDragon
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?
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.
23 Apr 2017, 11:45
Kudos
Bookmarks
Thank You extensively. Will aide Legal Litigations in defence of Falsely Accused, Persecuted100% Innocence.
Thanks Any All for Present Reply
as Well as Subsequently added Concurrence, corrections, or suggestions.
Thanks Any All for Present Reply
as Well as Subsequently added Concurrence, corrections, or suggestions.
