Last visit was: 24 Apr 2024, 01:59 It is currently 24 Apr 2024, 01:59

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
SORT BY:
Date
User avatar
Intern
Intern
Joined: 03 Dec 2011
Posts: 27
Own Kudos [?]: 271 [7]
Given Kudos: 8
Send PM
User avatar
Intern
Intern
Joined: 28 Jan 2013
Posts: 23
Own Kudos [?]: 40 [2]
Given Kudos: 20
Send PM
RC & DI Moderator
Joined: 02 Aug 2009
Status:Math and DI Expert
Posts: 11161
Own Kudos [?]: 31878 [4]
Given Kudos: 290
Send PM
avatar
Manager
Manager
Joined: 02 Mar 2012
Posts: 201
Own Kudos [?]: 292 [0]
Given Kudos: 4
Schools: Schulich '16
Send PM
Re: If q is an integer, then q is divisible by how many positive [#permalink]
A.

1)only one value b/w 1 and q .So q is perfect square of odd number. Suff

2)m=3 . useless
Manager
Manager
Joined: 07 Mar 2020
Posts: 119
Own Kudos [?]: 66 [0]
Given Kudos: 52
GMAT 1: 680 Q49 V34
Send PM
If q is an integer, then q is divisible by how many positive [#permalink]
1st statement - since m is divisor of q and there is only one value of possible and 1<m<q this equality holds true. We know that prime numbers have only 2 factor i.e 1 and that number, so if we square any prime number then factor of that squared number will increase by 1 eg- 2*2 = 4 [1,2,4], 3*3 = 9[1,3,9]. 5*5 = 25[1,5,25] hence q must be square of any prime number and that make m as the prime number whose square q is. Eg- q as 25, m as 5 then m is only divisor of q between 1 and q. Total factor of q will always be 3.

2nd statement - m=3, there is no info on q, hence this can't help.

Hence answer is A
GMATWhiz Representative
Joined: 23 May 2022
Posts: 640
Own Kudos [?]: 429 [0]
Given Kudos: 6
Location: India
GMAT 1: 760 Q51 V40
Send PM
Re: If q is an integer, then q is divisible by how many positive [#permalink]
Expert Reply
notrandom wrote:
If q is an integer, then q is divisible by how many positive integers?

(1) If m is a divisor of q, there is only one value of m that satisfies the relationship 1 < m < q.

(2) m=3


Solution:
Pre Analysis:
  • We are asked the number of factors of integer q

Statement 1: If m is a divisor of q, there is only one value of m that satisfies the relationship 1 < m < q
  • We already know that 1 and q will be a factor of q
  • Now from this statement, we can infer that m is the only other factor
  • Which means q has 3 factors i.e., 1, m, q
  • Thus, statement 1 alone is sufficient and we can eliminate options B, C and E

Statement 2: m=3
  • Cannot find the factors of q with this
  • Thus, statement 2 alone is not sufficient

Hence the right answer is Option A
GMAT Club Bot
Re: If q is an integer, then q is divisible by how many positive [#permalink]
Moderator:
Math Expert
92893 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne