Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 27 Jun 2016, 00:58

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

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

 post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
Director
Joined: 29 Jul 2006
Posts: 874
Followers: 3

Kudos [?]: 49 [0], given: 0

If n is the sum of all the divisors of 2^50 that are greater [#permalink]

### Show Tags

13 Aug 2007, 09:37
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

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...
Senior Manager
Joined: 04 Jun 2007
Posts: 346
Followers: 1

Kudos [?]: 24 [0], given: 0

Re: divisors of 2^50 [#permalink]

### Show Tags

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.
Current Student
Joined: 28 Dec 2004
Posts: 3385
Location: New York City
Schools: Wharton'11 HBS'12
Followers: 14

Kudos [?]: 237 [0], given: 2

Re: divisors of 2^50 [#permalink]

### Show Tags

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.
Manager
Joined: 08 Jan 2007
Posts: 67
Location: D.C.
Followers: 1

Kudos [?]: 1 [0], given: 0

### Show Tags

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.
Director
Joined: 03 May 2007
Posts: 886
Schools: University of Chicago, Wharton School
Followers: 6

Kudos [?]: 121 [0], given: 7

Re: divisors of 2^50 [#permalink]

### Show Tags

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.
Intern
Joined: 01 Feb 2006
Posts: 2
Followers: 0

Kudos [?]: 0 [0], given: 0

### Show Tags

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
Senior Manager
Joined: 13 May 2007
Posts: 250
Followers: 2

Kudos [?]: 10 [0], given: 0

### Show Tags

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
Manager
Joined: 27 May 2007
Posts: 128
Followers: 1

Kudos [?]: 10 [0], given: 0

### Show Tags

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.
Manager
Joined: 20 Dec 2004
Posts: 179
Followers: 2

Kudos [?]: 17 [0], given: 0

### Show Tags

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.
_________________

Regards

Subhen

Director
Joined: 03 May 2007
Posts: 886
Schools: University of Chicago, Wharton School
Followers: 6

Kudos [?]: 121 [0], given: 7

### Show Tags

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.
Manager
Joined: 29 May 2007
Posts: 97
Followers: 2

Kudos [?]: 2 [0], given: 0

### Show Tags

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
Manager
Joined: 20 Mar 2007
Posts: 62
Followers: 1

Kudos [?]: 12 [0], given: 0

Re: divisors of 2^50 [#permalink]

### Show Tags

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?
Senior Manager
Joined: 28 Jun 2007
Posts: 462
Followers: 3

Kudos [?]: 6 [0], given: 0

### Show Tags

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
Director
Joined: 29 Jul 2006
Posts: 874
Followers: 3

Kudos [?]: 49 [0], given: 0

Re: divisors of 2^50 [#permalink]

### Show Tags

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.
Senior Manager
Joined: 04 Jun 2007
Posts: 346
Followers: 1

Kudos [?]: 24 [0], given: 0

Re: divisors of 2^50 [#permalink]

### Show Tags

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
Manager
Joined: 08 Oct 2006
Posts: 215
Followers: 1

Kudos [?]: 7 [0], given: 0

### Show Tags

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.
Manager
Joined: 06 Jul 2007
Posts: 57
Followers: 1

Kudos [?]: 18 [0], given: 0

### Show Tags

15 Aug 2007, 15:02
Yupp, it gotta be A.
OG has similar questions with solutions exactly like Fistail has given.
A   [#permalink] 15 Aug 2007, 15:02
Display posts from previous: Sort by

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

 post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group and phpBB SEO 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®.