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

It is currently 25 Sep 2018, 00:17

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.

Close

Request Expert Reply

Confirm Cancel

All About Negative Remainders on the GMAT

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 49438
All About Negative Remainders on the GMAT  [#permalink]

Show Tags

New post 21 Jan 2015, 03:10
2
7
FROM Veritas Prep Blog: All About Negative Remainders on the GMAT
Image
I could have sworn that I had discussed negative remainders on my blog but the other day I was looking for a post discussing it and much as I would try, I could not find one. I am a little surprised since this concept is quite useful and I should have taken it in detail while discussing divisibility. Though we did have a fleeting discussion of it here.

Since we did miss it, we will discuss it in detail today but you must review the link given above before we proceed.

Consider this: When n is divided by 3, it leaves a remainder 1.

This means that when we divide n balls in groups of 3 balls each, we are left with 1 ball.

Image

This also means that n is 1 MORE than a multiple of 3. Or, it also means that n is 2 less than the next multiple of 3, doesn’t it?

Say, n is 16. When you split 16 balls into groups of 3 balls each, you get 5 groups of 3 balls each and there is one ball leftover. n is 1 more than a multiple of 3 (the multiple being 15). But we can also say that it is 2 LESS than the next multiple of 3 (which is 18). Hence, the negative remainder in this case is -2 which is equivalent to a positive remainder of 1.

Generally speaking, if n is divided by m and it leaves a remainder r, the negative remainder in this case is -(m – r).

When n is divided by 7, it leaves a remainder of 4. This is equivalent to a remainder of -3.

n is 3 more than a multiple of m. It is also 2 less than the next multiple of m. This means m is 5.

This concept is very useful to us sometimes, especially when the divisor and the remainder are big numbers.

Let’s take a question to see how.

Question 1: What is the remainder when 1555 * 1557 * 1559 is divided by 13?

(A)   0

(B)   2

(C)   4

(D)   9

(E)    11

Solution: Since it is a GMAT question (a question for which we will have no calculator), multiplying the 3 numbers and then dividing by 13 is absolutely out of question! There has to be another method.

Say n = 1555 * 1557 * 1559

When we divide 1555 by 13, we get a quotient of 119 (irrelevant to our question) and remainder of 8. So the remainder when we divide 1557 by 13 will be 8+2 = 10 (since 1557 is 2 more than 1555) and when we divide 1559 by 13, the remainder will be 10+2 = 12 (since 1559 is 2 more than 1557).

So n = (13*119 + 8)*(13*119 + 10)*(13*119 + 12) (you can choose to ignore the quotient and just write it as ‘a’ since it is irrelevant to our discussion)

So we need to find the remainder when n is divided by 13.

Note that when we multiply these factors, all terms we obtain will have 13 in them except the last term which is obtained by multiplying the constants together i.e. 8*10*12.

Since all other terms are multiples of 13, we can say that n is 8*10*12 (= 960) more than a multiple of 13. There are many more groups of 13 balls that we can form out of 960.

960 divided by 13 gives a remainder of 11.

Hence n is actually 11 more than a multiple of 13.

We did not use the negative remainders concept here. Let’s see how using negative remainders makes our calculations easier here. The remainder of 8, 10 and 12 imply that the negative remainders are -5, -3 and -1 respectively.

Now n = (13a – 5) * (13a – 3) * (13a – 1)

The last term in this case is -5*-3*-1 = -15

This means that n is 15 less than a multiple of 13 i.e. actually 2 less than a multiple of 13 because when you go back 13 steps, you get another multiple of 13. This gives us a negative remainder of -2 which means the positive remainder in this case will be 11.

Here we avoided some big calculations.

I will leave you now with a question which you should try to solve using negative remainders.

Question 2: What is the remainder when 3^(7^11) is divided by 5? (here, 3 is raised to the power (7^11))

(A) 0

(B) 1

(C) 2

(D) 3

(E) 4

Hint: I solved this question orally in a few secs using cyclicity and negative remainders. Don’t get lost in calculations!

Karishma, a Computer Engineer with a keen interest in alternative Mathematical approaches, has mentored students in the continents of Asia, Europe and North America. She teaches the GMAT for Veritas Prep and regularly participates in content development projects such as this blog!
ForumBlogs - GMAT Club’s latest feature blends timely Blog entries with forum discussions. Now GMAT Club Forums incorporate all relevant information from Student, Admissions blogs, Twitter, and other sources in one place. You no longer have to check and follow dozens of blogs, just subscribe to the relevant topics and forums on GMAT club or follow the posters and you will get email notifications when something new is posted. Add your blog to the list! and be featured to over 300,000 unique monthly visitors

_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

Veritas Prep GMAT Discount CodesKaplan GMAT Prep Discount CodesManhattan GMAT Discount Codes
Intern
Intern
avatar
B
Joined: 29 Nov 2014
Posts: 1
Re: All About Negative Remainders on the GMAT  [#permalink]

Show Tags

New post 22 Jan 2015, 22:23
7^x has 2 last digits following the circle: 07 - 49 - 43 - 01 - 07...
7^11 has 2 last digits: 43
Rem(43/4) = 3

3^x has the last digit following the circle: 3-9-7-1-3...
Then the last digit of 3^(7^11) = 7

Answer C
Manager
Manager
avatar
Joined: 04 Oct 2013
Posts: 155
Location: India
GMAT Date: 05-23-2015
GPA: 3.45
GMAT ToolKit User Premium Member Reviews Badge
Re: All About Negative Remainders on the GMAT  [#permalink]

Show Tags

New post 23 Jan 2015, 07:24
Question 2: What is the remainder when 3^(7^11) is divided by 5? (here, 3 is raised to the power (7^11))

(A) 0
(B) 1
(C) 2
(D) 3
(E) 4


The remainder \(\frac{(3^x)}{5}\),where \(x\) is an integer, has a pattern 3,4,2,1 ...and it repeats in cycle of 4.
This can be proved using the concept of negative remainder.
Remainder(3/5) =3
Remainder(\(\frac{(3^2)}{5}\))=Remainder[Remainder(3/5)*Remainder(3/5)/5]=Remainder[(-2)(-2)/5]=4
Remainder(\(\frac{(3^3)}{5}\))=Remainder [Remainder(3/5)*Remainder(3/5)*Remainder(3/5)/5]=Remainder[(-2)(-2)(-2)/5]=Remainder (-8/5)=-3=5+(-3)=2
Remainder(\(\frac{(3^4)}{5}\))=Remainder [Remainder(3/5)*Remainder(3/5)*Remainder(3/5)*Remainder(3/5)/5]=Remainder[(-2)(-2)(-2)(-2)/5]=Remainder (16/5)=1
.
.

Remainder(7^11/4)=(-1)^11=-1=4-1=3
Remainder(3^(7^11)/5)=Remainder(3^(Remainder(7^11/4))/5)=Remainder(3^3/5)=Remainder((-2)(-2)(-2)/5)=Remainder(-8/5)=-3=5-3=2

Answer: (C)
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 49438
Re: All About Negative Remainders on the GMAT  [#permalink]

Show Tags

New post 04 Feb 2015, 09:09
Non-Human User
User avatar
Joined: 09 Sep 2013
Posts: 8176
Premium Member
Re: All About Negative Remainders on the GMAT  [#permalink]

Show Tags

New post 01 Jul 2018, 17:58
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

GMAT Club Bot
Re: All About Negative Remainders on the GMAT &nbs [#permalink] 01 Jul 2018, 17:58
Display posts from previous: Sort by

All About Negative Remainders on the GMAT

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  

Events & Promotions

PREV
NEXT


Copyright

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

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