If n and k are positive integers, is n divisible by 6?
(1) n = k(k + 1)(k - 1)
(2) k – 1 is a multiple of 3.
(1) n = k(k + 1)(k - 1)
(2) k – 1 is a multiple of 3.
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
RedeemTarget Test Prep · GMAT
Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.
TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

with Chris Peckover

with Logan Thompson
Complete access from day one. Study on your schedule.
Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.
A. From 1), n is the product of three consecutive integers: k-1, k and k+1. So n is divisible by 3! = 6. (the product of d consecutive integers is always divisible by d!). Statement 2) is clearly insufficient on its own.Mani_mba wrote:If n and k are positive integers, is n divisible by 6?
(1) n = k(k + 1)(k - 1)
(2) k – 1 is a multiple of 3.
You mixed the 1st statement with the 2nd. You should consider the 2nd statement seperately inorder to determine if it is sufficient or not. So, with thatBidisha800 wrote:I understand why stmt 1 is sufficient but do not understand how stmt 2 is NOT sufficient.
Probably I'm missing something so please help me out...
k-1 = 3m
k=3m+1
k+1 =3m+2
n=k(k+1)(k-1)
=3m(3m+1)(3m+2)
m=0 n=0 divisible by 6
m=1 n=3.4.5 divisible by 6
m=2 n=6.7.8 divisible by 6
m=3 n=9.10.11 divisible by 6
.....
so why (B) is CLEARLY insufficient by its own ?
so why the answer is (A) ?
THANKS ....Vemuri wrote:You mixed the 1st statement with the 2nd. You should consider the 2nd statement seperately inorder to determine if it is sufficient or not. So, with thatBidisha800 wrote:I understand why stmt 1 is sufficient but do not understand how stmt 2 is NOT sufficient.
Probably I'm missing something so please help me out...
k-1 = 3m
k=3m+1
k+1 =3m+2
n=k(k+1)(k-1)
=3m(3m+1)(3m+2)
m=0 n=0 divisible by 6
m=1 n=3.4.5 divisible by 6
m=2 n=6.7.8 divisible by 6
m=3 n=9.10.11 divisible by 6
.....
so why (B) is CLEARLY insufficient by its own ?
so why the answer is (A) ?
k-1 = 3m
k=3m+1
k+1 =3m+2
is not enough to answer the question if n is divisible by 6 or not.
New here Create free account