How many odd factors does the integer n have?

Question

(1) 16 is the highest power of 2 that divides n

(2) n has a total of 68 factors and 3 prime factors.

LeoN88 · Answer

1. n can be k. 2^16, where 
if k=3, 1 odd factor.
if k=15, 2 odd factors. Insufficient.

2. 68= (a+1)(b+1)(c+1) since it's told that there are 3 prime factors. a*b*c not = 0
68= 2*2*17

So n can be= 7 * 5 * 3^16
or n= 2 * 5 * 3^16. Insufficient.

1+2 tells us power of 2 is 16

n= (odd factor) * (another odd factor) * (2^16),  as 2 is the only even prime factor .
Sufficient, answer is 2 odd factors.  C

anmol345 · Answer

St 1: Clearly not sufficient
St 2: there can be any 3 prime factors (3 odd primes or 2 and 2 odd primes). Thus not sufficient
Combine 1 & 2: The factors are prime factors and multiplication of these prime factors. With 2 as one of the prime factors, we know other 2 primes are odd.

Hence there will be 4 odd factors. 
1, prime no 1, prime no 2 and product of the 2 prime nos

tinklepoo · Answer

1) 16 is the highest power of 2 that divides n 
In other words...
 2^{16} 	ext{ is the largest power of 2 which divides n}

Possibilities of n: 
 n = 2^{16} , 0 prime factors
 n = 2^{16} * 3 , 1 prime factor

Insufficient

(2) n has a total of 68 factors and 3 prime factors. 
However, we do not know if these primes are all odd, or contain an even prime (2).
Insufficient

Combine (1) and (2) 
Recall the formula for finding total number of factors:  https://gmatclub.com/forum/math-number-theory-88376.html#p666609

n=a^p*b^q*c^r 	ext{, where a, b, and c are prime factors of n and p, q, and r are their powers.} 
 	ext{Total Number of Factors} = (p+1)(q+1)(r+1)

So therefore:
 68 = (p+1)(q+1)(r+1) , results in
 68 = (16+1)(1+1)(1+1) = 17*2*2

We know that the prime factorization of 2 results in a power of 16. Thus, the other 2 numbers must be odd primes to the first power.
 n=2^{16}*odd^1*odd^1

Sufficient

ccooley · Answer

This question has a bit of ambiguity. "16 is the highest power of 2 that divides n" could mean two different things:

2^16 divides evenly into n, but 2^17 doesn't;
The number 16 (which equals 2^4) divides evenly into n, but 32 (which equals 2^5) doesn't.

The GMAT would also most likely use the phrasing "unique prime factors" in the second statement. I think it's reasonably clear from context that the statement is referring to the unique prime factors, but the GMAT is usually as clear as it possibly can be in order to avoid challenges to official problems!

LeoN88 · Answer

n = 2^{16} ,  0  1 prime factors
 n = 2^{16} * 3 ,  1  2 prime factor. 2 is a prime number.

Ambika02 · Answer

gurmukh · Answer

From statement 1 
N= 2^16× k
Where k is some odd number we don't know that is why given 
 statement is insufficient.
From statement 2 
Whether N is a multiple of 2 or not we don't know that is given statement is insufficient.
Combining both the statements
N=2^16×a^1×b^1
Where a and b are odd prime numbers
Total factors =17×2×2=68
Odd factors =1×2×2=4
Sufficient
Answer is C

Posted from my mobile device

How many odd factors does the integer n have?

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards

GMAT Data Sufficiency (DS) Questions

How many odd factors does the integer n have?

Prep Toolkit

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards