Name: Anonymous 2012-03-01 20:30
Say I have an integer, x, and I want to multiply this number by another integer, y, to produce certain numerical patterns within a certain scope.
For instance x is 671, and I want to multiply it into a seven digit number that has as many 9s in it as possible, repeating digits preferred but not required. I know I can't get x999999 from it, but are there any math tricks to finding out the highest number of the specified digit (in this case 9) being in all of the products of x and y within the scope of z digits with y being the operative/working variable*?
*(x, z, and the desired digit(s)/digit patterns ex;"11", "12", "8675309" and what have you, are provided, solving for y in this case I guess)
For instance x is 671, and I want to multiply it into a seven digit number that has as many 9s in it as possible, repeating digits preferred but not required. I know I can't get x999999 from it, but are there any math tricks to finding out the highest number of the specified digit (in this case 9) being in all of the products of x and y within the scope of z digits with y being the operative/working variable*?
*(x, z, and the desired digit(s)/digit patterns ex;"11", "12", "8675309" and what have you, are provided, solving for y in this case I guess)