document.write( "Question 1207623: Let $m$ and $n$ be positive integers. If $m$ has exactly $10$ positive divisors, $n$ has exactly $16$ positive divisors, and $mn$ has exactly $21$ positive divisors. How many divisors does $m^2 n^2$ have?
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #845595 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Let p and q represent unknown prime numbers. \n" ); document.write( "Using the method for finding the number of positive divisors of a number, if mn has 21 positive divisors, then it is either \n" ); document.write( "If mn is \n" ); document.write( "So mn is of the form \n" ); document.write( "m has 10 positive divisors, and its prime factorization can have at most 2 different primes, and no prime factor can occur more than 6 times. The only possibility is then for m to be of the form \n" ); document.write( "Similarly, n has 16 positive divisors, and its prime factorization can have at most 2 different primes, and no prime factor can occur more than 6 times. The only possibility is then for n to be of the form \n" ); document.write( "But if mn is of the form \n" ); document.write( "So, while the problem could have been a good one for using math and logical reasoning to find the solution, the given information is inconsistent -- it is impossible for m to have 10 positive divisors, n to have 16, and mn to have 21. \n" ); document.write( "ANSWER: NO SOLUTION \n" ); document.write( " \n" ); document.write( " |