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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: Sum of all 3-digit nos with 1, 2 & 3 [#permalink]
07 Jan 2010, 01:56

1

This post received KUDOS

2

This post was BOOKMARKED

As nothing has been mentioned in the question, we'll assume that repetition of numbers are allowed. Hence the total number of 3 digit numbers that can be formed from 1,2,3 = 3*3*3 = 27.

Now out of these 27 numbers each of the digits 1,2,3 will occur at each of the hundred's, ten's and unit's position 9 times. e.g. starting from all the numbers having 1 in hundred position we have the following numbers - 111 112 113 121 122 123 131 132 133 Similar would be the sequence for numbers starting with 2 and 3 and if we count we'll find that 1,2,3 occurs at hundreds position 9 times each; at tens position 9 times each and at units position 9 times each. Hence the sum of all these 27 numbers = [(1+2+3) * 100 + (1+2+3) * 10 + (1+2+3) * 1 ] * 9 = 6 * 111 * 9 = 54 * 111 = 5994. Hope this clarifies or else I will elaborate it more. Thanks!

Re: Sum of all 3-digit nos with 1, 2 & 3 [#permalink]
07 Jan 2010, 03:29

Hey thnx. It helps.

But thr's another explanation:

No of such 3-digit nos = 27 (which is Ok) 1st no = 111, Last no = 333 (these r also Ok) Hence their average = (111 + 333)/2 = 222 (couldn't understand how this formula is applied. I thought this holds true for an AP series only) So, Sum = Number of nos X Average of the nos = 27 X 222 = 5994

Re: Sum of all 3-digit nos with 1, 2 & 3 [#permalink]
07 Jan 2010, 03:46

hi sudip what i can of think as a way is... total nos=3*3*3=27..... so sum will have 27 nos .... so each no 1,2,3 will be used (27/3)9 times in each digits place (hundreds,tens and ones) ...units digit=9*(1+2+3)=54, so 4.. tens digit=9*(1+2+3)=54(+5)=9, so 9.."+5" is the carried tens digit from 54 of step 1 hundreds digit=9*(1+2+3)=54(+5)=59, so the no is 5994..

Re: Sum of all 3-digit nos with 1, 2 & 3 (no repeat) [#permalink]
08 Jan 2010, 00:53

Thnx.

By the way, what happens to the same problem if we are not allowed to repeat any of the digits in any particular no formed from by the digits (i.e. 111 or 221 or 133 etc are not to be considered)?

Re: Sum of all 3-digit nos with 1, 2 & 3 [#permalink]
09 Jan 2010, 15:22

Expert's post

2

This post was BOOKMARKED

sudip135 wrote:

Q. Find the sum of all 3-digit nos that can be formed by 1, 2 and 3 (Ref: Kaplan. I didn't understand the explanation there. Can u pl help?)

GMAT will tell you in advance whether repetition is allowed or not. Or the wording will make it obvious.

Actually there is the direct formula for this kind of problems. Of course it's better to understand the concept, then to memorize the formula but in case someone is interested here it is:

1. Sum of all the numbers which can be formed by using the \(n\) digits without repetition is: (n-1)!*(sum of the digits)*(111…..n times).

2. Sum of all the numbers which can be formed by using the \(n\) digits (repetition being allowed) is: \(n^{n-1}\)*(sum of the digits)*(111…..n times). _________________

Re: Find the sum of all 3-digit nos that can be formed by 1, 2 [#permalink]
16 Jul 2014, 23:25

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________

Hello everyone! Researching, networking, and understanding the “feel” for a school are all part of the essential journey to a top MBA. Wouldn’t it be great... ...

As part of our focus on MBA applications next week, which includes a live QA for readers on Thursday with admissions expert Chioma Isiadinso, we asked our bloggers to...

Booth allows you flexibility to communicate in whatever way you see fit. That means you can write yet another boring admissions essay or get creative and submit a poem...