Search found 6 matches


gnet, that's a good catch. I thought of it in terms of distinct prime factors, and if the OA stands as A, it looks like the question also assumes that it is in fact distinct prime factors that matter. thanks mp2437. I knew you were talking about distinct prime factors only :) I think the actual GMA...

by gnet

Wed Oct 28, 2009 7:22 am
Forum: Data Sufficiency
Topic: Factors Vs Prime Factors
Replies: 5
Views: 2267

ii) Every prime factor of y is also a prime factor of x (ii)it is not true that an integer will be formed by the ratio of 2 numbers if only their prime factors are common. For example, say y = 8 (prime factor of 2), and x = 30 (prime factors of 2,3,5). Statement 2 is satisfied such that every prime...

by gnet

Wed Oct 28, 2009 6:33 am
Forum: Data Sufficiency
Topic: Factors Vs Prime Factors
Replies: 5
Views: 2267

Hi, this is an old thread, already well explained by Vivek, but I thought I would throw in here another formula/appproach to such questions, where we need to determine the exact power of a given prime p which divides n! (you will though need to know or learn how to convert a decimal to a different b...

by gnet

Sun Oct 25, 2009 7:59 am
Forum: Problem Solving
Topic: Is there easy way of finding power of number in this scenari
Replies: 6
Views: 1639

Re: prime numbers

there are four consecutive prime numbers in ascending order. the product of the first three is 4199 and of the last three is 7429. what would be the largest number and what would be the smallest number of the four numbers? Given: 1) p1<p2<p3<p4 (we need to find values of p1 and p4) 2) p1 x p2 x p3 ...

by gnet

Mon Oct 05, 2009 5:24 pm
Forum: Problem Solving
Topic: prime numbers
Replies: 6
Views: 1845

(30!) / 3^k 30/3 will give max. 10 multiples 30/(3)^2 will give max. 3 multiples 30/(3)^3 will give max 1. multiple Add the above to get max. 14 multiples (multiplicity) of prime number 3 in the prime factorization of 30! --------- Let's try another (a simpler one). 5! / 2^k 5/2 --> max. 2 multiples...

by gnet

Tue Sep 29, 2009 6:45 pm
Forum: Problem Solving
Topic: Is there easy way of finding power of number in this scenari
Replies: 6
Views: 1639

C(osts) = L(abor) + M(aterials) P(rofit) = 500,000 - C(osts) Question: Is 500,000 - C > 150,000 ( So, if we could show that total costs were less (or more) than 350,000 then we have an answer! ) (a) C = 3M or 3M = L + M or L = 2M Could take any values -> not sufficient (b) P > L or 500,000 - C > L o...

by gnet

Tue Sep 29, 2009 6:52 am
Forum: Data Sufficiency
Topic: hard question,
Replies: 2
Views: 1158