If x and y are positive integers and n=x5∗y7n=x5∗y7, then how many positive divisors does n have?
(1) x does not have a factor p such that 1 < p < x and y does not have a factor q such that 1 < q < y.
(2) n has only two prime factors.
Giving it a try (This was actually my second attempt):
S1 states that X and Y are prime numbers with no current constraints
Can we find the number of positive divisors of N from that? (
MGMAT says to work to prove the statement insuff)
Scen 1: (X = 2, Y = 3)
(2^5)(3^7) No of divisors (5+1)(7+1) = 48
Scen 2 (X = 2, Y = 2)
(2^12) No. of Divisors =/= 48
S1 is insufficient due to multiple answers
S2 states that N has two different prime numbers meaning that X and/or Y can be any numbers that share at most two prime factors (eg: [2,3],[2,6], [2,10], [5,15], [15,15])
Scen 1: (X = 2, Y = 3)
(2^5)(3^7) No of divisors (5+1)(7+1) = 48
Scen 2 (X = 2, Y = 6) (PF = 2 & 3)
Honestly, I don't even know what the number of divisors would be but I know it's not 48, and I'm not going to waste time trying to figure out what that number is. Knowing it's not 48 is enough for me to say it's insufficient.
So A, D, & B are eliminatedNow to try S1 & S2 together:
S1: X and Y are prime numbers & S2: X and Y must be different prime numbers
Scen 1: (X = 2, Y = 3)
(2^5)(3^7) No of divisors (5+1)(7+1) = 48
Scen 1: (X = 2, Y = 5)
(2^5)(5^7) No of divisors (5+1)(7+1) = 48
So the answer is C.
During my first try while I was scribbling on paper I read S2 as having the parameters of S1 & S2 combined. I essentially read it as X and Y have to be different prime numbers, which was the incorrect way to read it.