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

It is currently 22 Oct 2014, 15:21

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If n is an integer and n^4 is divisible by 32, which of the

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Current Student
avatar
Joined: 28 Dec 2004
Posts: 3403
Location: New York City
Schools: Wharton'11 HBS'12
Followers: 13

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

If n is an integer and n^4 is divisible by 32, which of the [#permalink] New post 12 Sep 2005, 12:18
If n is an integer and n^4 is divisible by 32, which of the following could be the remainder when n is divided by 32?

(A) 2
(B) 4
(C) 5
(D) 6
(E) 10
Senior Manager
Senior Manager
avatar
Joined: 29 Nov 2004
Posts: 486
Location: Chicago
Followers: 1

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

 [#permalink] New post 12 Sep 2005, 12:27
EDITED

will go with 4, take 4^4 is divisible by 32 and 4/32 gives reminder 4...

I went about in a wierd way that i cannot explain...but i took less than a minute....
_________________

Fear Mediocrity, Respect Ignorance


Last edited by ranga41 on 13 Sep 2005, 05:40, edited 1 time in total.
Manager
Manager
avatar
Joined: 14 Jul 2005
Posts: 105
Location: Sofia, Bulgaria
Followers: 1

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

 [#permalink] New post 12 Sep 2005, 13:44
I agree with ranga's answer, although I have to note that 28/32 gives a remainder of 28. I just started picking numbers and ended up with 4 as the first positive integer, whose 4th power is divisible by 32.

I tried to come up with a more mathematical explanation and this is the best I can offer:

n^4 is divisible by 32, so n^4 = 2^5 * x, where x is some not so random integer
n = 2 * ((2*x)^(1/4))

For n to be an integer, x must be equal to (2^3)*y, where y is some positive number, whose quad root is an integer. If we take the simplest case where y=1, n=2 * ((2^4)^(1/4)) = 4

So 4 is the smallest + integer, whose 4th power is divisible by 32.
VP
VP
avatar
Joined: 22 Aug 2005
Posts: 1128
Location: CA
Followers: 1

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

 [#permalink] New post 12 Sep 2005, 15:55
ans is 4. Here is how i got it.

n ^ 4 is diisible by 32 or 2 ^ 5.

now for this to happen each n, when factorised, should have 2^n where n > 1

So the modified question become:
find remainder when 2 ^ n (n > 1) is divided by 32 or
2 ^ n % 32, n > 1

clearly remainders can be 2^2, 2^3, 2^4 or 4, 8, 16
SVP
SVP
User avatar
Joined: 05 Apr 2005
Posts: 1735
Followers: 3

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

 [#permalink] New post 12 Sep 2005, 17:34
B. 4 should be correct. because n^4 is divided by 32 if n is at least 4 or multiple of 4. 6, 10 doesnot work for n because n^4 is not divided by 32 evenly. so, if n=4, then n divided by 32 leavs 4 as reminder.
Current Student
avatar
Joined: 28 Dec 2004
Posts: 3403
Location: New York City
Schools: Wharton'11 HBS'12
Followers: 13

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

 [#permalink] New post 12 Sep 2005, 19:34
you guys make this look soo eazy...how many of you did this in under 2 mins? I must say you guys are great...I think if you can do this in under 1 min...you are math is definetly solid...

OA is 4...

it took me 4 mins...to figure this out... :(

n^4=32*m where m is an integer...

so we can break 32 down to its prime factors...2^5....

n^4=2^5 * m...so we know that n is at the least has 2^2 as its prime factor...

think of it like, if n^4 was equal to 2^4 then we know that n=2m....right!

anyway back to the problem

so n at a minimum is 4...

so we now get

4x=32m+c (where m is an integer, c is an integer and is meant to be a reminader)

so in order for x to be an integer...

x=8m+c/4 (c has to be 4 or a multiple of it!)

4 it is...

not sure..if what i did makes sense but I get the same ans as you...which so happens to be the OA...will post OE as soon as I get it...

so lets do 4/32 what is the remainder
  [#permalink] 12 Sep 2005, 19:34
    Similar topics Author Replies Last post
Similar
Topics:
2 Experts publish their posts in the topic If n is an integer, is n + 4 a prime number? metallicafan 6 18 Nov 2011, 09:15
14 Experts publish their posts in the topic If n is an integer and n^4 is divisible by 32, which of the mustdoit 13 03 Mar 2010, 00:35
When n^4 is divided by 32 the remainder is 0. If n is mbaorbust08 5 19 Nov 2007, 15:39
if k and n are integers, is n divisible by 7? 1. n-3=2k 2. bmwhype2 4 03 May 2007, 22:35
Display posts from previous: Sort by

If n is an integer and n^4 is divisible by 32, which of the

  Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

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