document.write( "Question 1013609: A toy factory produces wooden puzzles that get sold in toy stores. The cost per puzzle, C (in dollars), to produce the puzzles, p (in hundreds) on any given day is modeled by the cost function below.
\n" ); document.write( " C= 0.006p (squared) - 0.036p + 0.7
\n" ); document.write( "Find the number of puzzles that the factory should make each day to minimize the cost per puzzle
\n" ); document.write( "

Algebra.Com's Answer #629872 by josmiceli(19441)\"\" \"About 
You can put this solution on YOUR website!
\"+C+=+.006p%5E2+-+.036p+%2B+.7+\"
\n" ); document.write( "\"+C+\" is plotted on the vertical axis
\n" ); document.write( "\"+p+\" is plotted on the horizontal axis
\n" ); document.write( "You need to find the point ( C,p ) where
\n" ); document.write( "\"+C+\" is a minimum
\n" ); document.write( "-------------------------------
\n" ); document.write( "The formula for \"+p+\" when \"+C+\" is a
\n" ); document.write( "minimum is:
\n" ); document.write( "\"+p%5Bmin%5D+=+-b%2F%282a%29+\" when the equation
\n" ); document.write( "is in the form:
\n" ); document.write( "\"+C+=+a%2Ap%5E2+%2B+b%2Ap+%2B+c+\"
\n" ); document.write( "\"+a+=+.006+\"
\n" ); document.write( "\"+b+=+-.036+\"
\n" ); document.write( "---------------
\n" ); document.write( "\"+p%5Bmin%5D+=+-%28+-.036+%29+%2F+%28+2%2A.006+%29+\"
\n" ); document.write( "\"+p%5Bmin%5D+=+.036+%2F+.012+\"
\n" ); document.write( "\"+p%5Bmin%5D+=+3+\"
\n" ); document.write( "-----------------
\n" ); document.write( "making 3 puzzles/day will minimize
\n" ); document.write( "the cost/puzzle
\n" ); document.write( "--------------------
\n" ); document.write( "check:
\n" ); document.write( "Here's the plot:
\n" ); document.write( "\"+graph%28+400%2C+400%2C+-20%2C+60%2C+-10%2C+50%2C+.006x%5E2+-+.036x+%2B+.7+%29+\"
\n" ); document.write( "Answer could be right.
\n" ); document.write( "Plug \"+p+=+3.1+\" and \"+p+=+2.9+\" into the
\n" ); document.write( "equation and see if \"+C+\" is NOT a minimum in each case
\n" ); document.write( "
\n" );