Oct 20 07:00 AM PDT  09:00 AM PDT Get personalized insights on how to achieve your Target Quant Score. Oct 22 09:00 AM PDT  10:00 AM PDT Watch & learn the Do's and Don’ts for your upcoming interview Oct 22 08:00 PM PDT  09:00 PM PDT On Demand for $79. For a score of 4951 (from current actual score of 40+) AllInOne Standard & 700+ Level Questions (150 questions) Oct 23 08:00 AM PDT  09:00 AM PDT Join an exclusive interview with the people behind the test. If you're taking the GMAT, this is a webinar you cannot afford to miss! Oct 26 07:00 AM PDT  09:00 AM PDT Want to score 90 percentile or higher on GMAT CR? Attend this free webinar to learn how to prethink assumptions and solve the most challenging questions in less than 2 minutes. Oct 27 07:00 AM EDT  09:00 AM PDT Exclusive offer! Get 400+ Practice Questions, 25 Video lessons and 6+ Webinars for FREE. Oct 27 08:00 PM EDT  09:00 PM EDT Strategies and techniques for approaching featured GMAT topics. One hour of live, online instruction
Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 58434

If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
27 Dec 2016, 09:01
Question Stats:
64% (01:58) correct 36% (02:19) wrong based on 369 sessions
HideShow timer Statistics
If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n? A. 6 B. 5 C. 4 D. 3 E. 2
Official Answer and Stats are available only to registered users. Register/ Login.
_________________




Current Student
Joined: 15 Dec 2016
Posts: 5
Location: India
GPA: 3

If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
27 Dec 2016, 11:41
There is repetitive pattern for remainders. (2^1)/3  Remainder is 2 (2^2)/3  Remainder is 1 (2^3)/3  Remainder is 2, and so on. So for even powers, remainder is 1. Therefore remainder for (2^50)/3 is 1. Similarly, we can observe a pattern for remainders when divided by 5. (2^1)/5  Remainder is 2 (2^2)/5  Remainder is 4 (2^3)/5  Remainder is 3 (2^4)/5  Remainder is 1 (2^5)/5  Remainder is 2 (2^6)/5  Remainder is 4 (2^7)/5  Remainder is 3 We can see that there is a pattern of 2,4,3,1. So remainder for (2^15)/5 is 3. Therefore m+n = 1+3 = 4. Option C is the right answer. This is my first answer on a forum. If it helped you out, please leave a kudos.




Senior Manager
Joined: 13 Oct 2016
Posts: 359
GPA: 3.98

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
27 Dec 2016, 10:53
Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 2 = 1 (mod 3)\(\frac{2^{50}}{3} = \frac{(1)^{50}}{3} = \frac{1}{3}\) remainder 1 \(2^4\) = 1 (mod 5)\(\frac{(2^4)^3*2^3}{5} = \frac{1*8}{5}\) remainder 3 1 + 3 = 4 Answer C



Board of Directors
Status: QA & VA Forum Moderator
Joined: 11 Jun 2011
Posts: 4774
Location: India
GPA: 3.5
WE: Business Development (Commercial Banking)

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
27 Dec 2016, 11:53
Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 \(\frac{2^4}{3}\) = Remainder 1 So, \(2^{50} = 2^{4*12}*2^2\) Now, \(\frac{2^2}{3}\) = Remainder 1 So, m = 1 \(\frac{2^4}{5}\) = Remainder 1 So, \(2^{15} = 2^{4*3}*2^3\) \(\frac{2^3}{5}\) = Remainder 3 So, n = 3 Hence, \(m + n = 1 + 3 = 4\) Hence, Correct answer will be (C) 4
_________________



Intern
Joined: 04 Jan 2017
Posts: 11

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
15 Jan 2017, 04:03
Hi,
I don´t quite understand the following
243243 = Remainder 1 So, 250=24∗12∗22250=24∗12∗22
Now, 223223 = Remainder 1
So, m = 1
245245 = Remainder 1 So, 215=24∗3∗23215=24∗3∗23
235235 = Remainder 3
So, n = 3
Hence, m+n=1+3=4m+n=1+3=4
Can anyone expand the explanation?
Thanks



