BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

If n^m leaves a remainder of 1 after division by 7 for all

Expert replies
by BTGmoderatorLU » Wed Jun 27, 2018 1:08 pm

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty

If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to:

A. 2
B. 3
C. 4
D. 5
E. 6

The OA is E.

I solved this PS question like this, as 7 is a prime number and n can only take values which are not multiples of 7 so, n and 7 will be coprime hence as per Fermat little theorem value of m will be 7 - 1 = 6 for any value of n which are not multiples of n.

Can someone explain another way to solve this PS question? Thanks!
Join the discussion
Source: — Problem Solving |

by Vincen » Thu Jun 28, 2018 2:39 am
Hello BTGmoderatorLU.

I would solve it as follows.

Since the statement must be true for all values of n that are not multiples of 7, then I picked n=3.

Now, let's try the values of m.

If m=2 then 3^2 = 9, remainder 2. Out.

If m=3 then 3^3 = 27, remainder 6. Out.

If m=4 then 3^4 = 81, remainder 4. Out.

If m=5 then 3^5 = 243, remainder 5. Out.

If m=6 then 3^6 = 729, remainder 1. Correct.

So, the correct answer is the option E.

I hope it helps you. <i class="em em-smiley"></i>
Join the discussion

by Jeff@TargetTestPrep » Mon Jul 02, 2018 9:07 am
BTGmoderatorLU wrote:If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to:

A. 2
B. 3
C. 4
D. 5
E. 6
Let's test each answer choice.

A. m = 2

If n = 2, we see that 2^2/7 = 4/7 = 0 R 4, so m could not be 2.

B. m = 3

If n = 3, we see that 3^3/7 = 27/7 = 3 R 6, so m could not be 3.

C. m = 4

If n = 2, we see that 2^4/7 = 16/7 = 2 R 2, so m could not be 4.

D. m = 5

If n = 2, we see that 2^5/7 = 32/7 = 4 R 4, so m could not be 5.

At this point, we see that the correct choice must be E, but let's verify that is case anyway.

E. m = 6

If n = 1, we see that 1^6/7 = 1/7 = 0 R 1.
If n = 2, we see that 2^6/7 = 64/7 = 9 R 1.
If n = 3, we see that 3^6/7 = 729/7 = 104 R 1.

We can stop at this point before the numbers get too large; we can see that E is the correct answer choice.

Answer: E

Jeffrey Miller
Head of GMAT Instruction
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews
Join the discussion

by Shahrukh_mbabreakspace » Tue Jul 03, 2018 4:00 am
Fermat little theorem is the best way to solve it.
We can also do it using Euler's function as well
7*(1-1/7)= 6

________________________________________

Shahrukh Moin Khan
QA Mentor at Breakspace
https://www.mbabreakspace.com
PGDM: IIM Calcutta
B.Tech IIT Roorkee
Join the discussion