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

 It is currently 13 Dec 2019, 08:54

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

What is the sum of all 3 digit positive integers that can be formed us

Author Message
TAGS:

Hide Tags

VP
Joined: 08 Apr 2009
Posts: 1198
Concentration: General Management, Strategy
Schools: Duke (Fuqua) - Class of 2012
What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

29 Apr 2009, 01:06
14
81
00:00

Difficulty:

45% (medium)

Question Stats:

68% (01:44) correct 32% (01:49) wrong based on 1058 sessions

HideShow timer Statistics

What is the sum of all 3 digit positive integers that can be formed using the digits 1, 5, and 8, if the digits are allowed to repeat within a number?

A. 126
B. 1386
C. 3108
D. 308
E. 13986
Math Expert
Joined: 02 Sep 2009
Posts: 59721
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

02 Feb 2011, 03:37
13
1
44
craky wrote:
I sowe really good formula for solving this problem in some notes downloaded from this forum. I just cannot find it, so I appologize to the author.

The formula says:

Repetition allowed:
SUM of digits * (n^n-1)*(11111 ...number composed of n 1digits)

Repetition NOT allowed:
SUM of digits * (n-1)!*(11111 ...number composed of n 1digits)

Here we have 3 digits. n is 3.
Sum of digits 1+5+8=14

Repetition allowed:
14*(3^2)*111=13986

Repetition not allowed:
14*2*111=3108

It should be:

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)$$.

Similar questions:
nice-question-and-a-good-way-to-solve-103523.html
can-someone-help-94836.html
sum-of-all-3-digit-nos-with-88864.html
permutation-88357.html
_________________
Intern
Joined: 26 Apr 2009
Posts: 3
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

30 Apr 2009, 00:24
26
13
What is the sum of all 3 digit positive integers that can be formed using the digits 1, 5, and 8, if the digits are allowed to repeat within a number?

Imagine, we have got all these possible numbers written down - there are in total 3^3 numbers (each digit can be either 1 or 5 or 8)

there are 3*3 options for having a number XY1
there are 3*3 options for having a number XY5
there are 3*3 options for having a number XY8

there are 3*3 options for having a number X1Z
there are 3*3 options for having a number X5Z
there are 3*3 options for having a number X8Z

there are 3*3 options for having a number 1YZ
there are 3*3 options for having a number 5YZ
there are 3*3 options for having a number 8YZ

we can sum units, tens and hundreds independently:
summing units gives (1+5+8)*3*3
summing tens gives (1+5+8)*10*3*3
summing hundreds gives (1+5+8)*100*3*3
General Discussion
Intern
Joined: 26 Apr 2009
Posts: 3
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

29 Apr 2009, 06:24
13
8
E

summing
units (1+5+8)*9 +
tens (1+5+8)*9*10 +
hundreds (1+5+8)*9*100 =

= 126+1,260+12,600 = 13,986
Senior Manager
Joined: 23 Jun 2009
Posts: 283
Location: Turkey
Schools: UPenn, UMich, HKS, UCB, Chicago
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

29 Jun 2009, 04:49
26
8
There can be 27 numbers. Every digit has three possibilities because question permits repetition. So it becomes a very good summation problem.
If there are 27 digits. There are 27 hundred digits, 27 tens digit and 27 ones digit to be summed. Of 27 hundred digits, 9 of them are 1, 9 of them are 5 and the last 9 are 8. Same is true for the other two digits.
Thus the sum is:
9x100+9x500+9x800+9x10+9x50+9x80+9x1+9x5+9x8=
999x(1+5+8)=999x14=13986
E
Senior Manager
Joined: 23 Jun 2009
Posts: 283
Location: Turkey
Schools: UPenn, UMich, HKS, UCB, Chicago
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

29 Jun 2009, 07:01
4
Since problem permits repetition. There are 27 numbers that satisfies.
e.g.:
Lets say: first digit is 1, then numbers can be:
111
115
118
151
155
158
181
185
188
Same is true when first digits are 5 and 8. As you can see, there are nine 1 in first digit. Nine 5 in first digit. And nine 8 in first digit. Same is true for the other digits.
Manager
Joined: 15 May 2009
Posts: 137
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

29 Jun 2009, 14:08
2
maliyeci wrote:
Since problem permits repetition. There are 27 numbers that satisfies.
e.g.:
Lets say: first digit is 1, then numbers can be:
111
115
118
151
155
158
181
185
188
Same is true when first digits are 5 and 8. As you can see, there are nine 1 in first digit. Nine 5 in first digit. And nine 8 in first digit. Same is true for the other digits.

One more tip: when we add up all the numbers, we can start with the hundreds. We know each number (1, 5, & 8) will appear in the hundreds place a total of 9 times. So let's see how many hundreds we have.
1X9=9
5X9=45
8X9=72
Add this up we have a total of 126 hundreds, or also expressed as 12,600. We see that only one answer could possibly match the size of this sum, which is (E), so without calculating the exact sum, we already know (E) is the only possible choice. On a real test however, the writers could make life difficult by adding a few answer choices that are close to this sum (i.e. 11,950, or 14,088, etc).
Retired Moderator
Status: The last round
Joined: 18 Jun 2009
Posts: 1146
Concentration: Strategy, General Management
GMAT 1: 680 Q48 V34
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

