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.
Sep 2408:00 AM EDT
-08:30 AM EDT
Meet Tuck at an informal student or staff-hosted coffee chat in a city near you!
Sep 2601:00 PM EDT
-04:00 PM EDT
Top scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included. Class starts Saturdays Sept. 26, 2026 - Dec. 19, 2026, 1:00pm-4:00pm ES
Sep 2911:00 AM EDT
-01:00 PM EDT
" Description: Top scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thur Sept. 29, 2026 - Dec. 3, 2026, 11:00am-1:00pm EST
Oct 0107:00 AM BST
-08:00 AM GMT
Welcome to the GMAT Club's Free Interview Prep Event for Top MBA Programs! Buy tickets - Virtual series that’s all set to equip you to -excel in your MBA interviews.
23 Sep 2026, 19:02
Kudos
Bookmarks
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
0% (00:00) correct
0%
(00:00)
wrong
based on 4
sessions
History
Date
Time
Result
Not Attempted Yet
If n is a positive integer, how many positive divisors does n have?
(1) n = 2p, where p is a prime number.
(2) n is divisible by 4.
A. Statement (1) ALONE is sufficient, but statement (2) ALONE is NOT sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) ALONE is NOT sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.
Source: original question by the GMAT Drill team (not an official GMAT question). We'll post the full explanation in a spoiler in a day or two.
Disclosure: this account is run by GMAT Drill, a GMAT Focus practice site.
(A) Statement 1 alone is sufficient, but statement 2 alone is not.
(B) Statement 2 alone is sufficient, but statement 1 alone is not.
(C) Both statements together are sufficient, but neither alone is sufficient.
(D) Each statement alone is sufficient.
(E) Neither statement is sufficient, even when combined.
The OA will be automatically revealed on Friday 25th of September 2026 07:02:07 PM Pacific Time Zone
(1) n = 2p, where p is a prime number.
(2) n is divisible by 4.
A. Statement (1) ALONE is sufficient, but statement (2) ALONE is NOT sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) ALONE is NOT sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.
Source: original question by the GMAT Drill team (not an official GMAT question). We'll post the full explanation in a spoiler in a day or two.
Disclosure: this account is run by GMAT Drill, a GMAT Focus practice site.
(A) Statement 1 alone is sufficient, but statement 2 alone is not.
(B) Statement 2 alone is sufficient, but statement 1 alone is not.
(C) Both statements together are sufficient, but neither alone is sufficient.
(D) Each statement alone is sufficient.
(E) Neither statement is sufficient, even when combined.
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
The OA will be automatically revealed on Friday 25th of September 2026 07:02:07 PM Pacific Time Zone
23 Sep 2026, 19:26
Kudos
Bookmarks
st1: prime number could be 2, 3, 5...
but the no of divisors of n if prime no is 2 are 1,2,4
and, if any other prime no. then 1,2,p,2p
so, not sufficient
st2: n divisible by 4.. 1,2,4 and any other multiplier which is a part of n. So, not sufficient.
combining the 2, prime no. becomes 2 and no of divisors also 1,2,4. total 3. So, sufficient. Hence, C
but the no of divisors of n if prime no is 2 are 1,2,4
and, if any other prime no. then 1,2,p,2p
so, not sufficient
st2: n divisible by 4.. 1,2,4 and any other multiplier which is a part of n. So, not sufficient.
combining the 2, prime no. becomes 2 and no of divisors also 1,2,4. total 3. So, sufficient. Hence, C
23 Sep 2026, 21:57
Kudos
Bookmarks
GmatDrill
Pure algebraic questions, meaning questions formulated directly in algebraic terms without a real-world or word-problem context, are no longer part of the Data Sufficiency syllabus of the GMAT.
DS questions in GMAT Focus encompass various types of word problems, such as:
- Word Problems
- Work Problems
- Distance Problems
- Mixture Problems
- Percent and Interest Problems
- Overlapping Sets Problems
- Statistics Problems
- Combination and Probability Problems
- Non-math related questions
While these questions may involve or necessitate knowledge of algebra, arithmetic, inequalities, etc., they will always be presented in the form of word problems. You won’t encounter pure "algebra" questions like, "Is x > y?" or "A positive integer n has two prime factors..."
Please note that pure algebraic questions are still very much part of GMAT Problem Solving and may also appear in other Data Insights question types, such as Two-Part Analysis.
Hope this helps.
P.S. You can ignore this question. Arhcived.
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
