Last visit was: 20 Nov 2025, 01:26 It is currently 20 Nov 2025, 01:26
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
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,408
Own Kudos:
778,429
 [8]
Given Kudos: 99,987
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,408
Kudos: 778,429
 [8]
2
Kudos
Add Kudos
6
Bookmarks
Bookmark this Post
User avatar
vitaliyGMAT
Joined: 13 Oct 2016
Last visit: 26 Jul 2017
Posts: 297
Own Kudos:
875
 [3]
Given Kudos: 40
GPA: 3.98
Posts: 297
Kudos: 875
 [3]
1
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
avatar
manimechian
Joined: 05 Mar 2017
Last visit: 25 Jul 2017
Posts: 2
Own Kudos:
Given Kudos: 162
Posts: 2
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
vitaliyGMAT
Joined: 13 Oct 2016
Last visit: 26 Jul 2017
Posts: 297
Own Kudos:
875
 [4]
Given Kudos: 40
GPA: 3.98
Posts: 297
Kudos: 875
 [4]
3
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Hi

Linea congruencies and their systems is not the subject that can be thoroughly elucidated in just one post. Although addition, subtraction and multiplication are fairly straightforward, division requires taking into account common factor of a remainder, divisor and number itself. May be it wasn’t correct from my side to put such solution, because you don’t need linear congruencies to solve it.

Please refer to the following solution:

(1) When 8n is divided by 3, the remainder is odd.

In other words when 8n is divided by 3 the remainder is 1 (because 3 has only one odd remainder – 1).

Now: possible remainders are 0, 1 and 2.

(Remainder of 8) * (remainder of n) = 1.

The above equation can be achieved only in case when both 8 and n have same remainders 1 or 2 (1*1 = 1 or 2*2 = 4 = 1) Because 8 has remainder 2 upon division by 3, this leaves us with only one choice for the remainder of n – 2. Sufficient.

(2) When 5n is divided by 3, the remainder is odd.

Same logic for the second option. 5 has a remainder 2, hence n should also have remainder 2.

2*2 = 4 which has remainder 1 when divided by 3. Sufficient

Hope this helps and sorry for confusion.

Cheers

Vitaliy
User avatar
akshayk
Joined: 06 Jul 2016
Last visit: 21 Sep 2020
Posts: 273
Own Kudos:
Given Kudos: 99
Location: Singapore
Concentration: Strategy, Finance
Posts: 273
Kudos: 414
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
What is the remainder when integer n is divided by 3?

(1) When 8n is divided by 3, the remainder is odd.
(2) When 5n is divided by 3, the remainder is odd.

S1 -> 8n = 3P + r, r = odd numbers
3 can only have 0,1,2 as remainders => r = 1.
To try, plug in numbers.
40 = 3*13 + 1
64 = 3*31 + 1... and so on.
Sufficient.

S2 -> 5n = 3Q + r, r = odd numbers
3 can only have 0,1,2 as remainders => r = 1.
To try, plug in numbers
10 = 3*3 + 1
25 = 3*8 + 1
Sufficient.

Therefore, Answer is D.
N = PQ + R => IMO, this question is testing the property wherein R < P.
User avatar
Mo2men
Joined: 26 Mar 2013
Last visit: 09 May 2023
Posts: 2,439
Own Kudos:
Given Kudos: 641
Concentration: Operations, Strategy
Schools: Erasmus (II)
Products:
Schools: Erasmus (II)
Posts: 2,439
Kudos: 1,478
Kudos
Add Kudos
Bookmarks
Bookmark this Post
What is the remainder when integer n is divided by 3?

(1) When 8n is divided by 3, the remainder is odd.

The reminder is less the divisor. The only odd reminder possible is 1

8n = 3k + 1

Possible number of 8n:

1, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64

Green colored number gives Integer values for n as follows:

8n = 16....n=2.......Reminder when divided by 3 is 2

8n = 40....n=5.......Reminder when divided by 3 is 2

8n = 64....n =8.......Reminder when divided by 3 is 2

Always reminder is 2

Sufficient


(2) When 5n is divided by 3, the remainder is odd.

Use same numbers as above.

1, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64

Green colored number gives Integer values for n as follows:

5n = 10....n=2.......Reminder when divided by 3 is 2

5n = 25....n=5.......Reminder when divided by 3 is 2

5n = 40....n =8.......Reminder when divided by 3 is 2

Always reminder is 2

Sufficient

Answer: D
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,593
Own Kudos:
Posts: 38,593
Kudos: 1,079
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
Moderators:
Math Expert
105408 posts
496 posts