document.write( "Question 1208021: On dart board, a player can only score 2, 6 or 9 points for a throw. What is the smallest number of throws needed to get a total score of exactly 82 points? \n" ); document.write( "
Algebra.Com's Answer #846138 by math_tutor2020(3817)![]() ![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "x = number of 2 pointers \n" ); document.write( "y = number of 6 pointers \n" ); document.write( "z = number of 9 pointers \n" ); document.write( "Each variable is some nonnegative whole number {0,1,2,3,...}\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "2x+6y+9z = total number of points \n" ); document.write( "2x+6y+9z = 82\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "x+y+z = number of throws \n" ); document.write( "The goal is to minimize x+y+z \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Since z is attached to the largest coefficient, we'll make z as large as possible to find the minimum of x+y+z. \n" ); document.write( "If we made x as large as possible, then we'd be at the other end of the spectrum. \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "82/9 = 9.111 approximately \n" ); document.write( "This rounds down to 9.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "If z = 9, then 9z = 9*9 = 81 \n" ); document.write( "That leaves 82-81 = 1 point left, but of course there's no way to score 1 point with 2 pointers and/or 6 pointers. \n" ); document.write( "So there's no way to get exactly 82 points with z = 9. \n" ); document.write( "We'll decrease z by 1.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "If z = 8, then 9z = 9*8 = 72 \n" ); document.write( "There would be 82-72 = 10 points left, and now it appears to be possible to achieve a score of 10 with 2 pointers and/or 6 pointers.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The subproblem is now 2x+6y = 10 \n" ); document.write( "This turns into x+3y = 5 after dividing everything by 2.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Use a bit of trial-and-error, or you can use the Extended Euclidean Algorithm, to find one solution is (x,y) = (2,1) \n" ); document.write( "Sure enough 2x+6y = 2*2+6*1 = 4+6 = 10\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "What are some other integer solutions on x+3y = 5? \n" ); document.write( "Solve for y to get y = (-1/3)x+5/3. \n" ); document.write( "It has slope -1/3 which means to go from one point to another we move down 1 and right 3. \n" ); document.write( "Starting at (2,1) follow the \"down 1, right 3\" movement pattern to arrive at (5,0) \n" ); document.write( "Go back to (2,1). Follow the reverse of that movement pattern to go up 1, left 3, and you'll arrive at (-1,2) \n" ); document.write( "However, recall that x cannot be negative.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The only practical nonnegative integer solutions to x+3y = 5 are (2,1) and (5,0) \n" ); document.write( "In the first case we have x+y+z = 2+1+8 = 11 shots \n" ); document.write( "In the second case we have x+y+z = 5+0+8 = 13 shots \n" ); document.write( "The first case is the winner in terms of fewest number of throws.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Answer: 11 \n" ); document.write( " \n" ); document.write( " |