If a, b, and c are different prime numbers and if a2c, ab, and abc
are all factors of t, what is the smallest number of positive integers
by which t could be divisible?
8
10
12
14
16
Prime numbers and divisibilty
This topic has expert replies
-
- Senior | Next Rank: 100 Posts
- Posts: 41
- Joined: Tue Nov 15, 2011 8:06 am
-
- Master | Next Rank: 500 Posts
- Posts: 124
- Joined: Mon Jun 16, 2008 11:07 am
- Thanked: 21 times
- Followed by:14 members
- GMAT Score:750
I'm not 100% I understand the question correctly, but the way I read it:
We have a number, t, that has factors: 2*a*c, a*b, and a*b*c. And we want to know what the smallest number of potential integers t could be divisible by. We also know a, b, and c are prime.
To solve this problem, I am going to assume that t is equal to a*b*c. Since a*b*c is the largest of the factors above, we'll assume this is the largest factor. The second assumption I'll make is that one of the three variables is equal to 2. We only know that a, b, and c are different prime numbers. They don't necessarily have to be different than another factor we already know about.
If we make those assumptions, listing the factors is equal to listing all the combinations of a, b, and c:
1, a, b, c, ab, bc, ac, abc
So the answer is (hopefully) equal to 8
OA?
We have a number, t, that has factors: 2*a*c, a*b, and a*b*c. And we want to know what the smallest number of potential integers t could be divisible by. We also know a, b, and c are prime.
To solve this problem, I am going to assume that t is equal to a*b*c. Since a*b*c is the largest of the factors above, we'll assume this is the largest factor. The second assumption I'll make is that one of the three variables is equal to 2. We only know that a, b, and c are different prime numbers. They don't necessarily have to be different than another factor we already know about.
If we make those assumptions, listing the factors is equal to listing all the combinations of a, b, and c:
1, a, b, c, ab, bc, ac, abc
So the answer is (hopefully) equal to 8
OA?
Taking the GMAT Again...PhD this time!
October 2008 Score: GMAT - 750 (50 Q, 41 V)
Manhattan GMAT 1 - 11/20/11 - 750 (50 Q, 42 V)
Manhattan GMAT 2 - 12/3/11 - 780 (51 Q, 45 V)
October 2008 Score: GMAT - 750 (50 Q, 41 V)
Manhattan GMAT 1 - 11/20/11 - 750 (50 Q, 42 V)
Manhattan GMAT 2 - 12/3/11 - 780 (51 Q, 45 V)
-
- Master | Next Rank: 500 Posts
- Posts: 385
- Joined: Fri Sep 23, 2011 9:02 pm
- Thanked: 62 times
- Followed by:6 members
i didnt seem to understand the problem i think you wanted to mention factors as a^2*c,ab,bcbharti.2010 wrote:If a, b, and c are different prime numbers and if a2c, ab, and abc
are all factors of t, what is the smallest number of positive integers
by which t could be divisible?
8
10
12
14
16
is it 12?
since t is having factors a^2*c,ab,bc
t should be atleast a^2*b*c
so no of factors is 3*2*2 = 12
user123321
Just started my preparation
Want to do it right the first time.
Want to do it right the first time.
GMAT/MBA Expert
- Mike@Magoosh
- GMAT Instructor
- Posts: 768
- Joined: Wed Dec 28, 2011 4:18 pm
- Location: Berkeley, CA
- Thanked: 387 times
- Followed by:140 members
So (a^2)c, ab, and abc are all factors of t. The LCM of those three factors is (a^2)bc, so t must be divisible by (a^2)bc.
Now, we need an important fact about factors. To count the total number of factors of a number t, we must
(1) find the prime factorization
(2) find the set of exponents of the prime factors
(3) add one to each exponent
(4) find the product of those numbers
So, assume the prime factorization of t is (a^2)bc --- t may include more factors, but this at least establishes a minimum.
The exponents of prime factors a, b, and c, comprise the set = {2, 1, 1}
Add one to each --> (3, 2, 2}
Find the product of those numbers: 3*2*2 = 12
Therefore, at a minimum, t has 12 factors. Answer choice C.
Does that make sense? Please let me know if you have any questions about this.
Mike
Now, we need an important fact about factors. To count the total number of factors of a number t, we must
(1) find the prime factorization
(2) find the set of exponents of the prime factors
(3) add one to each exponent
(4) find the product of those numbers
So, assume the prime factorization of t is (a^2)bc --- t may include more factors, but this at least establishes a minimum.
The exponents of prime factors a, b, and c, comprise the set = {2, 1, 1}
Add one to each --> (3, 2, 2}
Find the product of those numbers: 3*2*2 = 12
Therefore, at a minimum, t has 12 factors. Answer choice C.
Does that make sense? Please let me know if you have any questions about this.
Mike
Magoosh GMAT Instructor
https://gmat.magoosh.com/
https://gmat.magoosh.com/
- ronnie1985
- Legendary Member
- Posts: 626
- Joined: Fri Dec 23, 2011 2:50 am
- Location: Ahmedabad
- Thanked: 31 times
- Followed by:10 members
It seems that the the question says that t is divisible by each of (a^2)c, ab, and abc
Which means that t must be divisible by (a^2)bc and then the no of factors = 3*2*2 = 12
Which means that t must be divisible by (a^2)bc and then the no of factors = 3*2*2 = 12
Follow your passion, Success as perceived by others shall follow you
-
- Senior | Next Rank: 100 Posts
- Posts: 41
- Joined: Tue Nov 15, 2011 8:06 am
-
- Master | Next Rank: 500 Posts
- Posts: 382
- Joined: Thu Mar 31, 2011 5:47 pm
- Thanked: 15 times
a,b and c are prime
a^2c, ab, abc are factors of t
we can write like the following
t= a*a*b*c which satisfies above factors..
No of positive factors=(p+1)(q+1)(r+1)=3*2*2=12
a^2c, ab, abc are factors of t
we can write like the following
t= a*a*b*c which satisfies above factors..
No of positive factors=(p+1)(q+1)(r+1)=3*2*2=12
- karthikpandian19
- Legendary Member
- Posts: 1665
- Joined: Thu Nov 03, 2011 7:04 pm
- Thanked: 165 times
- Followed by:70 members
I could nt understand the last line of your explanation?
What is p, q, r?
What is p, q, r?
ArunangsuSahu wrote:a,b and c are prime
a^2c, ab, abc are factors of t
we can write like the following
t= a*a*b*c which satisfies above factors..
No of positive factors=(p+1)(q+1)(r+1)=3*2*2=12
Regards,
Karthik
The source of the questions that i post from JUNE 2013 is from KNEWTON
---If you find my post useful, click "Thank" ---
---Never stop until cracking GMAT---
Karthik
The source of the questions that i post from JUNE 2013 is from KNEWTON
---If you find my post useful, click "Thank" ---
---Never stop until cracking GMAT---
GMAT/MBA Expert
- Mike@Magoosh
- GMAT Instructor
- Posts: 768
- Joined: Wed Dec 28, 2011 4:18 pm
- Location: Berkeley, CA
- Thanked: 387 times
- Followed by:140 members
Dear karthikpandian19karthikpandian19 wrote:I couldn't understand the last line of your explanation? What is p, q, r?
I happy to help here.
I think what ArunangsuSahu did relatively quickly, in a few lines, will be a little more clear if you look at the step-by-step procedure I spelled out in my post above. In ArunangsuSahu's post, p & q & r are the exponents of the prime factors of t. ArunangsuSahu is clearly very talented in math, but I could see that his work might not be the most comprehensible if you are still trying to make sense of these topics.
I think you may find this blog article help --- it covers all the basics of this topic thoroughly.
https://magoosh.com/gmat/2012/gmat-math-factors/
You may also find this free video helpful:
https://gmat.magoosh.com/lessons/310-gre ... on-divisor
Here's a free practice question on the same concepts:
https://gmat.magoosh.com/questions/865
When you submit your answer to that question, the following page will have a complete video explanation of the question. Each of Magoosh's 800+ GMAT questions has its own video explanation, for accelerated learning.
I hope all that is helpful. Please let me know if have any further questions.
Mike
Magoosh GMAT Instructor
https://gmat.magoosh.com/
https://gmat.magoosh.com/