document.write( "Question 253439: 1) if 2^n + 1 is a prime show that n is a power of 2.
\n" );
document.write( "it indicates directly to fermat numbers but i can't connect this question with fermat numbers.
\n" );
document.write( "2) a printer numbers all the pages of a book starting with 1 and uses 3189 digits in all.how many pages does the book have?
\n" );
document.write( "i have asked 2 questions which is within the limit. please if u can , answer them. \n" );
document.write( "
Algebra.Com's Answer #185735 by richwmiller(17219)![]() ![]() You can put this solution on YOUR website! http://en.wikipedia.org/wiki/Fermat_number#Other_theorems_about_Fermat_numbers\r \n" ); document.write( "\n" ); document.write( "The proof is there.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "1-9=9 \n" ); document.write( "10-99=2*90 \n" ); document.write( "100-999=3*900 \n" ); document.write( "2700 \n" ); document.write( "180 \n" ); document.write( "9 \n" ); document.write( "2889 \n" ); document.write( "3189-2889=300 \n" ); document.write( "300/4=75 \n" ); document.write( "1000+74=1074\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |