Last visit was: 23 Jun 2024, 20:58 It is currently 23 Jun 2024, 20:58
Toolkit
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

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.

# If a and b are positive integers such that gcd(a,b)=13, then find the

SORT BY:
Tags:
Show Tags
Hide Tags
Retired Moderator
Joined: 19 Oct 2018
Posts: 1868
Own Kudos [?]: 6540 [16]
Given Kudos: 705
Location: India
Director
Joined: 25 Oct 2015
Posts: 516
Own Kudos [?]: 886 [1]
Given Kudos: 74
Location: India
GMAT 1: 650 Q48 V31
GMAT 2: 720 Q49 V38 (Online)
GPA: 4
Intern
Joined: 06 Feb 2020
Posts: 25
Own Kudos [?]: 79 [2]
Given Kudos: 64
Director
Joined: 25 Oct 2015
Posts: 516
Own Kudos [?]: 886 [1]
Given Kudos: 74
Location: India
GMAT 1: 650 Q48 V31
GMAT 2: 720 Q49 V38 (Online)
GPA: 4
Re: If a and b are positive integers such that gcd(a,b)=13, then find the [#permalink]
1
Kudos
funkyakki wrote:
Hi, can you please explain that for case when x = 2, why i can't take the value $$b_4.\\ \\ For example,\\ \\ b_4 = 13^4*m$$; $$GCD_4 = 13^4$$

Arun wrote:
GCD(a,b)=13
$$a=13^x∗k$$ (a has 13 one factor and some other integer not common to b)
$$b=13^y∗m$$ (b has 13 one factor and some other integer not common to a)
such that minimum value between x and y has to 1.

when x = 2, the $$a^3=13^6∗k^3$$
$$GCD(a^3,b)$$
b can take the following values
$$b_1=13∗m; GCD_1=13$$

Hi funkyakki,
here b can not take any higher powers.
lets take the case,
$$b_2=13^2∗m; GCD_2=13^2$$
minimum value of x,y is 2.
once we focus on GCD value, we can see that GCD is now 13^2 and it violates the constraint given in the question stem: gcd(a,b)=13.
Hence for any higher powers of x = 2,3,4... there will be only one value for y, y =1.
This will also limit the GCD value of $$GCD(a^3,b)$$ to 13 thereby creating no more distinct GCD values.
VP
Joined: 10 Jul 2019
Posts: 1387
Own Kudos [?]: 564 [1]
Given Kudos: 1656
Re: If a and b are positive integers such that gcd(a,b)=13, then find the [#permalink]
1
Kudos
Basic Concept: if we raise any given integer to a positive integer Power, the UNIQUE Prime Factors that make up that number will not change ——-> only the amount of those Unique Prime Numbers will change

If the GCF of (A , B) = 13

Then when we raise A to the 3rd Power and keep B the same, the same Unique Prime Factors that divide into A and B will be there. All that will change is the amount.

Case 1:

A = 13x

B = 13y

Since GCF = 13, x and y are co-prime

When we raise A to the 3rd Power, the two values will still only share a Factor of 13

Case 2:
A = 13x
B = (13)^2 y

Where x and y are co-prime such that the GCD(A,B) = 13

Right now all A and B shares is the common factor of one 13

However when we Cube A, there will be 3 more prime factors of 13 that make up A

The GCF will now become (13)^2

Case 3:
A = 13x
B = (13)^3 y

Originally, like the others, the GCF of A and B = 13 ———- the only factor they share is a 13

However if we Cube A ———> (A)^3 will now have THREE 13s and the new Greatest Shared Factor will be (13)^3

Sum of all possible GCFs:

13 + (13)^2 + (13)^3 = 2,379

D

Posted from my mobile device
Intern
Joined: 06 Feb 2020
Posts: 22
Own Kudos [?]: 2 [0]
Given Kudos: 11
Location: India
Schools: Bayes (I)
GMAT 1: 700 Q47 V39
GPA: 2.1
Re: If a and b are positive integers such that gcd(a,b)=13, then find the [#permalink]
ArunSharma12 wrote:
nick1816 wrote:
If a and b are positive integers such that gcd(a,b)=13, then find the sum of all possible distinct values of $$gcd(a^3,b)$$.

gcd = Greatest common divisor

A. 13
B. 2197
C. 2210
D. 2379
E. Can't be determined

GCD(a,b)=13
$$a = 13^x * k$$ (a has 13 one factor and some other integer not common to b)
$$b = 13^y * m$$ (b has 13 one factor and some other integer not common to a)
such that minimum value between x and y has to 1.

if x = 1, the $$a^3 = 13^3 * k^3$$
$$GCD(a^3,b)$$:
b can take the following values
$$b_1 = 13*m$$; $$GCD_1 = 13$$
$$b_2 = 13^2*m$$; $$GCD_2 = 13^2$$
$$b_3 = 13^3*m$$; $$GCD_3 = 13^3$$
after this if we increase the power of 13 in b, it'll start giving us the GCD as $$13^3$$.

when x = 2, the $$a^3 = 13^6 * k^3$$
$$GCD(a^3,b)$$:
b can take the following values
$$b_1 = 13*m$$; $$GCD_1 = 13$$

sum of all possible distinct values of gcd(a3,b) = $$13 +13^2 + 13^3$$ = 2379
Ans: D

Hi, can you please explain that for case when x = 2, why i can't take the value $$b_4.\\ \\ For example,\\ \\ b_4 = 13^4*m$$; $$GCD_4 = 13^4$$
Non-Human User
Joined: 09 Sep 2013
Posts: 33686
Own Kudos [?]: 841 [0]
Given Kudos: 0
Re: If a and b are positive integers such that gcd(a,b)=13, then find the [#permalink]
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Re: If a and b are positive integers such that gcd(a,b)=13, then find the [#permalink]
Moderator:
Math Expert
93964 posts