If n Is A Positive Integer, Is n – 1 Divisible By 3? GMAT Data Sufficiency

Question: If n is a positive integer, is n – 1 divisible by 3?

(1)n^2 + n is not divisible by 6
(2)3n = k + 3, where k is a positive multiple of 3

  1. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
  2. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
  3. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
  4. EACH statement ALONE is sufficient.
  5. Statements (1) and (2) TOGETHER are NOT sufficient.


Approach Solution (1)

Let's take each statement one by one

S1: (n^2 + n) is not divisible by 6
n(n + 1) is not divisible by 6 (= 2 * 3)

We see that n and (n + 1) are two consecutive integers. Note that every second integer is even, thus, it is divisible by 2. Thus, Statement 1 can be rephrased as: n^2 + n is not divisible by 3. Also, note that one among the three consecutive integers is divisible by 3.

Thus, one among (n - 1)n(n + 1) is divisible by 3. Since we deduced that neither n nor (n + 1) is divisible by 3, this means that (n - 1) must be divisible by 3

Sufficient

S2: 3n = k + 3, where k is a positive multiple of 3.
3n - 3 = k
k = 3(n - 1)
(n - 1) may or may not be a multiple of 3
Insufficient

Correct option: A

Approach Solution (2)

(1) n^2 + n = n(n + 1)
Now, n and n + 1 are consecutive integers, so one of them is surely even.
Therefore, if n(n + 1) is divisible by 2 but not by 6, it means n(n + 1)is not divisible by 3.

n(n + 1) not divisible by 3 means that the consecutive numbers n and n + 1 are not divisible by 3.

As we have to have one multiple of 3 in every set of 3 consecutive integers, n - 1 must be divisible by 3.

Sufficient

(2) 3n = k + 3
3n - 3 = k
3(n - 1) = k
It is given that k is a multiple of 3, which can be seen from the result but n - 1 can take any value.

Insufficient

Correct option: A

Approach Solution (3)

Statement 1:
n^2+ n not divisible by 6
n can be 1, 4, 7 and 10.
From the above n - 1 = 0, 3, 6, 9 (All are divisible by 3)

Sufficient

Statement 2:
3n = k + 3
k can be 3, 6, 9 and 12 etc
Then n can be equal to 2, 3, 4, 5 respectively
Of the above numbers, n - 1:- 1 and 2 are not divisible by 3 but 4 - 1 is divisible by 3

Not sufficient

Correct option: A

“If n is a positive integer, is n – 1 divisible by 3?”- is a topic of the GMAT Quantitative reasoning section of GMAT. This question has been taken from the book "GMAT Quantitative Review". GMAT Quant section consists of a total of 31 questions. GMAT Data Sufficiency questions consist of a problem statement followed by two factual statements. GMAT data sufficiency comprises 15 questions which are two-fifths of the total 31 GMAT quant questions.

Suggested GMAT Quant Questions

Comments


No Comments To Show