Last visit was: 04 Jun 2024, 13:17 It is currently 04 Jun 2024, 13:17
Decision Tracker
My Rewards
Unanswered
Active Topics
New posts
New comers' posts
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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel

If n is the sum of all the divisors of 2^50 that are greater

User avatar
vineetgupta
Senior Manager
Senior Manager
Joined: 29 Jul 2006
Posts: 379
Own Kudos [?]: 1277 [0]
Given Kudos: 0
Send PM
If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 09:37
If n is the sum of all the divisors of 2^50 that are greater than 10, what is the units digit of n?

(A) 2 (B) 4 (C) 6 (D) 8 (E) 0
Can someone explain this one...



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
User avatar
sumande
Manager
Manager
Joined: 04 Jun 2007
Posts: 144
Own Kudos [?]: 82 [0]
Given Kudos: 0
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 10:35
vineetgupta wrote:
If n is the sum of all the divisors of 2^50 that are greater than 10, what is the units digit of n?

(A) 2 (B) 4 (C) 6 (D) 8 (E) 0
Can someone explain this one...


I get A for this one.

The divisors of 2^5 that are greater than 10 are 2^4, 2^5 and so on up to 2^50. Their sum will be
n = 2^4+2^5+2^6+...+2^50
or, n = 2^4*(1+2+2^2+2^3+...+2^46)
or, n = 2^4*(2^47-1)/(2-1) = 2^4*(2^47-1)

Units digit of (2^47-1) will be (8-1) = 7.
So, units digit of n = units digit of (2^4 * 7) = (16*7) = 2.
User avatar
FN
Current Student
Joined: 28 Dec 2004
Posts: 1579
Own Kudos [?]: 644 [0]
Given Kudos: 2
Location: New York City
Concentration: Social Enterprise
Schools:Wharton'11 HBS'12
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 10:48
brilliant!!!

can you explain the bolded piece please..thanks

sumande wrote:
vineetgupta wrote:
If n is the sum of all the divisors of 2^50 that are greater than 10, what is the units digit of n?

(A) 2 (B) 4 (C) 6 (D) 8 (E) 0
Can someone explain this one...


I get A for this one.

The divisors of 2^5 that are greater than 10 are 2^4, 2^5 and so on up to 2^50. Their sum will be
n = 2^4+2^5+2^6+...+2^50
or, n = 2^4*(1+2+2^2+2^3+...+2^46)
or, n = 2^4*(2^47-1)/(2-1) = 2^4*(2^47-1)

Units digit of (2^47-1) will be (8-1) = 7.
So, units digit of n = units digit of (2^4 * 7) = (16*7) = 2.
User avatar
VAGMAT
Intern
Intern
Joined: 08 Jan 2007
Posts: 27
Own Kudos [?]: 2 [0]
Given Kudos: 0
Location: D.C.
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 10:49
Not sure I understand the question correctly, but if I take a shot at it...

the units digit seem to be repeating every four times {2,4,8,6,2,4,8,6 etc.}
so with that said, I think the answer is B! The units digit should be 4.
User avatar
Fistail
Senior Manager
Senior Manager
Joined: 03 May 2007
Posts: 333
Own Kudos [?]: 1250 [0]
Given Kudos: 7
Concentration: Finance, Economics
Schools:University of Chicago, Wharton School
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 11:27
vineetgupta wrote:
If n is the sum of all the divisors of 2^50 that are greater than 10, what is the units digit of n?

(A) 2 (B) 4 (C) 6 (D) 8 (E) 0
Can someone explain this one...


A. I got 2 too but i would do differently.

2^1 = 2
2^2 = 4
2^3 = 8
2^4 = 16

2^5 = 32
2^6 = 64
2^7 = 128
2^8 = 256

2^9 = 512

we know the pattren is repeating after every 4th power.

so in 2^50, the pattren repeats 12 times and then still remains 2 more powers.

