Last visit was: 23 Apr 2024, 20:53 It is currently 23 Apr 2024, 20:53

Close

GRE Prep 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 GRE 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
User avatar
Retired Moderator
Joined: 07 Jun 2014
Posts: 4810
Own Kudos [?]: 10616 [9]
Given Kudos: 0
GRE 1: Q167 V156
WE:Business Development (Energy and Utilities)
Send PM
Most Helpful Community Reply
Retired Moderator
Joined: 10 Apr 2015
Posts: 6218
Own Kudos [?]: 11679 [10]
Given Kudos: 136
Send PM
General Discussion
User avatar
Retired Moderator
Joined: 07 Jun 2014
Posts: 4810
Own Kudos [?]: 10616 [0]
Given Kudos: 0
GRE 1: Q167 V156
WE:Business Development (Energy and Utilities)
Send PM
User avatar
Manager
Manager
Joined: 19 Nov 2018
Posts: 102
Own Kudos [?]: 157 [0]
Given Kudos: 0
Send PM
Re: n is a positive integer. The remainder when 5n is divided by [#permalink]
1
You could just write out \(\frac{5n}{4}\) and then write out values using different values of n, until you found a remainder of 3. Then you could use that value of n to find A, and then compare it to B. Ex. if n = 3 then you have 15/4 which is equal to 3 with a remainder of 3 (mixed fraction of 3 and 3/4 expresses this). Then plug in 3 for 10n/4 in the second part and you get 30/4 = 7 R2 (same idea is expressed by mixed fraction 7 2/4). So, based on that the answer is C.

One might ask, is this always true? What about other values of n with a R2? It happens to be true, but my method doesn't show it. Brent's did. The method I used gives a reasonable guess, I think, of the right answer.

Originally posted by arc601 on 15 Sep 2019, 13:43.
Last edited by arc601 on 09 Jun 2020, 21:06, edited 2 times in total.
Verbal Expert
Joined: 18 Apr 2015
Posts: 28620
Own Kudos [?]: 33099 [0]
Given Kudos: 25173
Send PM
Re: n is a positive integer. The remainder when 5n is divided by [#permalink]
Expert Reply
Post A Detailed Correct Solution For The Above Questions And Get A Kudos.
Question From Our New Project: GRE Quant Challenge Questions Daily - NEW EDITION!
avatar
Manager
Manager
Joined: 15 May 2020
Posts: 91
Own Kudos [?]: 73 [0]
Given Kudos: 0
Send PM
Re: n is a positive integer. The remainder when 5n is divided by [#permalink]
2
5n = mult(4) + 3; 3 is the remainder

10 n = 5n * 2 = [mult(4) + 3] * 2 = mult(4) + 6 = mult(4) + 2

So, the remainder is always 2.
Moderator
Moderator
Joined: 02 Jan 2020
Status:GRE Quant Tutor
Posts: 1085
Own Kudos [?]: 883 [1]
Given Kudos: 9
Location: India
Concentration: General Management
Schools: XLRI Jamshedpur, India - Class of 2014
GMAT 1: 700 Q51 V31
GPA: 2.8
WE:Engineering (Computer Software)
Send PM
n is a positive integer. The remainder when 5n is divided by [#permalink]
1
The remainder when 5n is divided by 4 is 3

Theory: Dividend = Divisor*Quotient + Remainder

5n -> Dividend
4 -> Divisor
a -> Quotient (Assume)
3 -> Remainders
=> 5n = 4*a + 3 = 4a + 3

Quantity A: The remainder when 10n is divided by 4

10n = 2*5n = 2*(4a + 3) = 8a + 6 = 4*2a + 4 + 2 = 4*(2a + 1) + 2
=> 10n when divided by 4 gives 2a + 1 as quotient and 2 as remainder

Clearly, Quantity A(2) = Quantity B(2)

So, Answer will be C
Hope it helps!

Watch the following video to learn the Basics of Remainders

Manager
Manager
Joined: 10 Feb 2023
Posts: 76
Own Kudos [?]: 13 [0]
Given Kudos: 172
Send PM
Re: n is a positive integer. The remainder when 5n is divided by [#permalink]
GreenlightTestPrep wrote:
sandy wrote:
n is a positive integer.
The remainder when 5n is divided by 4 is 3.

Quantity A
Quantity B
The remainder when 10n is divided by 4
2


There's a nice rule that say, "If N divided by D equals Q with remainder R, then N = DQ + R"
For example, since 17 divided by 5 equals 3 with remainder 2, then we can write 17 = (5)(3) + 2
Likewise, since 53 divided by 10 equals 5 with remainder 3, then we can write 53 = (10)(5) + 3


The remainder when 5n is divided by 4 is 3
Applying the above rule, we get: 5n = 4k + 3 (for some integer k)
Divide both sides by 5 to get: n = (4k + 3)/5

Quantity A: The remainder when 10n is divided by 4
Replace n with (4k + 3)/5 to get: 10n = 10((4k + 3)/5) = 8k + 6
If 10n = 8k + 6, what is the remainder when 8k + 6 is divided by 4?
Notice that 8k + 6 = 8k + 4 + 2
= 4(2k + 1) + 2
As we can see, 4(2k + 1) is a MULTIPLE OF 4
This means that 4(2k + 1) + 2 is 2 greater than a MULTIPLE OF 4
So, if we divide 4(2k + 1) + 2 by 4, the remainder will be 2
We get....
Quantity A: 2
Quantity B: 2

Answer:
Show: ::
C


RELATED VIDEO


Hi Brent GreenlightTestPrep
In this type of remainder question, to clarify does it mean we should never add/combine any numbers as in below line?

"This means that 4(2k + 1) + 2 is 2 greater than a MULTIPLE OF 4"

As I have add 2 + 1 = 3 ( Remainder). Therefore A > B.
Prep Club for GRE Bot
[#permalink]
Moderators:
Moderator
1085 posts
GRE Instructor
218 posts

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