document.write( "Question 708707: There exist pairs of integers, x and n, for which xn = (25)(4 to the 4th power)(8 to the 8/3 power )(16 to the 3/4 power). What is the greatest
\n" );
document.write( "possible value of n among these pairs? \n" );
document.write( "
Algebra.Com's Answer #436210 by KMST(5328)![]() ![]() You can put this solution on YOUR website! Of all the pairs (x,n) whose product is the same \n" ); document.write( "Since \n" ); document.write( "So we have to find \n" ); document.write( "Either way, that expression is hard to type. \n" ); document.write( "Luckily, it can be simplified, because \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "and, while we are at it, \n" ); document.write( " \n" ); document.write( "So substituting all that, we get a large number that can be calculated with a calculator, \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "NOTE 1: \n" ); document.write( "If it was specified that x, and n could not be 1, \n" ); document.write( "then the least possible positive x would be 2, \n" ); document.write( "and that would make \n" ); document.write( " \n" ); document.write( "NOTE 2: \n" ); document.write( "Since \n" ); document.write( "with \n" ); document.write( "and \n" ); document.write( "That makes the total number of positive factors \n" ); document.write( "That makes 60 (x,n) ordered pairs, or 30 {x,n} sets of factors (if order does not matter). \n" ); document.write( "Considering the negative factors doubles the possibilities. \n" ); document.write( " |