Let m and n be the least positive integers such that 5 m 3 and 4 n 4 each have exactly 2015 positive divisors. Find n m .
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.
@Prasun Biswas , we really liked your comment, and have converted it into a solution. If you subscribe to this solution, you will receive notifications about future comments.
To solve this problem, we need to know how to find the number of divisors for a positive integer. We can do this by looking at the prime factorization of said integer. For example, the prime factorization of 4 2 0 is 2 2 ∗ 3 ∗ 5 ∗ 7 . The number of divisors 2 2 has is 2 + 1 : 1 , 2 1 , 2 2 . By extension 3 has 1 + 1 divisors, as with 5 and 7. By multiplying the number of divisors each prime factor has, we can conclude that 4 2 0 has a total of 2 4 divisors.
In our problem, we first factorize 2 0 1 5 into 5 ∗ 1 3 ∗ 3 1 . Building on what we learned earlier, we can conclude that in order for 5 m 3 and 4 n 4 to have 2 0 1 5 divisors their prime factorizations must include prime numbers raised to the 4 t h , 1 2 t h and 3 0 t h powers.
Armed with this information, lets look at 5 m 3 . The first thing we notice is that the coefficient is 5 . Since we are raising m to the 3 r d power, we can include 5 as part of m , because raising 5 to the 3 r d power then multiplying by 5 again will give us our target exponent degree of 4 . Next, lets take the smallest prime number 2 and raise it to the 1 0 t h power. We use 2 because we are looking for the least positive integer value for m and n and using 2 yields the lowest final product. Since we are raising m to the 3 r d power, ( 2 1 0 ) 3 will give us our target exponent degree of 3 0 . Finally, we take the second smallest prime number, 3 and raise it to the 4 t h power. 3 4 3 gives us our final target exponent degree of 4. Multiplying these factors together we know that m = 2 1 0 ∗ 3 4 ∗ 5 .
We can apply a similar process to 4 n 4 and find our value for n . Our coefficient in this case is 4 , which is equal to 2 2 . Subtracting 2 from our target exponent degree of 3 0 we get 2 8 . So we raise 2 to the 7 t h degree because when we take 2 7 4 and add 2 we reach 3 0 . From here on we can straightforwardly take the next two prime numbers 3 and 5 and raise them to the 4 t h and 1 s t powers respectively. When raise to the 3 t h power they give us our final target degrees of 1 2 and 4 . Multiplying these factors together we know that n = 2 7 ∗ 3 3 ∗ 5 .
The final step is simply to divide m by n . Most of the exponents cancel out and we are left with 2 3 ∗ 3 or 2 4 .
[This comment has been converted into a solution]
Log in to reply
Exactly did in the same way. But never knew about "theorem of divisors". Thanx for discussing the topic.
Nice solution! Surely, you mean ( 2 1 0 ) 3 instead of 2 1 0 3 , right?
Your solution so long. I m going to up my point tomorow so that we can discuss
Problem Loading...
Note Loading...
Set Loading...
2 0 1 5 = 5 × 1 7 × 3 1 = 5 × 4 0 3 = 3 1 × 6 5 = 1 3 × 1 5 5
By the theorem of divisors , if any positive integer x has exactly 2 0 1 5 positive divisors, then x must have one of the following forms (where p , q , r are primes):
x = p 2 0 1 4 or p 4 q 4 0 2 or p 3 0 q 6 4 or p 1 2 q 1 5 4 or p 4 q 3 0 r 1 2
It is trivial to note that for { p , q , r } = { 2 , 3 , 5 } , the form p 4 q 3 0 r 1 2 gives the smallest value among all the forms. Also, note that it satisfies both the conditions for 5 m 3 and 4 n 4 .
For 5 m 3 , since 5 is a prime and 5 ∣ 5 m 3 , one of p , q , r must be 5 . To get integral value of m , take p = 5 and to minimize the value, take q = 2 , r = 3 . That leaves us with,
min ( m 3 ) = ( 5 ⋅ 2 1 0 ⋅ 3 4 ) 3 ⟹ min ( m ) = 5 ⋅ 2 1 0 ⋅ 3 4
Now, similarly, we proceed for 4 n 4 . Since 4 = 2 2 and 2 is a prime, one of p , q , r must be 2 . Using the same motivation as before, we take q = 2 and to minimize the value, we take p = 5 , r = 3 . That leaves us with,
min ( n 4 ) = ( 2 7 ⋅ 3 3 ⋅ 5 ) 4 ⟹ min ( n ) = 2 7 ⋅ 3 3 ⋅ 4
∴ min ( n ) min ( m ) = 8 × 3 = 2 4
If one wishes, he/she can test all the other forms too where all the problem conditions are fulfilled. But here, only this form gives the minimum values for m , n .