the sum of the unit digits of every 4 powers = 0. so 2^50 has a sum of 6 (2+4) but we need to take out 2, 4 and 8 from 6. so we substract 14 (2+4+8) from x6, then the unit digit is 2.
avatar
mdot
Intern
Intern
Joined: 01 Feb 2006
Posts: 1
Own Kudos [?]: [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 14:28
Using another approach, I got A as well.

2^50 = 2^5 * 2^10 = 2^5 * 2^5 * 2^2 = 32*32 + 32*4

Unitis Digits = (2*2) + (2*4) = 12; Units Digit = 2
User avatar
empty_spaces
Manager
Manager
Joined: 13 May 2007
Posts: 127
Own Kudos [?]: 226 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 15:05
mdot wrote:
Using another approach, I got A as well.

2^50 = 2^5 * 2^10 = 2^5 * 2^5 * 2^2 = 32*32 + 32*4

Unitis Digits = (2*2) + (2*4) = 12; Units Digit = 2



2^50 is not equal to 2^5 *2^10
User avatar
Robin in NC
Intern
Intern
Joined: 27 May 2007
Posts: 43
Own Kudos [?]: 24 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 16:27
VAGMAT wrote:
Not sure I understand the question correctly, but if I take a shot at it...

the units digit seem to be repeating every four times {2,4,8,6,2,4,8,6 etc.}
so with that said, I think the answer is B! The units digit should be 4.


That reasoning makes sense to me (the others are over my head). But I get a different answer. Since the question asks for the units digit for the sum of all those numbers, (48 numbers in all, 12 sets of 4), shouldn't the digit be 0, since the sum of 16, 32, 64, and 128 has a units digit of 0? Actually the sum of any 4 of the numbers in the series has a units digit of 0.
User avatar
subhen
Manager
Manager
Joined: 20 Dec 2004
Posts: 74
Own Kudos [?]: 28 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 16:47
I will go with C. The answer according to me is 6.

I agree with the approach of Fistail. However I differ from him in the last stmt. The question asks us to find the units digit of all divisors greater than 10 hence there is no reason why we need to subtract 2+4+8 from x6.
User avatar
Fistail
Senior Manager
Senior Manager
Joined: 03 May 2007
Posts: 333
Own Kudos [?]: 1250 [0]
Given Kudos: 7
Concentration: Finance, Economics
Schools:University of Chicago, Wharton School
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 17:23
subhen wrote:
I will go with C. The answer according to me is 6.

I agree with the approach of Fistail. However I differ from him in the last stmt. The question asks us to find the units digit of all divisors greater than 10 hence there is no reason why we need to subtract 2+4+8 from x6.


the question says factors grater than 10. so 2^1, 2^2 and 2^3 should not be included.
therefore 2, 4 and 8 needs to be subtracted from x.....x6.
User avatar
r0m3416
Intern
Intern
Joined: 29 May 2007
Posts: 35
Own Kudos [?]: 5 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 17:28
will go with C - The last two number's unit digit ought to be 2 and 4..so the units digit is 6
User avatar
Kiski
Intern
Intern
Joined: 20 Mar 2007
Posts: 25
Own Kudos [?]: 34 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 20:38
Fistail wrote:
vineetgupta wrote:
If n is the sum of all the divisors of 2^50 that are greater than 10, what is the units digit of n?

(A) 2 (B) 4 (C) 6 (D) 8 (E) 0
Can someone explain this one...


A. I got 2 too but i would do differently.

2^1 = 2
2^2 = 4
2^3 = 8
2^4 = 16

2^5 = 32
2^6 = 64
2^7 = 128
2^8 = 256

2^9 = 512

we know the pattren is repeating after every 4th power.

so in 2^50, the pattren repeats 12 times and then still remains 2 more powers.

the sum of the unit digits of every 4 powers = 0. so 2^50 has a sum of 6 (2+4) but we need to take out 2, 4 and 8 from 6. so we substract 14 (2+4+8) from x6, then the unit digit is 2.


I followed your reasoning till the statement ,"the sum of the unit digits of every 4 powers = 0".I dont quite follow this part,"so 2^50 has a sum of 6 (2+4) but we need to take out 2, 4 and 8 from 6. so we substract 14 (2+4+8) from x6, then the unit digit is 2".

Could you please explain?
User avatar
ioiio
Manager
Manager
Joined: 28 Jun 2007
Posts: 248
Own Kudos [?]: 11 [0]
Given Kudos: 0
 Q51  V38
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 20:45
2^50 = 1024 * 1024 * 1024 * 1024 * 1024 = x6 *x4 * x4 * x4 = x4 * x4 * x4 = x6 * x4 = x4

Ans : 4

edit : sorry dint even read the question fully.

2, 4, 8, 6 is the pattern.

Since it is greater than 10.. the pattern is x6, x2, x4, x8... You can see that there are 47 terms between 2 ^ 4 and 2^ 50. Each 4 term would lead to 0.

47 mod 4 = 3 => x6 + x2 + x4 = x2

Ans : 2
User avatar
vineetgupta
Senior Manager
Senior Manager
Joined: 29 Jul 2006
Posts: 379
Own Kudos [?]: 1277 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   13 Aug 2007, 22:05
sumande wrote:
vineetgupta wrote:
If n is the sum of all the divisors of 2^50 that are greater than 10, what is the units digit of n?

(A) 2 (B) 4 (C) 6 (D) 8 (E) 0
Can someone explain this one...


I get A for this one.

The divisors of 2^5 that are greater than 10 are 2^4, 2^5 and so on up to 2^50. Their sum will be
n = 2^4+2^5+2^6+...+2^50
or, n = 2^4*(1+2+2^2+2^3+...+2^46)
or, n = 2^4*(2^47-1)/(2-1) = 2^4*(2^47-1)

Units digit of (2^47-1) will be (8-1) = 7.
So, units digit of n = units digit of (2^4 * 7) = (16*7) = 2.


hi...I followed the same approach.

But made a silly mistake.
The OA is A....thanks.
User avatar
sumande
Manager
Manager
Joined: 04 Jun 2007
Posts: 144
Own Kudos [?]: 82 [0]
Given Kudos: 0
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   14 Aug 2007, 00:13
fresinha12 wrote:
brilliant!!!

can you explain the bolded piece please..thanks

sumande wrote:
vineetgupta wrote:
If n is the sum of all the divisors of 2^50 that are greater than 10, what is the units digit of n?

(A) 2 (B) 4 (C) 6 (D) 8 (E) 0
Can someone explain this one...


I get A for this one.

The divisors of 2^5 that are greater than 10 are 2^4, 2^5 and so on up to 2^50. Their sum will be
n = 2^4+2^5+2^6+...+2^50
or, n = 2^4*(1+2+2^2+2^3+...+2^46)
or, n = 2^4*(2^47-1)/(2-1) = 2^4*(2^47-1)

Units digit of (2^47-1) will be (8-1) = 7.
So, units digit of n = units digit of (2^4 * 7) = (16*7) = 2.


That is the Geometric Progression (a, a*r, a*r^2, a*r^3, and so on) sum. If a is the first term, r the common ratio and n the number of terms, then
sum = a*(r^n - 1)/(r-1); if r>1
or, sum = a*(1 - r^n)/(1-r); if r<1
User avatar
excelgmat
Manager
Manager
Joined: 08 Oct 2006
Posts: 101
Own Kudos [?]: 20 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   15 Aug 2007, 14:22
I go with A too.

I have a nonquant background so here's my attempt.

n = 2^4+2^5+2^6+...+2^50

if you add 2^4+2^4+2^5+2^6+2^7. the unit digits add up to 0.

multiple by 11 and you have added upto 2^47 with the digit 0 as total.
After that it is easy. Add 2^48+2^49+2^50. which is 6+2+4= 2. :)

But I like the formulae approach of sumande.
User avatar
somethingbetter
Intern
Intern
Joined: 06 Jul 2007
Posts: 38
Own Kudos [?]: 47 [0]
Given Kudos: 0
Send PM
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink] If n is the sum of all the divisors of 2^50 that are greater   15 Aug 2007, 15:02
Yupp, it gotta be A.
OG has similar questions with solutions exactly like Fistail has given.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
GMAT Club Bot
gmatclubot
Re: If n is the sum of all the divisors of 2^50 that are greater [#permalink]
15 Aug 2007, 15:02
Moderator:
yashikaaggarwal
Senior Moderator - Masters Forum
3131 posts