# Lesson: Prime Factorization

## Comment on Prime Factorization

### hi

hi
would you plz help me with this

If K is an integer and 2 < k < 8, what is the value of k?

1) k is a factor of 30

2) k is a factor of 12.

the prime factorization for 30 is 2-3-5
for 12 is 2-2-3
so just 3 between them so it is c
what is the wrong here? ### Be careful, the question does

Be careful. The question does not say that "k is a PRIME factor of 30." It just says "k is a factor of 30."

Statement 1: The factors of 30 are: 1, 2, 3, 5, 6, 10, 15, 30.
Since we're told that 2 < k < 8, we can conclude that k = 3, 5 or 6
INSUFFICIENT

Statement 2: The factors of 12 are: 1, 2, 3, 4, 6, 12.
Since we're told that 2 < k < 8, we can conclude that k = 3, 4 or 6
INSUFFICIENT

The two statements COMBINED
Statement 1 tells us that k = 3, 5 or 6
Statement 2 tells us that k = 3, 4 or 6
Since both statements must be true, we can see that k can still equal 3 or 6.
INSUFFICIENT

### Hi Brent,

Hi Brent,

I think the last answer choice has a mistake? "332" has "2" distinct primes.

Which of the following numbers has the greatest number of distinct prime factors?

A. 165
B. 192
C. 228
D. 330
E. 332
This requires us to find the prime factorization of each answer choice

A. 165 = (3)(5)(11) --- 3 distinct prime factors
B. 192 = (2)(2)(2)(2)(2)(2)(3) --- 2 distinct prime factors
C. 228 = (2)(2)(3)(19) --- 3 distinct prime factors
D. 330 = (2)(3)(5)(11) --- 4 distinct prime factors
E. 332 = (2)(2)(83) --- 3 distinct prime factor

### Hi Brent,

Hi Brent,

This was one of the links posted for this vid: https://gmatclub.com/forum/stonecold-s-mock-test-217160.html

Are there any questions from here that you suggest we focus on? Or should we just save the set for further refining post answering the other links?

Many thanks,
Neel ### Hi Neel,

Hi Neel,

I don't see a link to https://gmatclub.com/forum/stonecold-s-mock-test-217160.html from any of the above links.

With the links in the Reinforcement Activities boxes, I suggest that you answer as many as you feel are necessary to get to the level of expertise you need to achieve your target score.

For some students, this will mean answering a handful of questions in the 500-650 range. For others, it will mean answering all of the questions in the 650 range, etc.

Does that help?

Cheers,
Brent

### Oops! In that case I must

Oops! In that case I must have clicked it erroneously

Definitely, thank you for clarifying!

Best,
Neel

### Hi Brent,

Hi Brent,

Does the integer k have a factor p such that 1 < p <k?

(1) k > 4!
(2) 13! + 2 ≤ k ≤ 13! + 13 ### Hi Brent,

Hi Brent,

Can you please explain this below mentioned question solution in
details
!https://gmatclub.com/forum/if-x-is-the-product-of-the-positive-integers-from-1-to-8-in-146157.html#p1171891

Thanks
Fatima-Zahra ### Hi Fatima-Zahra,

Hi Fatima-Zahra,

Here's my full solution: https://gmatclub.com/forum/if-x-is-the-product-of-the-positive-integers-...

Cheers,
Brent

### Hi,

Hi,

Would like to know if my approach is good on the following problem https://gmatclub.com/forum/a-number-is-said-to-be-prime-saturated-if-the-product-of-all-the-diffe-106511.html

Let a,b,c be different prime factors of n. As per question a*b*c < square root of n, if we square both sides we get (a*b*c)^2 < n
Now on to checking numbers:
99= 3*3*11=> (3*11)^2 must be less than 99, which it is not
98=7*7*2 => (7*2)^2 must be less than 98, not true
97 is a prime number 97^2 is more than 97
96= 3*2*2*2*2*2 => (3*2)^2 must be less than 96, 36<96, true. Your approach is perfect - nice work!

Cheers,
Brent

### Hi Brent,

Hi Brent,

Can you help with this problem https://gmatclub.com/forum/if-x-y-and-z-are-integers-and-2-x-5-y-z-0-00064-what-is-the-188182.html

I am completely stuck. I represented 0.00064 as 64*10^-5, which can be represented as 2^6*10^-5, I do not know what to do from here. Or maybe the whole approach is wrong? That's a good start.
The trick now is to recognize that there are many different ways to rewrite (2^6)(10^-5)

For example, we know that (2^-5)(5^-5) = 10^-5
So, we can write: (2^6)(10^-5) = (2^6)(2^-5)(5^-5)

Or we can combine the two powers of 2 to get: (2^6)(2^-5)(5^-5) = (2^1)(5^-5)

And so on.

Here's my full solution: https://gmatclub.com/forum/if-x-y-and-z-are-integers-and-2-x-5-y-z-0-000...

Cheers,
Brent

### Hi Brent

Hi Brent
from times to times in this topic i found a question like:
"how many different prime factors does n have?"
"n is divisible by how many positive integers?"
the problem is that it's not clear for me what I need to find. Should I found how many different factors N has OR should I found how many different numbers/quantity factors N has.
examples below
for me both of these questions sound the same, but they are different. how to dedicate\understand those differences?

https://gmatclub.com/forum/if-n-is-the-product-of-the-integers-from-1-to-8-inclusive-135542.html
https://gmatclub.com/forum/if-n-is-an-integer-then-n-is-divisible-by-how-many-positive-164964.html If we're asked to find the number of DIFFERENT PRIME factors, we are counting ONLY prime factors, and we cannot count repeated primes more than once.
For example, 18 = (2)(3)(3)
So, 18 has TWO DIFFERENT prime factors: 2 and 3

Next, asking "n is divisible by how many positive integers?" is the same as asking "How many POSITIVE FACTORS does n have?"
In this case, we are counting ALL factors (prime and not prime)

Example: How many POSITIVE FACTORS does 18 have?
Factors of 18: 1, 2, 3, 6, 9, 12
So, 18 has 6 positive factors.

Does that help?

Cheers,
Brent

Thanks!
Kashaf ### Hi Brent, can you please

Hi Brent, can you please solve question DS00340 - Q390 of OG 2019?

(A school will assign each student in a group of n students to one of m classrooms. If 3<m<13<n, is it possible to assign each of n students to m classrooms so that each class has same number of students?)

According to me the answer is D. But correct answer is B, which I couldn't understand from OG's solution.

Thanks!
Kashaf ### https://gmatclub.com/forum/if

https://gmatclub.com/forum/if-q-is-a-positive-integer-is-300-a-factor-of-q-318050.html

Approach plz 