document.write( "Question 1046143: I didn't ask the type the question right before
\n" );
document.write( "Find the smallest odd positive integer (m) so that the decimal expansion of 1/m has just 4 non recurring digits and has 2 repeating digits.
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #661702 by KMST(5345) You can put this solution on YOUR website! \n" ); document.write( "and for any \n" ); document.write( "the decimal part of \n" ); document.write( "\n" ); document.write( "So, we can represent all \n" ); document.write( " \n" ); document.write( "Then, \n" ); document.write( "has pairs of repeating digits after the 4th decimal place. \n" ); document.write( " \n" ); document.write( "For that \n" ); document.write( " \n" ); document.write( "and for \n" ); document.write( " \n" ); document.write( "Choosing \n" ); document.write( "That is the smallest odd positive integer \n" ); document.write( "However, \n" ); document.write( "because the phrase \"just 4 non recurring digits\" probably means that the third decimal places must be different from the 5th one, \n" ); document.write( "and the and fourth one must be different from the sixth one. \n" ); document.write( "So, we need to put less factors into \n" ); document.write( "leaving \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "We could keep trying to drop factors from \n" ); document.write( "until we get to \n" ); document.write( "when \n" ); document.write( "has a 4th decimal digit \n" ); document.write( "So, \n" ); document.write( " \n" ); document.write( "NOTE: there is an option that does not require trying so many factor combinations to get to \n" ); document.write( "but it does require more algebra, so it may not get to the answer faster. \n" ); document.write( " |