29 Jun 2009, 22:30
1
maliyeci wrote:
There can be 27 numbers. Every digit has three possibilities because question permits repetition. So it becomes a very good summation problem.
If there are 27 digits. There are 27 hundred digits, 27 tens digit and 27 ones digit to be summed. Of 27 hundred digits, 9 of them are 1, 9 of them are 5 and the last 9 are 8. Same is true for the other two digits.
Thus the sum is:
9x100+9x500+9x800+9x10+9x50+9x80+9x1+9x5+9x8=
999x(1+5+8)=999x14=13986
E

Now these are my early days here. I even have some problems to use this site When I saw this squestion, I thought how is it possible to do that, to add twenty seven numbers, but thanks to maliyeci!!

I learned a new approach today to add numbers!! +1
_________________
Director
Joined: 03 Jun 2009
Posts: 637
Location: New Delhi
WE 1: 5.5 yrs in IT
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

29 Jun 2009, 23:29
3
maliyeci wrote:
There can be 27 numbers. Every digit has three possibilities because question permits repetition. So it becomes a very good summation problem.
If there are 27 digits. There are 27 hundred digits, 27 tens digit and 27 ones digit to be summed. Of 27 hundred digits, 9 of them are 1, 9 of them are 5 and the last 9 are 8. Same is true for the other two digits.
Thus the sum is:
9x100+9x500+9x800+9x10+9x50+9x80+9x1+9x5+9x8=
999x(1+5+8)=999x14=13986
E

Great ! Kudos to you.

Another approach is intelligent guess, based on which I would have opted E. Explanation:
Total possibilities = 3*3*3 =27
Now, taking examples of numbers starting with 8.
Sum of any four 3-digit numbers starting with 8 > 3200,

We know that there are 9 possible nos starting with 8 (apart form other 18 numbers), so sum would certainly be much much greater then 3200.

All other options, except E is less then 3200. (Btw, one can eliminate A, B and D on the 1st glance itself)
CEO
Joined: 17 Nov 2007
Posts: 2995
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

02 Jul 2009, 12:44
2
maliyeci, good aproach
+1

My take:
As we have equal probability for each digit to be included and total number of integers is 3^3=27, we can write our sum as:

S = 27 * (1+5+8)/3 * 111 = 14*999 = 14000 - 14 = 13986
_________________
HOT! GMAT Club Forum 2020 | GMAT ToolKit 2 (iOS) - The OFFICIAL GMAT CLUB PREP APPs, must-have apps especially if you aim at 700+
Manager
Joined: 28 Mar 2009
Posts: 59
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

14 Jul 2009, 09:15
walker wrote:
maliyeci, good aproach
+1

My take:
As we have equal probability for each digit to be included and total number of integers is 3^3=27, we can write our sum as:

S = 27 * (1+5+8)/3 * 111 = 14*999 = 14000 - 14 = 13986

Could you please explain how did you get 111?

Thanks.
CEO
Joined: 17 Nov 2007
Posts: 2995
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

14 Jul 2009, 13:27
skim wrote:
Could you please explain how did you get 111?

Thanks.

Of course,

(1+5+8)/3 - "average" digit.
(1+5+8)/3 * 111 - another way to write 3-digit number formed from "average digit": xyz = (1+5+8)/3 (1+5+8)/3 (1+5+8)/3 or (1+5+8)/3 * 111
_________________
HOT! GMAT Club Forum 2020 | GMAT ToolKit 2 (iOS) - The OFFICIAL GMAT CLUB PREP APPs, must-have apps especially if you aim at 700+
Manager
Joined: 11 Aug 2008
Posts: 112
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

14 Oct 2009, 18:47
6
I don't have your specific method but by POE I still can have E.
for 8xy alone we have 888,881,885,818,855,851,858,815,811. The total of them is larger than 7200 so there is only option E left
Manager
Joined: 09 May 2009
Posts: 149
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

30 Dec 2009, 03:47
1
3
there will 9 times 1 , 9 times 5 and nine times 8 at each place in a 3 digit no. with repetition

sum will be =100*9*(1+58) + 10*9*(1+5+8) + 1*9*(1+5+8)=13986

in order to know how it is 9 times

tot no. of ways =3*3*3=27
so in tot 27 words will be formed where each digit among 1,5,8 wil be repeated equal no. of times i.e 27/3=9
hence we have 9 , 1's ; 9 5's and 9 8's at each level
Intern
Joined: 23 Dec 2009
Posts: 35
Schools: HBS 2+2
WE 1: Consulting
WE 2: Investment Management
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

30 Dec 2009, 04:36
xcusemeplz2009 wrote:
there will 9 times 1 , 9 times 5 and nine times 8 at each place in a 3 digit no. with repetition

sum will be =100*9*(1+58) + 10*9*(1+5+8) + 1*9*(1+5+8)=13986

