Last visit was: 26 Apr 2026, 11:24 It is currently 26 Apr 2026, 11:24
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 26 Apr 2026
Posts: 109,857
Own Kudos:
Given Kudos: 105,897
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,857
Kudos: 811,426
 [20]
1
Kudos
Add Kudos
19
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
CareerGeek
Joined: 20 Jul 2017
Last visit: 25 Apr 2026
Posts: 1,286
Own Kudos:
4,433
 [6]
Given Kudos: 162
Location: India
Concentration: Entrepreneurship, Marketing
GMAT 1: 690 Q51 V30
WE:Education (Education)
GMAT 1: 690 Q51 V30
Posts: 1,286
Kudos: 4,433
 [6]
5
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
General Discussion
avatar
manass
Joined: 30 Aug 2018
Last visit: 13 Nov 2020
Posts: 42
Own Kudos:
66
 [3]
Given Kudos: 111
Location: India
Concentration: Finance, Accounting
GMAT 1: 600 Q49 V23
GMAT 2: 650 Q49 V29
GPA: 3.36
WE:Consulting (Computer Software)
GMAT 2: 650 Q49 V29
Posts: 42
Kudos: 66
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
hiranmay
Joined: 12 Dec 2015
Last visit: 21 Feb 2026
Posts: 458
Own Kudos:
567
 [1]
Given Kudos: 87
Posts: 458
Kudos: 567
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If n is a positive integer, is 169 a factor of n?
Given: n > 0 & integer
n = 169*m ? where m is an integer from 1 to any m
=> n = 13^2*m?


(1) 52 is the greatest common divisor of 260 and n --> insufficient: 260 = 52*5, so GCD of 52*5 and n = 52, so n = 52*p=13*4*p, but p can or can't be multiple of 13
(2) 1,352 is the least common multiple of 104 and n --> sufficient: 104 = 13*2^3, so LCM of 13*2^3 & n = 1,352 = 13^2*2^3, so n must be multiple of 13^2

So the answer is B
User avatar
Kinshook
User avatar
Major Poster
Joined: 03 Jun 2019
Last visit: 26 Apr 2026
Posts: 5,987
Own Kudos:
5,860
 [1]
Given Kudos: 163
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Products:
GMAT 1: 690 Q50 V34
Posts: 5,987
Kudos: 5,860
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If n is a positive integer, is 169 a factor of n?

(1) 52 is the greatest common divisor of 260 and n
52=2*2*13
n=\(2^2*13k\)
But 169=\(13^2\)
and n is not necessarily a multiple of 169
or 169 is not necessarily a factor of n
NOT SUFFICIENT

(2) 1,352 is the least common multiple of 104 and n
1352=13*104 = \(2^3*13^2\)
104=2*2*2*13 = \(2^3*13\)
Since 1352 is least common multiple of 104 and n
=>\(13^2\) is a factor of n
=> 169 is a factor of n
SUFFICIENT

IMO B
User avatar
Abhi077
User avatar
SC Moderator
Joined: 25 Sep 2018
Last visit: 18 Apr 2025
Posts: 1,084
Own Kudos:
2,435
 [1]
Given Kudos: 1,665
Location: United States (CA)
Concentration: Finance, Strategy
GPA: 3.97
WE:Investment Banking (Finance: Investment Banking)
Products:
Posts: 1,084
Kudos: 2,435
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If n is a positive integer, is 169 a factor of n?

(1) 52 is the greatest common divisor of 260 and n
(2) 1,352 is the least common multiple of 104 and n

Question Stem Analysis:

According to the stem, we must find out whether n/169 , i.e \(\frac{n}{13^2}\) is an integer.

Statement One Alone:

Prime factorization of 52 is 13 X \(2^2\)
Prime factorization of 260 is 13 X 5 X \(2^2\)

The greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non-zero integers, is the largest positive integer that divides the numbers without a remainder.

For GCD, we pick the lowest power of common factors. we know that n consist a 13, but n can or cannot contain more than \(13^2\), because gcf of 260 and n is limited to 13 which we have in 260.

Hence this statement alone is not sufficient.

Statement Two Alone:

Prime factorization of 104 is 13 X\(2^3\)
Prime factorization of 1352 is 13 X 13 X \(2^3\)

The lowest common multiple or lowest common multiple (lcm) or smallest common multiple of two integers a and b is the smallest positive integer that is a multiple both of a and of b.

For LCM, we pick the highest power of common factors. we know that 104 just has \(13^1\), and that 1352 has \(13^2\) which definitively must have come from n. Hence we can say that n has\(13^2\) and that will make it divisible by 169.

Statement two alone is sufficient.

Hence the answer must be B
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,990
Own Kudos:
Posts: 38,990
Kudos: 1,118
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109855 posts
498 posts
212 posts