Manager
Joined: 28 Jul 2016
Posts: 132

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Mar 2017, 06:12
KatariaP wrote: There is repetitive pattern for remainders. (2^1)/3  Remainder is 2 (2^2)/3  Remainder is 1 (2^3)/3  Remainder is 2, and so on. So for even powers, remainder is 1. Therefore remainder for (2^50)/3 is 1. Similarly, we can observe a pattern for remainders when divided by 5. (2^1)/5  Remainder is 2 (2^2)/5  Remainder is 4 (2^3)/5  Remainder is 3 (2^4)/5  Remainder is 1 (2^5)/5  Remainder is 2 (2^6)/5  Remainder is 4 (2^7)/5  Remainder is 3 We can see that there is a pattern of 2,4,3,1. So remainder for (2^15)/5 is 3. Therefore m+n = 1+3 = 4. Option C is the right answer. This is my first answer on a forum. If it helped you out, please leave a kudos. Great solution! Thanks!



Target Test Prep Representative
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 8117
Location: United States (CA)

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
31 Mar 2017, 12:33
Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 Let’s determine the remainder pattern when 2 raised to an exponent is divided by 3. (2^1)/3 = 0 remainder 2 (2^2)/3 = 4/3 = 1 remainder 1 (2^3)/3 = 8/3 = 2 remainder 2 (2^4)/3 = 16/3 = 5 remainder 1 When 2 is raised to an even exponent and is divided by 3, a remainder of 1 results. Thus, 2^50 divided by 3 has a remainder of 1. Next we can determine the remainder when 2^15 is divided by 5. To do so, we recall that the units digit of any number divided by 5 will produce the same remainder as when the actual number is divided by 5. Thus, let’s determine the units digit of 2^15. The pattern of units digits of the base of 2 when raised to an exponent is: 2^1 = 2 2^2 = 4 2^3 = 8 2^4 = 6 2^5 = 2 We see the pattern is 2486, and furthermore that 2^4k, in which k is a positive integer, will always have a units digit of 6. Thus, the units digit of 2^16 = 6 and so the units digit of 2^15 = 8. Dividing 8 by 5 yields a remainder of 3; thus, dividing 2^15 by 5 also yields a remainder of 3. Therefore, m + n = 3 + 1 = 4. Answer: C
_________________
5star rated online GMAT quant self study course See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews If you find one of my posts helpful, please take a moment to click on the "Kudos" button.



eGMAT Representative
Joined: 04 Jan 2015
Posts: 3074

If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
31 Mar 2017, 14:13
Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 Solution Solution • When \(2^{50}\) is divided by \(3\) the remainder is n. Let us find this “\(n\)”.
o \(\frac{2^{50}}{3} = \frac{(2^2)^{25}}{30} = \frac{4^{25}}{3}\)
o We know when 4 is divided by 3, the remainder is 1.
o Thus \(n = [\frac{4^{25}}{3}]_R = (1^{25}) = 1\) • When \(2^{15}\) is divided by \(5\), the remainder is \(m\).
o \(\frac{2^{15}}{5} = \frac{[(2^4)^3 * 2^3]}{5}\)
o We know that when 16 is divided by 5 the remainder 1 and 8 divided by 5, the remainder is 3
o Thus, \(m = [\frac{16^3}{5}]_R * [\frac{8}{5}]_R = 1 * 3 = 3\) • Therefore, \(m+n = 1 + 3 = 4\)
• Correct answer is Option C. Thanks, Saquib Quant Expert eGMATAiming to score Q50 or higher in GMAT Quant? Attend this webinar on 2nd April to learn a structured approach to solve 700+ Number Properties question in less than 2 minutes. Register
_________________



