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
GMATBootcamp Starts Sep 28
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

15 live classes from Sep 28, 2026

Schedule
Mon to Fri · 7:00 to 10:00 PM ET
Included
Live classes + 6 months of TTP OnDemand
  • Boost your GMAT score in less than one month in a live online class
  • 6 months access to TTP OnDemand video courses included
View bootcamp & 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.

Num Properties - GMAT Prep

Expert replies
by ReenaMo » Sat Nov 01, 2008 9:33 pm
Hi, I searched this question through the Beat the GMAT archives and found 2 posts on it. However (before anyone deletes this), I want to note that each of the posts gave a different response/explanation for the right answer (one arrived at A, while the other arrived at B). Can someone take a look at this and explain it again? By the way, OA is B. Thanks so much!

If n and m are positive integers, what is the remainder, when 3^(4n+2) + m is divided by 10?

1. n=2

2. m=1
Join the discussion
Source: — Data Sufficiency |

Re: Num Properties - GMAT Prep

by logitech » Sat Nov 01, 2008 10:11 pm
ReenaMo wrote:Hi, I searched this question through the Beat the GMAT archives and found 2 posts on it. However (before anyone deletes this), I want to note that each of the posts gave a different response/explanation for the right answer (one arrived at A, while the other arrived at B). Can someone take a look at this and explain it again? By the way, OA is B. Thanks so much!

If n and m are positive integers, what is the remainder, when 3^(4n+2) + m is divided by 10?

1. n=2

2. m=1


3^(4n+2) = 3^2(2n+1)= 9^(2n+1)

2n+1 is an ODD number

and 9^(2n+1) will always have 9 at its unit digit

Remember that N is Positive and an integer!

9^3 = XX9
9^5 = xxxx9
......

So we really don't need to know what N is to tell what the unit digit is, but we have to know what "m" is so we can find out the unit digit of :

3^(4n+2) + m

You also need to remember that when you divide any number by 10, the remainder is the unit number!

So,

1) Insuf
2) Suf

Hence, B
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Join the discussion

Re: Num Properties - GMAT Prep

by yezz » Sat Nov 01, 2008 10:15 pm
If n and m are positive integers, what is the remainder, when 3^(4n+2) + m is divided by 10?

1. n=2

2. m=1[/b][/quote]

3/10...remainder = 3

3^2/10..........9

3^3/10 .........7

3^4/10...............1

3^5/10...........3

3^6/10...........9

so we have a sequence repeating every 4 exp multiple of 3, now lets look at the question

from one if n = 1

thus 3^(6)+m if m = 1 , then 3^7.remainder is 7, if m=2 remainder is 1


insuff

from 2

3^(4n+2)+1..........if n = 1 thus 3^7 has emainder of 7

if n = 2 then 3^(11) has remainder of 7

if n = 3 then 3^15 has remainder of 7...........suff

B
Join the discussion

by ReenaMo » Sat Nov 01, 2008 10:33 pm
Awesome - thanks!
Join the discussion