Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
23 Jun 2020, 07:39
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
55%
(hard)
Question Stats:
62% (01:56) correct
38%
(02:17)
wrong
based on 274
sessions
History
Date
Time
Result
Not Attempted Yet
For which of the following values of n will the remainder of 351^n and 352^n be the same when divided by 7?
I. 3
II. 4
III. 6
A. I only
B. II only
C. I and III only
D. II and III only
E. I, II, and III
Are You Up For the Challenge: 700 Level Questions
I. 3
II. 4
III. 6
A. I only
B. II only
C. I and III only
D. II and III only
E. I, II, and III
Are You Up For the Challenge: 700 Level Questions
yashikaaggarwal
Senior Moderator - Masters Forum
Joined: 19 Jan 2020
Last visit: 17 Jul 2025
Posts: 3,086
Given Kudos: 1,510
Location: India
Schools: Cranfield (A) Warwick MiM "23 (M)
GPA: 4
WE:Analyst (Internet and New Media)
23 Jun 2020, 08:07
Kudos
Bookmarks
To find : for what value of n the remainder of 351^n/7 And 352^n/7 is N
Solution: (350+1)^n/7 = 1^n/7
=> (350+2)^n/7 = 2^n/7
I. 3
=> 1^3 mod 7 = 1 as remainder
=> 2^3 mod 7 = 8 mod 7 = 1 as remainder. (Matching)
II. 4
=> 1^4 mod 7 = 1 as remainder
=> 2^4 mod 7 = 16 mod 7 = 2 as remainder. (Not Matching)
III. 6
=> 1^6 mod 7 = 1 as remainder
=> 2^6 mod 7 = 64 mod 7 = 1 as remainder. (Matching)
Only statement 1&3 are matching.
IMO C
Posted from my mobile device
Solution: (350+1)^n/7 = 1^n/7
=> (350+2)^n/7 = 2^n/7
I. 3
=> 1^3 mod 7 = 1 as remainder
=> 2^3 mod 7 = 8 mod 7 = 1 as remainder. (Matching)
II. 4
=> 1^4 mod 7 = 1 as remainder
=> 2^4 mod 7 = 16 mod 7 = 2 as remainder. (Not Matching)
III. 6
=> 1^6 mod 7 = 1 as remainder
=> 2^6 mod 7 = 64 mod 7 = 1 as remainder. (Matching)
Only statement 1&3 are matching.
IMO C
Posted from my mobile device
chrtpmdr
Current Student
Joined: 24 Jul 2019
Last visit: 05 Oct 2022
Posts: 202
Own Kudos:
Given Kudos: 161
Schools: HSG MBF "23 (A) UniBocconi MFin "23 (A)
GMAT 1: 730 Q46 V45
GPA: 3.9
30 Jul 2020, 03:09
Kudos
Bookmarks
Note that there is an inheritent pattern. Do solve such questions untimed, I usually look at the same principle tested with easier numbers.
Lets pick a number that gives a remainder of 2 when being divided by 7 -> 2
2 : 7-> R:2 let's replicate the pattern by raising the dividend by 2
4 : 7 -> R:4 first hint: the remainder was raised by 2 as well
8 : 7 -> R:1 if we would again raise the initial remainder by 3 (2^3) we would receive 8 as the remainder. As we are dividing by 7 we know that the remainder can never be greater or equal than the divisor, thus 8/7 -> R:1
16 : 7 -> R:2 at this point we should realize the patter 2-4-1
Same is applicable with 1 just that the remainder will always remain at one. We are thus looking for N such that it will result in a remainder of 1 for both expression. Remember that every 3rd remainder in the pattern was one. Thus we can safely assume that if n = 3 -> R:1 and if N = 6 -> R:1
Lets pick a number that gives a remainder of 2 when being divided by 7 -> 2
2 : 7-> R:2 let's replicate the pattern by raising the dividend by 2
4 : 7 -> R:4 first hint: the remainder was raised by 2 as well
8 : 7 -> R:1 if we would again raise the initial remainder by 3 (2^3) we would receive 8 as the remainder. As we are dividing by 7 we know that the remainder can never be greater or equal than the divisor, thus 8/7 -> R:1
16 : 7 -> R:2 at this point we should realize the patter 2-4-1
Same is applicable with 1 just that the remainder will always remain at one. We are thus looking for N such that it will result in a remainder of 1 for both expression. Remember that every 3rd remainder in the pattern was one. Thus we can safely assume that if n = 3 -> R:1 and if N = 6 -> R:1
