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

 It is currently 15 Aug 2018, 09:44

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

# remainder

 post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
Manager
Joined: 04 Sep 2006
Posts: 113
remainder  [#permalink]

### Show Tags

28 May 2009, 08:49
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

find the remainder when 5 ^ 37 / 63

--== Message from GMAT Club Team ==--

This is not a quality discussion. It has been retired.

If you would like to discuss this question please re-post it in the respective forum. Thank you!

To review the GMAT Club's Forums Posting Guidelines, please follow these links: Quantitative | Verbal Please note - we may remove posts that do not follow our posting guidelines. Thank you.
GMAT Instructor
Joined: 07 Jul 2003
Posts: 755
Location: New York NY 10024
Schools: Haas, MFE; Anderson, MBA; USC, MSEE
Re: remainder  [#permalink]

### Show Tags

28 May 2009, 13:18
vcbabu wrote:
find the remainder when 5 ^ 37 / 63

The answer is 5.

However the solution requires the knowledge that 5 and 63 are coprime to each other and the application of "Euler's Theorem".

This is not helpful for preparing people for the GMAT and only wastes valuable time for people who think there is a solution in the realm of GMAT-required knowledge.

Anybody can find hard problems on the internet. Quit trying to show off -- you're just wasting people's time.
_________________

Best,

AkamaiBrah
Former Senior Instructor, Manhattan GMAT and VeritasPrep
Vice President, Midtown NYC Investment Bank, Structured Finance IT
MFE, Haas School of Business, UC Berkeley, Class of 2005
MBA, Anderson School of Management, UCLA, Class of 1993

Manager
Joined: 04 Sep 2006
Posts: 113
Re: remainder  [#permalink]

### Show Tags

30 May 2009, 13:19
37 /4 remainder is 1

so 5^37/63 becomes 5/63 so remainder is 5 .

it is very much gmat problem. This come across during the prep of gmat.
GMAT Instructor
Joined: 07 Jul 2003
Posts: 755
Location: New York NY 10024
Schools: Haas, MFE; Anderson, MBA; USC, MSEE
Re: remainder  [#permalink]

### Show Tags

30 May 2009, 19:41
vcbabu wrote:
37 /4 remainder is 1

so 5^37/63 becomes 5/63 so remainder is 5 .

it is very much gmat problem. This come across during the prep of gmat.

Hmm. Please show me by what basic theorem (37 mod 4) = 1 implies that (5^37 mod 63) = (5 mod 63).
IMHO, that's a pretty big "hand wave."

And by what logic do you test 37 mod 4 in the first place?
_________________

Best,

AkamaiBrah
Former Senior Instructor, Manhattan GMAT and VeritasPrep
Vice President, Midtown NYC Investment Bank, Structured Finance IT
MFE, Haas School of Business, UC Berkeley, Class of 2005
MBA, Anderson School of Management, UCLA, Class of 1993

Intern
Joined: 30 May 2009
Posts: 12
Re: remainder  [#permalink]

### Show Tags

30 May 2009, 21:42
The answer is 5..

Guys, I do not understand how vcbabu solved it.. Neither do I know Eulers theorm or coprimes..

It is pretty straightforward..

5^3 = 125 .. and when 125 is divided by 63, the remainder is -1

=> 5^37/63
=> (5^36 * 5)/63
pls note that 5^36 will yield a remainder of 1 as it can be written as 5^(3*12)

so final remainder is 1 * 5 = 5

I didn't pick pen for this answer.. May be you have a better way to do it.. but I think this works as well..
GMAT Instructor
Joined: 07 Jul 2003
Posts: 755
Location: New York NY 10024
Schools: Haas, MFE; Anderson, MBA; USC, MSEE
Re: remainder  [#permalink]

### Show Tags

31 May 2009, 01:04
abhi750 wrote:
The answer is 5..

Guys, I do not understand how vcbabu solved it.. Neither do I know Eulers theorm or coprimes..

It is pretty straightforward..

5^3 = 125 .. and when 125 is divided by 63, the remainder is -1

=> 5^37/63
=> (5^36 * 5)/63
pls note that 5^36 will yield a remainder of 1 as it can be written as 5^(3*12)

so final remainder is 1 * 5 = 5

I didn't pick pen for this answer.. May be you have a better way to do it.. but I think this works as well..

This is actually a very clever solution which is actually a variation of the use of Euler's theorem. Forget about the fancy names -- in plain words, basically, if A and B do not have common factors (i.e., they are "coprime") then there exists an exponent n for which A^n / B will have remainder of 1.

For this problem, that number is 6 (the computation of which is beyond the scope of this forum). Hence if 5^6 mod 63 = 1 then 5^(6*6) mod 63 also has mod 1 and, similar to your reasoning, 5^(6*6 + 1) mod 63 = 5. You can determine that 5^6 mod 63 = 1, but that is quite difficult considering 125^2 is a five-figure number that you have to divide by 63.

Your solution is clever because most people (including me) are NOT taught to think of remainders in terms of negative numbers -- in fact, you are not guaranteed to find a remainder of -1 (though you will always find one of +1) and this works ONLY if the numbers do not have a common factor.

I still think this is too hard of a problem for the GMAT (need to accept concept of "negative remainder", need to apply some guesswork to find the exponent that yilds a remainder of -1 (which is not guaranteed) and understand that the remainder will alternate between -1 (or 62) and 1 for increasing multiples of 3 in the exponent), but perhaps i was wrong .

Whatever the case, kudos to you for solving this in a clever and straight forwad manner. Nice job.
_________________

Best,

AkamaiBrah
Former Senior Instructor, Manhattan GMAT and VeritasPrep
Vice President, Midtown NYC Investment Bank, Structured Finance IT
MFE, Haas School of Business, UC Berkeley, Class of 2005
MBA, Anderson School of Management, UCLA, Class of 1993

Intern
Joined: 12 May 2009
Posts: 45
Location: Mumbai
Re: remainder  [#permalink]

### Show Tags

01 Jun 2009, 05:53
5 ^ 37 = (5^(12*3) * 5)
5 ^ 3 = 125
125 / 63 = -1 (As per Eulers theorem)

5^3 and 5^36 will gave same reminder,
=> 1 * 5 = 5

Ans:5
Senior Manager
Joined: 16 Jan 2009
Posts: 339
Concentration: Technology, Marketing
GMAT 1: 700 Q50 V34
GPA: 3
WE: Sales (Telecommunications)
Re: remainder  [#permalink]

### Show Tags

01 Jun 2009, 10:23
This probelm is very difficult for GMAT.
Good one though.

Thanks for the explanation.

--== Message from GMAT Club Team ==--

This is not a quality discussion. It has been retired.

If you would like to discuss this question please re-post it in the respective forum. Thank you!

To review the GMAT Club's Forums Posting Guidelines, please follow these links: Quantitative | Verbal Please note - we may remove posts that do not follow our posting guidelines. Thank you.

_________________

Lahoosaher

Re: remainder &nbs [#permalink] 01 Jun 2009, 10:23
Display posts from previous: Sort by

# remainder

 post reply Question banks Downloads My Bookmarks Reviews Important topics

# Events & Promotions

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne 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®.