document.write( "Question 1069910: Every asterisk in the question 2*0*1*5*2*0*1*5*2*0*1*5 = 0 is to be replaced by either + or - so that the equation is correct. what is the smallest number of asterisks that must be replaced with + ? \n" ); document.write( "
Algebra.Com's Answer #685371 by KMST(5328)![]() ![]() You can put this solution on YOUR website! We see that the numbers \n" ); document.write( "A string of twelve whole numbers separated by \n" ); document.write( "can be considered a sum of twelve integer numbers, some positive, some negative, some zero. \n" ); document.write( "We can change the order of terms in that sum (commutative property), \n" ); document.write( "and we can groups numbers together (associative property) \n" ); document.write( "as we wish to make it more convenient for our calculations.\r \n" ); document.write( "\n" ); document.write( "You can safely place \n" ); document.write( "because it does not matter if \n" ); document.write( " \n" ); document.write( "To minimize the number of \n" ); document.write( "you would want then to be placed before the greatest whole numbers, \n" ); document.write( "while placing \n" ); document.write( "We know that \n" ); document.write( "We can place a \n" ); document.write( "and place \n" ); document.write( "Having \n" ); document.write( "gives you a sum of \n" ); document.write( "After doing all that, there are only 3 asterisks left to be replaced, \n" ); document.write( "one in front of \n" ); document.write( "The \n" ); document.write( "Then \n" ); document.write( "and the other \n" ); document.write( "It does not matter which \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "and each one has only |