Find smallest positive a for a = b 2 = c 3 = d 5 such that a , b , c , d are distinct integers.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
what is wrong with a = 46656 = b^2 = 216^2 = c^3 = 36^3 = d^5 = 6^5 = 46656 (a. ne. b ne.c ne.d) Ed Gray
Log in to reply
6 5 is actually 7776 .
We have d 5 = 6 5 = 7 7 7 6 = 4 6 6 5 6 .
This is why your solution doesn't work.
I do not know what the symbol that you are using that is on the line 'a, a^(1/2), a^1/3), a^(1/5) SYMBOL Z - (The symbol that looks like the euro sign or a curved E.) Most respectfully yours, David
Log in to reply
that symbol represents/means "belongs to/is an element of" for e.g 1 ∈ N i.e one belongs to/ is an element of natural numbers (N)
Oh!I solved it but didn't use the calculator..So clicked on the solution
Exactly !!! Did the same
We know that a , a , 3 a , and 5 a must be positive integers. Another way of looking at this is that a 2 1 , a 3 1 , and a 5 1 must have positive integer exponents. This is only achieved if the exponent of a is a multiple of 2, 3, and 5. Since we're looking for the smallest a , it's natural that we want the l c m ( 2 , 3 , 5 ) = 3 0 to be the exponent.
So we know that a = x 3 0 . Again, since we want the smallest integer a , we have to pick a = 2 3 0 , since 1 wouldn't give us distinct integers.
This gives us 2 3 0 = 1 0 7 3 7 4 1 8 2 4 as the smallest positive a .
Actually with the given conditions , 2^(lcm(2,3,5)) will be the answer...
We have l c m ( 2 , 3 , 5 ) = 3 0
Now we know that ( a = x 3 0 , for some x ∈ N
So we have solutions for a as 1 3 0 , 2 3 0 , 3 3 0 , 4 3 0 . . . . .
But 2 3 0 is number within our conditions.
So our answer is 1 0 7 3 7 4 1 8 2 4 .
a = b 2 = c 3 = d 5
And a , b 2 , c 3 , d 5 distinct is that possible?
I think you want to say a , b , c , d are different
I also added the term "distinct integers", since otherwise we could have a = 0 . 1 .
Did the same!Nice solution...
Did the same!
In the prime factorization of a, all the exponents must be divisible by 2 , 3 , and 5 .
l c m ( 2 , 3 , 5 ) = 3 0
Obviously, we want to raise one prime to the 3 0 t h power.
The least prime is 2 .
2 3 0 = 1 0 7 3 7 4 1 8 2 4
Since all are distinct, it follows that a > 1. a. b, c, d all have a unique prime factorization.. If a is the 2nd ,3rd, and 5th power of b, c, and d, the powers of its prime factors will be divisible by 2,3, and 5 based on the unique prime factorization of b, c and d. The least common multiple of 2,3,5 is 30. The smallest prime is 2. Thus 2 3 0 = 1 , 0 7 3 , 7 4 1 , 8 2 4 is the least possible value of a.
What about 64?
Problem Loading...
Note Loading...
Set Loading...
a = b 2 = c 3 = d 5 ∴ b = a 1 / 2 ∴ c = a 1 / 3 ∴ d = a 1 / 5 ∴ a , a 1 / 2 , a 1 / 3 , a 1 / 5 ∈ Z ∴ a L C M ( 2 , 3 , 5 ) 1 ∈ Z ∴ a 1 / 3 0 ∈ Z S o w e c a n s a y t h a t a = z 3 0 , w h e r e z ∈ Z min z 5 = z 3 = z 2 = z z = 2 ∴ min a = 2 3 0 = 1 0 7 3 7 4 1 8 2 4