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

 It is currently 15 Dec 2019, 20:36

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

# Interesting Applications of Remainders

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

### Hide Tags

e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Interesting Applications of Remainders  [#permalink]

### Show Tags

Updated on: 25 Nov 2018, 21:45
1
6
Added the PDF of the article at the end of the post!

Interesting Applications of Remainders

Agenda of the article
The topic of remainders has a very wide range of application in the GMAT examination. One may get direct questions as well as questions as an application of the conceptual learnings of remainders.

This is the 2nd article on the topic of remainders and its applications. If you have not read the previous article, we recommend you read that first before going through this article.

To read the article: Common Mistakes One Must Avoid in Remainders

Objective of the article
The primary objective of this article is to:

• Demonstrate 2 specific cases, where we use the concepts of remainders in different ways to determine the answer.

In the explanation, we have considered the cases with the help of two different questions and discussed their solution using different methods to demonstrate the important takeaways.

Case 1

The context
While finding the remainder when a generic expression is divided by a certain number, many of us resort to the conventional way of applying properties of remainders of certain numbers to figure out the final answer. Although this is certainly the correct method to solve the question, sometimes we can get the answer using a simpler and time-saving approach.

Let us take the first example and understand the same.

Question
P is a two-digit number with exactly two factors. What is the remainder when $$(P^2 – 1)$$ is divided by 6?
A. 0
B. 1
C. 2
D. 4
E. 5

Understanding the Question
Let us read the question stem first and draw all the pertinent inferences from the given information.

In this question, we are given that P is two-digit number, with exactly two factors.
• Now, if P has exactly two factors, can we specify anything about P?
• Yes, we can. We know that a number with exact two factors is nothing but a prime number.
o Hence, we can say that P is a two-digit prime number.

• Can we make any other inferences?
o Yes, we can also say that P is an odd number, as any prime number greater than 2 is always an odd number.

Now, we need to find out the remainder, when $$P^2 – 1$$ is divided by 6.

We can solve this question in more than one way – let’s discuss them one-by-one.

Method 1
In this approach, we will use the general property of any prime number greater than 3.

We know that if we have a prime number greater than 3, we can express that number in 6k + 1 or 6k – 1 form, where k is a positive integer.

As P is a two-digit prime number, we can also express P in the form 6k + 1 or 6k – 1.

Case 1: P = 6k +1
• $$P^2 = (6k + 1)^2 = 36k^2 + 12k + 1$$
Or, $$P^2 – 1 = 36k^2 + 12k$$
Or, $$P^2 – 1 = 6 * (6k^2 + 2k)$$

We can see that $$P^2 – 1$$ is a multiple of 6. Hence, if we divide $$P^2 – 1$$ by 6, the remainder will be 0.

Case 2: P = 6k – 1
• $$P^2 = (6k – 1)^2 = 36k^2 – 12k + 1$$
Or, $$P^2 – 1 = 36k^2 – 12k$$
Or, $$P^2 – 1 = 6 * (6k^2 – 2k)$$

We can see that $$P^2 – 1$$ is a multiple of 6. Hence, if we divide $$P^2 – 1$$ by 6, the remainder will be 0.

Therefore, we can see that whether P is 6k + 1 or 6k – 1, the remainder when $$P^2 – 1$$ is divided by 6 is always 0.

Hence, the correct answer is option A.

Now, let’s solve the same question using a different approach.

Method 2
This method is much simpler and more intuitive. Here we don’t need to know any specific property of prime numbers to solve the question.

If we look at the option choices, we are given five definite numbers and no option says the answer cannot be determined.
• Hence, we can definitely say that for any value of P, our answer will be always same, right?
o So, let’s try to find the remainder, using some values of P.

We know that P is a two-digit prime number. Let’s assume P = 11.
• So, $$P^2 – 1$$ = $$11^2 – 1$$ = $$121 – 1$$ = $$120$$

Now, 120 is divisible by 6, hence, if $$P^2 – 1$$ is divided by 6, the remainder is 0.

Let’s try the same with a different value of P.

Assume that P = 19.
• So, $$P^2 – 1$$ = $$19^2 – 1$$ = $$361 – 1$$ = $$360$$

Again, 360 is divisible by 6, hence, if $$P^2 – 1$$ is divided by 6, the remainder is 0.

As we can see, for any value of P, the remainder when $$P^2 – 1$$ is divided by 6 is always 0.

Hence, the correct answer choice is option A.

Case 2

The context
There are some specific cases of remainders, where we can apply our conceptual learning from other topics and find the solution in a faster way. Let’s see that in the following example.

Question
What is the remainder when $$2^{2020}$$ is divided by 5?
A. 0
B. 1
C. 2
D. 3
E. 4

Understanding the Question
This remainder question belongs to one of the most conventional question types which is tested very frequently in the GMAT.

In this question, we are asked to find out the remainder, when the number $$2^{2020}$$ is divided by 5. We will solve it in two ways – let’s start discussing the first method.

Method 1
In our first method, we will use the conventional process of finding out the remainder.

As we are dividing $$2^{2020}$$ by 5, we will first try to find out the value of one such power of 2, which can be expressed in the form 5k + 1 or 5k – 1.
• From observation, we can say that $$2^4$$ is 16, which is 5 x 3 + 1.
o Hence, we can say that if we divide $$2^4$$ by 5, we get a remainder 1.

Now, we can express the given numerator in the form of $$2^4$$.
• $$2^{2020}$$ can be written as $$(2^4)^{505}$$.
• So, the remainder when $$2^{2020}$$ is divided by 5 will be same as the remainder when $$(2^4)^{505}$$ is divided by 5.
o Or, in other words, the remainder will be same when $$(1)^{505}$$ is divided by 5.
• As $$(1)^{505}$$ is equal to 1, we can say the final remainder is 1.

Hence, the correct answer choice is option B.

Important Observation
Some of us may have questioned that is it really necessary to express $$2^{2020}$$ in terms of $$2^4$$ only? What happens if we express $$2^{2020}$$ in terms of any other power of 2?
• Well, we can express the numerator in terms of other powers of 2 also. In such cases the calculation may differ and becomes lengthier, but the end result will always be the same. Let’s see how we can get that.

Assume that we have expressed $$2^{2020}$$ in terms of $$2^3$$. Hence, we can write $$2^{2020}$$ as $$(2^3)^{673}$$ x 2.

Now, we know, when $$2^3$$ is divided by 5, the remainder is 3.
• Hence, we can rewrite the numerator as $$(3^{673}) * 2$$.

We also know that, $$3^2$$, when divided by 5, gives a remainder 1.
• So, we can write $$(3^{673}) * 2$$ as $$(3^2)^{336} * 3 * 2$$ or $$(1)^{336} * 3 * 2$$, which is equal to 6.
• Now, if we divide 6 by 5, we get a remainder 1.

Hence, the correct answer choice is option B.

So, we can see that we can get the correct answer even if we express the numerator in other forms, apart from the conventional form of (denominator * k ± 1) form. However, the number of steps and the calculation involved may increase in such cases.

Method 2
Now, this method is specific to the values given in the question and may not be generalized for every remainder problem.

In this question, we are asked to find the remainder, when $$2^{2020}$$ is divided by 5.

First, let us see what remainders we get when we divide different powers of 2 by 5.
• Remainder $$(\frac{2^1}{5})$$ = Remainder ($$\frac{2}{5}$$) = 2
• Remainder $$(\frac{2^2}{5})$$ = Remainder ($$\frac{4}{5}$$) = 4
• Remainder $$(\frac{2^3}{5})$$ = Remainder ($$\frac{8}{5}$$) = 3
• Remainder $$(\frac{2^4}{5})$$ = Remainder ($$\frac{16}{5}$$) = 1
• Remainder $$(\frac{2^5}{5})$$ = Remainder ($$\frac{32}{5}$$) = 2
• Remainder $$(\frac{2^6}{5})$$ = Remainder ($$\frac{64}{5}$$) = 4
• Remainder $$(\frac{2^7}{5})$$ = Remainder ($$\frac{128}{5}$$) = 3
• Remainder $$(\frac{2^8}{5})$$ = Remainder ($$\frac{256}{5}$$) = 1
• Remainder $$(\frac{2^9}{5})$$ = Remainder ($$\frac{512}{5}$$) = 2
• Remainder $$(\frac{2^{10}}{5})$$ = Remainder ($$\frac{1024}{5}$$) = 4 and so on…

Observation 1
Remainder can be calculated just by dividing the units digit of the number by 5. [For example, Remainder $$(\frac{2^8}{5})$$ = Remainder ($$\frac{256}{5}$$) = Remainder ($$\frac{6}{5}$$) = 1]
This is always true when we divide any number either by 5 or by 10. While calculating the remainder, we can only find the units digit of the numerator and divide the units digit by 5 or 10, to get the answer.
• For example, $$2^{2020}$$ has a units digit 6. If 6 is divided by 5, the remainder is 1. Hence, the remainder when $$2^{2020}$$ is divided by 5 is 1.

Observation 2
The value of the remainder follows a particular cycle and gets repeated after every 4th power. [For example, remainder is same for $$2^1$$, $$2^5$$, $$2^9$$ and so on…]
• As the remainder gets repeated after every 4th power, we can express the numerator in a cycle of 4.
• $$2^{2020}$$ can be written as $$(2^4)^{505}$$. Now, we know that when $$2^4$$ is divided by 5, the remainder is 1. Hence, we can also say that when $$(2^4)^{505}$$ is divided by 5, the remainder is also 1.

So, we have seen that we can find the answer from different possible methods by using our concept of remainders. Let’s now consolidate our learning in the form of final takeaways.

Key Takeaways from the article
• If we have a general expression given, then the expression is true for any valid number. For example, any prime number greater than 3 can be expressed as 6k ± 1, where k is a positive integer.
• Sometimes we can get our answer easily by substituting proper values in the general expression.
• To find the remainder when we divide a number by 5 or 10, we need to check for the unit digit of the number only.
o For the divisor 5, we need to divide the unit digit by 5 to get the remainder.
o For the divisor 10, the unit digit of the number is the remainder.

• If we try to find the remainder when a number of the form an is divided by b, we generally express the number in the numerator in the form (denominator * k ± 1). However, we can still get the correct answer if we express the numerator in any other form, apart from ‘± 1’ form – in such case, the calculation may become a bit lengthy.

Want to read more articles like this?

Now, if you liked this article, then I am sure that you want to read some more articles like this.

To read all our article go here:

You will also get a lot of practice questions to learn from.

Happy learning.
Attachments

Interesting Applications of Remainders.pdf [439.5 KiB]
Downloaded 98 times

 To download please login or register as a user

_________________

Originally posted by EgmatQuantExpert on 21 Nov 2018, 03:37.
Last edited by EgmatQuantExpert on 25 Nov 2018, 21:45, edited 7 times in total.
Intern
Joined: 29 Aug 2016
Posts: 24
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

21 Nov 2018, 23:44
1
Kindly add the PDF.

Thank you.
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

21 Nov 2018, 04:06
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

22 Nov 2018, 00:56
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

25 Nov 2018, 17:53
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

25 Nov 2018, 21:47
Intern
Joined: 29 Aug 2016
Posts: 24
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

25 Nov 2018, 21:53
thank youuuuuuuuuuuuuuuuuuuuuuuuuuuuu
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

13 Dec 2018, 00:57
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

15 Dec 2018, 06:46
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Interesting Applications of Remainders  [#permalink]

### Show Tags

19 Dec 2018, 11:27
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

01 Jan 2019, 23:02
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

28 Mar 2019, 00:46
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

31 Mar 2019, 22:16
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

03 Apr 2019, 21:27
e-GMAT Representative
Joined: 04 Jan 2015
Posts: 3158
Re: Interesting Applications of Remainders  [#permalink]

### Show Tags

07 Apr 2019, 06:18
Re: Interesting Applications of Remainders   [#permalink] 07 Apr 2019, 06:18
Display posts from previous: Sort by

# Interesting Applications of Remainders

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

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne