Last visit was: 24 Apr 2026, 12:59 It is currently 24 Apr 2026, 12:59
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
avatar
jsphcal
Joined: 27 Feb 2012
Last visit: 27 Feb 2014
Posts: 26
Own Kudos:
291
 [13]
Given Kudos: 5
Posts: 26
Kudos: 291
 [13]
2
Kudos
Add Kudos
11
Bookmarks
Bookmark this Post
User avatar
GyanOne
Joined: 24 Jul 2011
Last visit: 23 Apr 2026
Posts: 3,241
Own Kudos:
1,722
 [1]
Given Kudos: 33
Status: World Rank #4 MBA Admissions Consultant
Expert
Expert reply
Posts: 3,241
Kudos: 1,722
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 24 Apr 2026
Posts: 109,820
Own Kudos:
811,060
 [1]
Given Kudos: 105,873
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,820
Kudos: 811,060
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Abhishek009
User avatar
Board of Directors
Joined: 11 Jun 2011
Last visit: 17 Dec 2025
Posts: 5,903
Own Kudos:
Given Kudos: 463
Status:QA & VA Forum Moderator
Location: India
GPA: 3.5
WE:Business Development (Commercial Banking)
Posts: 5,903
Kudos: 5,454
Kudos
Add Kudos
Bookmarks
Bookmark this Post
jsphcal
If \(r = 2^3 * 5^2 * 7\) and \(s = 2^2 * 3^2 * 5\), which of the following is equal to the greatest common divisor of r and s?

A. 2 * 5
B. 2^2 * 5
C. 2^3 * 5^2
D. 2*3*5*7
E. 2^3 * 3^2 *5^2 * 7

GCD of \(r = 2^3 * 5^2 * 7\) and \(s = 2^2 * 3^2 * 5\) \(= 2^2*5\)

Hence, answer will be straight , (B) \(2^2 * 5\)
User avatar
ScottTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 14 Oct 2015
Last visit: 24 Apr 2026
Posts: 22,286
Own Kudos:
26,534
 [2]
Given Kudos: 302
Status:Founder & CEO
Affiliations: Target Test Prep
Location: United States (CA)
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 22,286
Kudos: 26,534
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
jsphcal
If r = 2^3 * 5^2 * 7 and s = 2^2 * 3^2 * 5, which of the following is equal to the greatest common divisor of r and s?

A. 2 * 5
B. 2^2 * 5
C. 2^3 * 5^2
D. 2*3*5*7
E. 2^3 * 3^2 *5^2 * 7

To determine the greatest common divisor (or greatest common factor) of any two numbers, we multiply together common prime factors with the smaller exponent. We are given the following:

r = 2^3 * 5^2 * 7

AND

s = 2^2 * 3^2 * 5^1

As we can see, 2 and 5 are the common prime factors. For the prime factor 2, the smaller exponent is 2 and for 5, the smaller exponent is 1. Thus, the GCF of r and s is 2^2 x 5^1.

Answer: B
User avatar
MathRevolution
User avatar
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Last visit: 27 Sep 2022
Posts: 10,063
Own Kudos:
Given Kudos: 4
GMAT 1: 760 Q51 V42
GPA: 3.82
Expert
Expert reply
GMAT 1: 760 Q51 V42
Posts: 10,063
Kudos: 20,001
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If \(r = 2^3 * 5^2 * 7\) and \(s = 2^2 * 3^2 * 5\)


=> GCD = \(2^2 * 5\) [Take the lowest power of all the numbers which are common in both]

Answer B
User avatar
sahilvermani
Joined: 19 Oct 2020
Last visit: 10 Jan 2022
Posts: 49
Own Kudos:
Given Kudos: 11
GMAT 1: 710 Q50 V35
GMAT 2: 760 Q50 V42
GMAT 2: 760 Q50 V42
Posts: 49
Kudos: 39
Kudos
Add Kudos
Bookmarks
Bookmark this Post
r = 2^3 * 5^2 * 7 and s = 2^2 * 3^2 * 5

GCD is the greatest of the various factors that are common to both r and s.

So, GCD = 2^2*5 = 20
User avatar
GMATWhizTeam
User avatar
GMATWhiz Representative
Joined: 07 May 2019
Last visit: 17 Mar 2026
Posts: 3,374
Own Kudos:
Given Kudos: 70
Location: India
GMAT 1: 740 Q50 V41
GMAT 2: 760 Q51 V40
Expert
Expert reply
GMAT 2: 760 Q51 V40
Posts: 3,374
Kudos: 2,193
Kudos
Add Kudos
Bookmarks
Bookmark this Post
For finding the Highest Common Factor (HCF) / Greatest Common Divisor (GCD), each number has to be prime factorized and then the lowest power of each prime factor is to be considered.

The question already provides us with the prime factorised form of the numbers, so that makes our job easier.

r = \(2^3\) * \(5^2\) * 7

s = \(2^2\) * \(3^2\) * 5

Observing both the numbers,
    Lowest power of 2 = 2 (present in s)
    Lowest power of 3 = 0, since there is no power of 3 in r
    Lowest power of 5 = 1 (present in s)
    Lowest power of 7 = 0, since there is no power of 7 in s

Therefore, GCD (r and s) = \(2^2\) * \(3^0\) * \(5^1\) * \(7^0\) = \(2^2\) * 5, since any non-zero value raised to the power of zero equals 1.

The correct answer option is B.
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,976
Own Kudos:
Posts: 38,976
Kudos: 1,117
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
109820 posts
Tuck School Moderator
853 posts