For this question, we need to know what n is to find the answer.
With remainders, it helps to look for patterns, though. 3 raised to a positive integer will leave a one's digit in the following pattern:
3^1 = 3
3^2 = 9
3^3 = 7
3^4 = 1
3^5 = 3 ......
Because (4n + 3) will yield an ODD number (assuming n is a positive integer) we know that the one's digit will be either 3 or 7.
When dividing by 5, the remainders will either be 3 or 2 respectively.
Again, this depends on n.
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Featured Course
Target Test Prep GMAT OnDemand
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
- 715+ score guarantee — highest in the industry (99th percentile)
- 52 chapters · 1,500+ lessons · 4,000+ practice questions
- 400 hours of video · 1,500+ instructor-led HD smartboard lessons
- 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
- 24/7 live support + weekly Zoom office hours with GMAT instructors
- TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
- 1,200+ flashcards + AI-powered study assistant & daily calendar
- OnDemand, LiveTeach & GMAT Bootcamp formats available
- Also: GRE, SAT Math & Executive Assessment courses
- MBA Admissions Consulting now available
- 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
- 200,000+ students served
- 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★
5.0
(559 reviews)
130-pt guarantee
$0 to start
then $127/mo
Divisibility and Remainder !
Source: Beat The GMAT — Problem Solving |
-
grockit_jake
- GMAT Instructor
- Posts: 80
- Location: San Francisco, CA
- Thanked: 16 times
Jake , letz assume that n is positive as in 1,2,3,4....raka3399 wrote:What is the remainder of 3^4n+3 divided by 5 ???
how best to solve such sums efficiently?
doesn't it make 3^4n+3 have a 7 as its unit digit giving a remainder of 2 when divided by 5 ALWAYS!!!
correct me if am wrong !!
Thanks
-
grockit_jake
- GMAT Instructor
- Posts: 80
- Location: San Francisco, CA
- Thanked: 16 times
There is a difference between 3^(4n+3) and 3^4n + 3.
Assuming it's 3^(4n+3):
n=1, 3^(4n+3) = 3^7 = 2187 (remainder of 2)
n=2, 3^(4n+3) = 3^11 = 117147 (remainder of 2)
So yes, you are right. Because of the coefficient of 4, each increase of 1 in n, makes the exponent jump four spots in the 3,9,7,1 pattern, leaving you back at 7.
Assuming it's 3^(4n+3):
n=1, 3^(4n+3) = 3^7 = 2187 (remainder of 2)
n=2, 3^(4n+3) = 3^11 = 117147 (remainder of 2)
So yes, you are right. Because of the coefficient of 4, each increase of 1 in n, makes the exponent jump four spots in the 3,9,7,1 pattern, leaving you back at 7.
Sorry Jake guess it could be termed as a presentation error ... yes its 3^(4n+3) divided by 5grockit_jake wrote:There is a difference between 3^(4n+3) and 3^4n + 3.
Assuming it's 3^(4n+3):
n=1, 3^(4n+3) = 3^7 = 2187 (remainder of 2)
n=2, 3^(4n+3) = 3^11 = 117147 (remainder of 2)
So yes, you are right. Because of the coefficient of 4, each increase of 1 in n, makes the exponent jump four spots in the 3,9,7,1 pattern, leaving you back at 7.
many thanks again!
you rock !!!
GMAT/MBA Expert
-
Ian Stewart
- GMAT Instructor
- Posts: 2623
- Location: Montreal
- Thanked: 1090 times
- GMAT Score:780
We certainly need to know that n is a positive integer here. If that's given, we do not need any further information about n to answer the question, regardless of whether the expression is written as (3^4n) + 3 or as 3^(4n + 3). In the first case, we have
(3^4n) + 3 = (3^4)^n + 3 = 81^n + 3.
Since 81^n will end in 1 regardless of the value of n, 81^n + 3 will end in 4, and the remainder will be 4 when 3^4n + 3 is divided by 5.
In the second case, we have
3^(4n + 3) = [3^(4n)]*[3^3] = [81^n]*[3^3] = [81^n]*[27]
and since we are multiplying one number which ends in 1 with a number which ends in 7, the product must end in 7, so the remainder will be 2 when 3^(4n + 3) is divided by 5.
(3^4n) + 3 = (3^4)^n + 3 = 81^n + 3.
Since 81^n will end in 1 regardless of the value of n, 81^n + 3 will end in 4, and the remainder will be 4 when 3^4n + 3 is divided by 5.
In the second case, we have
3^(4n + 3) = [3^(4n)]*[3^3] = [81^n]*[3^3] = [81^n]*[27]
and since we are multiplying one number which ends in 1 with a number which ends in 7, the product must end in 7, so the remainder will be 2 when 3^(4n + 3) is divided by 5.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com
ianstewartgmat.com
ianstewartgmat.com
