Last visit was: 11 Jul 2025, 17:57 It is currently 11 Jul 2025, 17:57
Close
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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 11 Jul 2025
Posts: 102,635
Own Kudos:
740,505
 [5]
Given Kudos: 98,172
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,635
Kudos: 740,505
 [5]
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
User avatar
gmatophobia
User avatar
Quant Chat Moderator
Joined: 22 Dec 2016
Last visit: 11 Jul 2025
Posts: 3,149
Own Kudos:
8,956
 [1]
Given Kudos: 1,860
Location: India
Concentration: Strategy, Leadership
Products:
Posts: 3,149
Kudos: 8,956
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Rabab36
Joined: 17 Jun 2022
Last visit: 23 Aug 2024
Posts: 249
Own Kudos:
Given Kudos: 67
Posts: 249
Kudos: 151
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
gmatophobia
User avatar
Quant Chat Moderator
Joined: 22 Dec 2016
Last visit: 11 Jul 2025
Posts: 3,149
Own Kudos:
8,956
 [1]
Given Kudos: 1,860
Location: India
Concentration: Strategy, Leadership
Products:
Posts: 3,149
Kudos: 8,956
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Rabab36
how it is possible if k is odd

k-1 is divisible by 4


Rabab36 - Not sure if this was a question for me, or if you intended to present your version of the solution.

However, as you quoted my response , responding to the above quoted question

From the question stem we know

\(P = k^3 - k^2\)

If we take \(k^2\) common

\(P = k^2(k -1)\)

In a scenario when k is odd, for P to be divisible by 4, (k - 1) should be divisible by 4. This is because k is odd, so \(k^2\) will not be divisible by 4.

Ex. k = 5

P = \(5^2(5-1)\)

We can tell P is divisible by 4, as (5-1) is divisible by 4.

The inference does not intend to conclude that whenever k is odd, k - 1 is divisible by 4. I guess you inferred this from the statements in blue.

The inference is in conjunction with the question, "Is P divisible by 4". So if P were to be divisible by 4, and k was odd, then (k-1) would be divisible by 4.

Hope this clarifies.
User avatar
Rabab36
Joined: 17 Jun 2022
Last visit: 23 Aug 2024
Posts: 249
Own Kudos:
151
 [1]
Given Kudos: 67
Posts: 249
Kudos: 151
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
gmatophobia
Rabab36
how it is possible if k is odd

k-1 is divisible by 4


Rabab36 - Not sure if this was a question for me, or you intended to present your version of the solution.

However, as you quoted the response , responding to the above quoted question

From the question stem we know

\(P = k^3 - k^2\)

If we take \(k^2\) common

\(P = k^2(k -1)\)

In a scenario when k is odd, for P to be divisible by 4, (k - 1) should be divisible by 4. This is because k is odd, so \(k^2\) will not be divisible by 4.

Ex. k = 5

P = \(5^2(5-1)\)

We can tell P is divisible by 4, as (5-1) is divisible by 4.

The inference does not intend to conclude that whenever k is odd, k - 1 is divisible by 4. I guess you inferred this from the statements in blue.

The inference is in conjunction with the question, "Is P divisible by 4". So if P were to be divisible by 4, and k was odd, then (k-1) would be divisible by 4.

Hope this clarifies.

then sir for x=5 n=3

statement is insufficient
User avatar
Pablopikachu
Joined: 05 Nov 2024
Last visit: 10 Jul 2025
Posts: 30
Own Kudos:
Given Kudos: 270
Products:
Posts: 30
Kudos: 10
Kudos
Add Kudos
Bookmarks
Bookmark this Post
K-1 is not necessarily divisible by 4 for odd value of k, which is why statement 1 is insufficient. Could someone pls explain why A is correct ?
User avatar
IrascibleDoctor
Joined: 12 Jul 2024
Last visit: 13 Jun 2025
Posts: 8
Own Kudos:
Given Kudos: 4
Products:
Posts: 8
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Pablopikachu
K-1 is not necessarily divisible by 4 for odd value of k, which is why statement 1 is insufficient. Could someone pls explain why A is correct ?


Hey buddy just calculate the value of K^2(K-1) and divide it by four you’ll get the answer

For statement 2 we just that K^2(K-1) is even which tell us nothing whether that even number is a multiple of 4 or not

so 1 alone is sufficient!
User avatar
NoeticImbecile
Joined: 17 Feb 2024
Last visit: 10 Jul 2025
Posts: 57
Own Kudos:
Given Kudos: 265
Posts: 57
Kudos: 14
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello gmatophobia In S1 "It's given that x & n > 1, so k-1 will always be an even integer which is divisible by 4.", how did you arrive at x>1? further, even if both x & n are >1, lets say x=3 and n=5, k = 775, then k-1=774 which although is even but not divisible by 4. Bunuel , chetan2u , any other expert please clarify
gmatophobia
Bunuel
If \(P = k^3 - k^2\), where k and P are positive integers, is P divisible by 4?

(1) \(k = (10x)n + 5^4\) where x and n are positive integers and n > 1.
(2) \((2n + 1)k\) leaves a remainder when divided by 2; n is a positive integer

\(P = k^2(k-1)\)

Inference : For P to be divisible by 4

  • If k = even, k^2 will be divisible by 4. Hence P is divisible by 4.
  • If k = odd, (k-1) should be divisible by 4.


Statement 1

\(k = (10x)n + 5^4\) where x and n are positive integers and n > 1.

k = even + odd = odd

We have established that k is odd, now we need to find if k - 1 is divisible by 4.

It's given that x & n > 1, so k-1 will always be an even integer which is divisible by 4.

Statement 1 is sufficient and we can eliminate B, C and E.

Statement 2

\((2n + 1)k\) leaves a remainder when divided by 2; n is a positive integer

If a number leaves a remainder when divided by 2, then the number is an odd.

Therefore, (2n+1)k is odd. (2n+1) is odd, therefore we can conclude that k is odd.

Now we need to determine if k-1 is divisible by 4.

Say k = 3; k - 1 = 2. k-1 is not divisible by 4.
k = 5; k - 1 = 4. k-1 is divisible by 4.

As we are getting two different answers, we can eliminate B.

Option A
User avatar
chetan2u
User avatar
GMAT Expert
Joined: 02 Aug 2009
Last visit: 11 Jul 2025
Posts: 11,295
Own Kudos:
Given Kudos: 333
Status:Math and DI Expert
Products:
Expert
Expert reply
Posts: 11,295
Kudos: 41,686
Kudos
Add Kudos
Bookmarks
Bookmark this Post
NoeticImbecile
Hello gmatophobia In S1 "It's given that x & n > 1, so k-1 will always be an even integer which is divisible by 4.", how did you arrive at x>1? further, even if both x & n are >1, lets say x=3 and n=5, k = 775, then k-1=774 which although is even but not divisible by 4. Bunuel , chetan2u , any other expert please clarify
Hi

There is no reason for statement 1 to be sufficient.
Is P divisible by 4 means is k^2(k-1) divisible by 4.

Statement 1 tells us that k is odd, so the question now becomes- Is k-1 divisible by 4?
There is nothing in statement that can give a YES or NO to the question.
Moderator:
Math Expert
102635 posts