in order to know how it is 9 times

tot no. of ways =3*3*3=27
so in tot 27 words will be formed where each digit among 1,5,8 wil be repeated equal no. of times i.e 27/3=9
hence we have 9 , 1's ; 9 5's and 9 8's at each level

Wow. I have no idea what is happening here. Would you (or someone else) mind explaining a bit more...perhaps expounding on your method a little bit?

Perhaps, the same deal, with a two digit number using 1 and 2, with digits allowed to repeat?

How can I use xcusemeplz2009's method to arrive at the same answer?
_________________
My GMAT quest...

...over!
Manager
Joined: 09 May 2009
Posts: 149
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

30 Dec 2009, 06:34
3
R2I4D wrote:
Wow. I have no idea what is happening here. Would you (or someone else) mind explaining a bit more...perhaps expounding on your method a little bit?

Perhaps, the same deal, with a two digit number using 1 and 2, with digits allowed to repeat?

How can I use xcusemeplz2009's method to arrive at the same answer?

let me try again

let the no. be xyz
Place value of no will be 100x+10y+Z.............eqn 1

TOTAL NO OF WAYS IN WHICH WE CAN MAKE A NO. WITH GIVEN CONDITION IS 3*3*3=27( as digits are getting repeated)

now at unit place i.e Z if we fix 1 , then for y we have 3 options and for x we have 3 options , so total number where unit digit is one can be formed in 3*3=9 ways

similarly for other digits at unit place can be done in 9 ways

hence at unit place a digit is getting repeated 9 times

and in the same manner in tenths place repetion for all digits will be 9 each

now the task is to find the sum
sum of digits at z place is 9*1+9*5+9*8 , WHICH
IS SAME FOR Y AND X
for that we need to put all the options in eqn 1 format
i.e 100*9[1+5+8] + 10*9[1+5+8] + 9*[1+5+8]=13986

simple way is to remeber the quick formula to find out the repetition

find out tot no. ways in which the no. can be formed and divide it by the no. of digit , then mutiply this factor with the summation of all the dig and the place value

for second ex : 1,2

two dig no with repetn can be formewd in 2*2=4 ways , repetion factor=4/2 =2 ( tot no. of ways / tot no of dig)

sum=10(place value) * 2 (rep factor) *(1+2 summation of dig)+2*3=60+6=66
Manager
Joined: 22 Dec 2009
Posts: 242
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

01 Jan 2010, 11:06
2
Pretty impressive formula used by xcusemeplz2009. +1 for that!

Nevertheless the question can be solved with POE as it is quite logical....

digits in scope = 1,5,8..
with this we can get highest 3 or 4 numbers - 888, 885, 881, 858.
Adding just these 4 numbers gives us = 3512
and we have 23 more numbers to be added... Hence the correct answer would be E of course!

Cheers!
JT
Manager
Joined: 27 Jul 2010
Posts: 132
Location: Prague
Schools: University of Economics Prague
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

02 Feb 2011, 03:15
4
3
I sowe really good formula for solving this problem in some notes downloaded from this forum. I just cannot find it, so I appologize to the author.

The formula says:

Repetition allowed:
SUM of digits * (n^n-1)*(11111 ...number composed of n 1digits)

Repetition NOT allowed:
SUM of digits * (n-1)!*(11111 ...number composed of n 1digits)

Here we have 3 digits. n is 3.
Sum of digits 1+5+8=14

Repetition allowed:
14*(3^2)*111=13986

Repetition not allowed:
14*2*111=3108
Senior Manager
Joined: 13 Aug 2012
Posts: 397
Concentration: Marketing, Finance
GPA: 3.23
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

20 Dec 2012, 04:15
1
iwillwin wrote:
What is the sum of all 3 digit positive numbers that can be formed using the digits 1, 5, and 8, if the digits are allowed to repeat within a number?

A. 126

B. 1386

C. 3108

D. 308

E. 13986

Here is a formula to know the sum of possible arrangements when a digit is not allowed to repeat:

$$(n-1)!*sumofdigits*111 = (3-1)!*(1+5+8)*111=28*111=3108$$

But we know that digits are allowed to repeat. Thus, sum is much greater than 3108.

Intern
Joined: 02 Nov 2012
Posts: 27
Re: What is the sum of all 3 digit positive integers that can be formed us  [#permalink]

Show Tags

04 Jan 2013, 06:50
1
I approach this particular problem without the formulae. Can somebody please help me if this is correct --> If you know that the numbers are allowed to repeat then the possible numbers are 3*3*3 = 27 (instead of 3*2*1 when repetition is not allowed), then you know that there will be 9 ones, 9 fives, 9 eights. So for the first position you can have the 9+45+72 = 12600, then all the answer choices will fall except for E. If you calculate further you get 12600 + 01260 + 00126 = 13,986. Bunuel, Karishma or someone else can you please confirm if this is correct?
Re: What is the sum of all 3 digit positive integers that can be formed us   [#permalink] 04 Jan 2013, 06:50

Go to page    1   2    Next  [ 38 posts ]

Display posts from previous: Sort by