n is a positive integer. What is the remainder when n is divided by 3?
1) n^2 has remainder 1 when it is divided by 3
2) n has remainder 7 when it is divided by 9
5-Day Free Trial
5-day free, full-access trial TTP
Available with Beat the GMAT members only code
MORE DETAILS
n is a positive integer. What is the remainder when n is div
This topic has expert replies
-
Max@Math Revolution
- Elite Legendary Member
- Posts: 3991
- Joined: Fri Jul 24, 2015 2:28 am
- Location: Las Vegas, USA
- Thanked: 19 times
- Followed by:37 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
Math Revolution
The World's Most "Complete" GMAT Math Course!
Score an excellent Q49-51 just like 70% of our students.
[Free] Full on-demand course (7 days) - 100 hours of video lessons, 490 lesson topics, and 2,000 questions.
[Course] Starting $79 for on-demand and $60 for tutoring per hour and $390 only for Live Online.
Email to : [email protected]
-
jpcameron17
- Junior | Next Rank: 30 Posts
- Posts: 10
- Joined: Wed Feb 27, 2019 4:11 am
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
The easiest way to deal with questions that deal with remainders is to create a list of values that satisfy the remainder condition described. For example, if a question states that the remainder when x is divided by 5 is 3, then create a list of the possible values of x: x = 3, 8, 13, 18, 23, 28,... etc.
1) n^2 has remainder 1 when it is divided by 3
This means that the values of n are n = 1, n = 2, n =4, n = 5, n =49 etc, since only these values have a remainder of 1 when divided by 3. In every single one of these scenarios, the remainder is always 1 when n is divided by 3, therefore Statement (1) is sufficient.
2) n has remainder 7 when it is divided by 9
This means that n = 7, n = 16, n = 25, n = 34, n = 43 etc. The remainder is again always equal to 1 in each of these scenarios when n is divided by 3, thus making the statement sufficient.
The answer is therefore (D).
1) n^2 has remainder 1 when it is divided by 3
This means that the values of n are n = 1, n = 2, n =4, n = 5, n =49 etc, since only these values have a remainder of 1 when divided by 3. In every single one of these scenarios, the remainder is always 1 when n is divided by 3, therefore Statement (1) is sufficient.
2) n has remainder 7 when it is divided by 9
This means that n = 7, n = 16, n = 25, n = 34, n = 43 etc. The remainder is again always equal to 1 in each of these scenarios when n is divided by 3, thus making the statement sufficient.
The answer is therefore (D).
-
Max@Math Revolution
- Elite Legendary Member
- Posts: 3991
- Joined: Fri Jul 24, 2015 2:28 am
- Location: Las Vegas, USA
- Thanked: 19 times
- Followed by:37 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
=>
Forget conventional ways of solving math questions. For DS problems, the VA (Variable Approach) method is the quickest and easiest way to find the answer without actually solving the problem. Remember that equal numbers of variables and independent equations ensure a solution.
Since we have 1 variable (n) and 0 equations, D is most likely to be the answer. So, we should consider each condition on its own first.
Condition 1)
n could be any of the integers 1, 2, 4, 5, 7, 8, ...
If n is one of 1, 4, 7, then n has a remainder 1 when it is divided by 3.
If n is one of 2, 5, 8, then n has a remainder 2 when it is divided by 3.
Thus, condition 1) is not sufficient, since it does not yield a unique solution.
Condition 2)
n = 9k +7 can be expressed as n = 9k + 7 = 9k + 6 + 1 = 3(3k+2)+1. Therefore, n has remainder 1 when it is divided by 3.
Thus, condition 2) is sufficient.
Therefore, B is the answer.
Answer: B
Forget conventional ways of solving math questions. For DS problems, the VA (Variable Approach) method is the quickest and easiest way to find the answer without actually solving the problem. Remember that equal numbers of variables and independent equations ensure a solution.
Since we have 1 variable (n) and 0 equations, D is most likely to be the answer. So, we should consider each condition on its own first.
Condition 1)
n could be any of the integers 1, 2, 4, 5, 7, 8, ...
If n is one of 1, 4, 7, then n has a remainder 1 when it is divided by 3.
If n is one of 2, 5, 8, then n has a remainder 2 when it is divided by 3.
Thus, condition 1) is not sufficient, since it does not yield a unique solution.
Condition 2)
n = 9k +7 can be expressed as n = 9k + 7 = 9k + 6 + 1 = 3(3k+2)+1. Therefore, n has remainder 1 when it is divided by 3.
Thus, condition 2) is sufficient.
Therefore, B is the answer.
Answer: B
Math Revolution
The World's Most "Complete" GMAT Math Course!
Score an excellent Q49-51 just like 70% of our students.
[Free] Full on-demand course (7 days) - 100 hours of video lessons, 490 lesson topics, and 2,000 questions.
[Course] Starting $79 for on-demand and $60 for tutoring per hour and $390 only for Live Online.
Email to : [email protected]
