document.write( "Question 418954: \"Fold a sheet of paper in half. You should have two layers. Fold it in half again so that there are four layers. Do this as many times as you can. Make a table and record the number of folds and number of layers.\r
\n" ); document.write( "\n" ); document.write( "a. As you fold the paper in half each time, what happens to the number of layers? \r
\n" ); document.write( "\n" ); document.write( "b. Estimate the number of folds you would have to make before you have about the same number of layers as the number of sheets in this textbook (=361). \r
\n" ); document.write( "\n" ); document.write( "c. Calculate the answer for 12b. You may use a recursive routing, the graph or a table of an equation, or a trial-and-error method.\"\r
\n" ); document.write( "\n" ); document.write( "I would like to use a recursive routine.
\n" ); document.write( "

Algebra.Com's Answer #293057 by stanbon(75887)\"\" \"About 
You can put this solution on YOUR website!
a. As you fold the paper in half each time, what happens to the number of layers?
\n" ); document.write( "It gets multiplied by 2.
\n" ); document.write( "-------------------------------------
\n" ); document.write( "b. Estimate the number of folds you would have to make before you have about the same number of layers as the number of sheets in this textbook (=361).
\n" ); document.write( "2^0 = 1 page
\n" ); document.write( "2^1 = 2 pages
\n" ); document.write( "...
\n" ); document.write( "2^x = 361
\n" ); document.write( "xlog(2) = log(361)
\n" ); document.write( "x is between 8 and 9
\n" ); document.write( "---
\n" ); document.write( "8 folds gives less than 361 pages
\n" ); document.write( "9 folds gives more than 361 pages
\n" ); document.write( "=====
\n" ); document.write( "Cheers,
\n" ); document.write( "Stan H.
\n" ); document.write( "----------
\n" ); document.write( "c. Calculate the answer for 12b. You may use a recursive routing, the graph or a table of an equation, or a trial-and-error method.\"
\n" ); document.write( "I would like to use a recursive routine.
\n" ); document.write( "
\n" ); document.write( "
\n" );