Intern
Joined: 01 Jun 2015
Posts: 41
Location: India

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
06 Apr 2018, 11:38
243243 = Remainder 1 So, 250=24∗12∗22250=24∗12∗22
Now, 223223 = Remainder 1
So, m = 1
245245 = Remainder 1 So, 215=24∗3∗23215=24∗3∗23
235235 = Remainder 3
So, n = 3



Intern
Joined: 02 Oct 2016
Posts: 24

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
08 Apr 2018, 06:50
2 = 1 (mod 3)
2503=(−1)503=132503=(−1)503=13 remainder 1
2424 = 1 (mod 5)
(24)3∗235=1∗85(24)3∗235=1∗85 remainder 3
1 + 3 = 4
Answer C



Intern
Joined: 12 Jul 2017
Posts: 33

If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 09:50
Hello VeritasPrepKarishma and mikemcgarry, I solved this problem by identifying the pattern however my error was that i started from 2^0 thus resulting in a different numbering of the sequence. When to consider starting from the zero pattern and when not to? Thank you.



Retired Moderator
Joined: 25 Feb 2013
Posts: 1178
Location: India
GPA: 3.82

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 10:09
afa13 wrote: Hello VeritasPrepKarishma and mikemcgarry, I solved this problem by identifying the pattern however my error was that i started from 2^0 thus resulting in a different numbering of the sequence. When to consider starting from the zero pattern and when not to? Thank you. Hi afa13if you are solving this question using the remainder pattern method and you are starting with \(2^0\), then note that \(2^0=1\) and \(\frac{1}{3}\), the remainder will be \(1\) and next \(2^1=2\) when divided by 3 will have a remainder of 2 and so on can you explain what sequence you were getting with your method



eGMAT Representative
Joined: 04 Jan 2015
Posts: 3074

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 10:21
afa13 wrote: Hello VeritasPrepKarishma and mikemcgarry, I solved this problem by identifying the pattern however my error was that i started from 2^0 thus resulting in a different numbering of the sequence. When to consider starting from the zero pattern and when not to? Thank you. Hey afa13, Ideally in a remainder question, one should never start with 0 as power. Because any number raised to 0 will be equal to 1 and any number which divides 1 (other than 1 itself) always gives the remainder as 1. For example: \(\frac{1}{20}\) = 1 , \(\frac{1}{21}\)= 1 So, whenever you want to solve a reminder question to find the pattern, always start from 1 as \(x^0\)changes the number. We want the pattern with 2 in this case... \(2^0\) is not 2..hence we won't be able to see the pattern. Hope this helps. Regards
_________________



Intern
Joined: 12 Jul 2017
Posts: 33

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 10:32
Hi niks18, I was getting the same pattern1212 and 1243 but since i was starting with 2^0 instead of 2^1 m and n changed. I should have gotten 2121 and 2431 patterns. But as EgmatQuantExpert, not to start with 0. Thanks niks18 and EgmatQuantExpert for answering.



VP
Joined: 07 Dec 2014
Posts: 1224

If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 11:22
Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 there are 4 units digit values for the exponent cycle of 2: 2,4,8,6 50/4 gives remainder of 2➡2nd value in cycle is 4 remainder of 4/3=1=n 15/4 gives a remainder of 3➡3rd value in cycle is 8 remainder of 8/5=3=m 3+1=4 C



Intern
Joined: 24 Apr 2016
Posts: 30

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 11:50
EgmatQuantExpert wrote: Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 Solution Solution • When \(2^{50}\) is divided by \(3\) the remainder is n. Let us find this “\(n\)”.
o \(\frac{2^{50}}{3} = \frac{(2^2)^{25}}{30} = \frac{4^{25}}{3}\)
o We know when 4 is divided by 3, the remainder is 1.
o Thus \(n = [\frac{4^{25}}{3}]_R = (1^{25}) = 1\) • When \(2^{15}\) is divided by \(5\), the remainder is \(m\).
o \(\frac{2^{15}}{5} = \frac{[(2^4)^3 * 2^3]}{5}\)
o We know that when 16 is divided by 5 the remainder 1 and 8 divided by 5, the remainder is 3
o Thus, \(m = [\frac{16^3}{5}]_R * [\frac{8}{5}]_R = 1 * 3 = 3\) • Therefore, \(m+n = 1 + 3 = 4\)
• Correct answer is Option C. Thanks, Saquib Quant Expert eGMATAiming to score Q50 or higher in GMAT Quant? Attend this webinar on 2nd April to learn a structured approach to solve 700+ Number Properties question in less than 2 minutes. Register EgmatQuantExpert  thanks for sharing this solution. Looks like you did the following: 1) Reduce the problem by converting the base to numbers greater than the divisor 2) Find the remainder when these base(s) are divided by the divisor 3) multiplied the remainders together Is there somewhere I can learn more about this method of solving remainder problems?



