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.
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
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
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
27 Jun 2023, 06:00
Kudos
Bookmarks
A
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
15%
(low)
Question Stats:
78% (00:59) correct
22%
(01:53)
wrong
based on 69
sessions
History
Date
Time
Result
Not Attempted Yet
For a positive integer n, when 3^n is divided by 5, what is the remainder?
(1) n is a multiple of 4.
(2) n is a multiple of 2.
(1) n is a multiple of 4.
(2) n is a multiple of 2.
27 Jun 2023, 06:21
Kudos
Bookmarks
Given: n>0
Asked: Remainder "r" when 3^n divided by 5.
Solution:
Statement 1: n = 4k.
Now we know that the cyclicity of 3 is 4. i.e. 3^1 = 3, 3^2 = 9, 3^3 = 7, 3^4 = 1, and so on.
n can be 4, 8, 12, etc. --> so 3^4k % 5 will always give the remainder as "1". eg. 3^4 % 5 = 1, 3^8 % 5 = 1 and so on. Sufficient.
Statement 2: n = 2k.
We know that the cyclicity of 2 is also 4. i.e. 2^1 = 2, 2^2 = 4, 2^3 = 8, 2^4 = 6, and so on.
n can be 2, 4, 6, 8, etc. --> Now if n is 2 then we have a different remainder. i.e. 3^2 % 5 = 4
if n is 4, then we have a different remainder. i.e. 3^4 % 5 = 1. Hence we're not getting a single remainder value. Not Sufficient.
Answer: A
Asked: Remainder "r" when 3^n divided by 5.
Solution:
Statement 1: n = 4k.
Now we know that the cyclicity of 3 is 4. i.e. 3^1 = 3, 3^2 = 9, 3^3 = 7, 3^4 = 1, and so on.
n can be 4, 8, 12, etc. --> so 3^4k % 5 will always give the remainder as "1". eg. 3^4 % 5 = 1, 3^8 % 5 = 1 and so on. Sufficient.
Statement 2: n = 2k.
We know that the cyclicity of 2 is also 4. i.e. 2^1 = 2, 2^2 = 4, 2^3 = 8, 2^4 = 6, and so on.
n can be 2, 4, 6, 8, etc. --> Now if n is 2 then we have a different remainder. i.e. 3^2 % 5 = 4
if n is 4, then we have a different remainder. i.e. 3^4 % 5 = 1. Hence we're not getting a single remainder value. Not Sufficient.
Answer: A
27 Jun 2023, 14:02
Kudos
Bookmarks
Bunuel
n is a positive integer, so 3^n is a positive integer.
If an integer is divided by 5, then the remainder depends only on the units digit of the integer.
We need to answer the question:
remainder of (3^n)/5 = ?
Statement One Alone:
=> n is a multiple of 4.
n = 4q, where q is a positive integer.
3^n = 3^(4q) = (3^4)^q = 81^q
If an integer with a units digit of 1 is raised to a positive integer power, then the units digit of the resulting number is always 1. Therefore, the units digit of 3^n is 1, and the remainder in question is 1.
Statement one is sufficient. Eliminate answer choices B, C, and A.
Statement Two Alone:
=> n is a multiple of 2.
n = 2q, where q is a positive integer.
3^n = 3^(2q) = (3^2)^q = 9^q
If an integer with a units digit of 9 is raised to a positive integer power, then the units digit of the resulting number is 9 if the exponent is odd or 1 if the exponent is even. Therefore, the units digit of 3^n is 9 or 1, and the remainder in question is 4 or 1.
Statement two is not sufficient.
Answer: A
