BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Gmatprep DS - LCM and GCF

Expert replies
by jayhawk2001 » Sat Jun 09, 2007 3:50 pm
OA after a few reply.

If n and t are positive integers, which is the greatest prime factor of product nt?

(1) The greatest common factor of n and t is 5
(2) The least common denominator of n and t is 105
Join the discussion
Source: — Data Sufficiency |

by f2001290 » Sun Jun 10, 2007 10:24 pm
Jay - Is it B?

The greatest prime factor can be 7. Though not sure.

Jay - Is Least Common Denominator same as Least Common Multiple?
I have never heard of LCD before.
Join the discussion

by simplythebest » Mon Jun 11, 2007 10:33 pm
Its Just my call..not sure

In My Opinion(IMO) B

1. The greatest common factor is 5

so there can be n and t written as follows 5 * 19 and 5 * 23. So in this case the greatest Prime factor would be 23 as it can divide NT.

2. The LCM(I presume it as LCM) is 105 which is 5*3*7 and NT can be written as 105 * x and x cannot be PRIME because if X is prime the LCM will change...For example

21*5 = 105 assume that N=21 and T=55 (11 times 5) the LCM for N or T cannot be 105 and hence 7 is the largest prime divisor for NT.

Not sure about the logic..Maths gurus can correct me where i am wrong.. :idea:
Join the discussion

by simplythebest » Wed Jun 13, 2007 11:59 pm
Jay..any chance that my answer matches OA
Join the discussion

by jayhawk2001 » Thu Jun 14, 2007 6:07 am
simplythebest wrote:Jay..any chance that my answer matches OA
Yup, the OA is B
Join the discussion

by drhomler » Thu Jun 14, 2007 6:18 am
I would go with B too(although with the OA posted I know Im not adding any new value there)

1)Highest common factor is five- as was said up above n could be five and t could be 5*19 so highest prime would be 19

2)if L common Denominator were 105 prime factors are 3, 5, 7 so n or t has to have 7 as a root and therefore 7 is the highest prime factor of nt

Answer B-anyone have a guess as tto the difficulty level of this problem?
Join the discussion