Intern
Joined: 01 Jun 2015
Posts: 41
Location: India

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 12:58
apply rule of cyclicity. m+n would be 4.



eGMAT Representative
Joined: 04 Jan 2015
Posts: 3074

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
29 Apr 2018, 12:59
dracobook wrote: EgmatQuantExpert wrote: Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 Solution Solution • When \(2^{50}\) is divided by \(3\) the remainder is n. Let us find this “\(n\)”.
o \(\frac{2^{50}}{3} = \frac{(2^2)^{25}}{30} = \frac{4^{25}}{3}\)
o We know when 4 is divided by 3, the remainder is 1.
o Thus \(n = [\frac{4^{25}}{3}]_R = (1^{25}) = 1\) • When \(2^{15}\) is divided by \(5\), the remainder is \(m\).
o \(\frac{2^{15}}{5} = \frac{[(2^4)^3 * 2^3]}{5}\)
o We know that when 16 is divided by 5 the remainder 1 and 8 divided by 5, the remainder is 3
o Thus, \(m = [\frac{16^3}{5}]_R * [\frac{8}{5}]_R = 1 * 3 = 3\) • Therefore, \(m+n = 1 + 3 = 4\)
• Correct answer is Option C. Thanks, Saquib Quant Expert eGMATAiming to score Q50 or higher in GMAT Quant? Attend this webinar on 2nd April to learn a structured approach to solve 700+ Number Properties question in less than 2 minutes. Register EgmatQuantExpert  thanks for sharing this solution. Looks like you did the following: 1) Reduce the problem by converting the base to numbers greater than the divisor 2) Find the remainder when these base(s) are divided by the divisor 3) multiplied the remainders together Is there somewhere I can learn more about this method of solving remainder problems? Hey dracobookWe teach these concepts in our live sessions and concept files...which our paid students can access. However, in short, you can follow these steps to solve any remainder question: 1 Look for a power p, such that N^p when divided by D, gives remainder 1 or 1 2 Once you have that..see much power is still left to resolve. For example: In this case, if we have \(2^{51}\) instead of \(2^{50}\), we would have had \((2^2)^{25}\) * \(2^1\), which means we will get 1 * \(2^1\) Finally, we multiply remainders to get our answer. Note: There can be some slight variations also..which I have not mentioned here. Give us some time..we will try to write a short article on this and you can also buy our quant course to learn more about Number Properties and other topics. Regards, Ashutosh eGMAT
_________________



Director
Joined: 09 Mar 2018
Posts: 994
Location: India

Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
Show Tags
03 Feb 2019, 10:55
Bunuel wrote: If n is the remainder when 2^50 is divided by 3 and m is the remainder when 2^15 is divided by 5, what is m + n?
A. 6 B. 5 C. 4 D. 3 E. 2 2^n follows the unit digit cyclicity as 2 4 8 16 Now 2^15 will have 3 as remainder, m 2^50 will have 1 as remainder,n C
_________________
If you notice any discrepancy in my reasoning, please let me know. Lets improve together.
Quote which i can relate to. Many of life's failures happen with people who do not realize how close they were to success when they gave up.




Re: If n is the remainder when 250 is divided by 3 and m is the remainder
[#permalink]
03 Feb 2019, 10:55






