Problem: n and m are each 3 - digit integers . each of the numbers 2 , 3 , 4,5 , 6 , and 7 is a digit of either n or m . what is the smallest possible positive difference between n and m ?
Rationale: "you have 6 digits : 2 , 3 , 4 , 5 , 6 , 7 each digit needs to be used to make two 3 digit numbers . this means that we will use each of the digits only once and in only one of the numbers . the numbers need to be as close to each other as possible . the numbers can not be equal so the greater number needs to be as small as possible and the smaller number needs to be as large as possible to be close to each other . the first digit ( hundreds digit ) of both numbers should be consecutive integers now let ' s think about the next digit ( the tens digit ) . to minimize the difference between the numbers , the tens digit of the greater number should be as small as possible and the tens digit of the smaller number should be as large as possible . so let ' s not use 2 and 7 in the hundreds places and reserve them for the tens places . now what are the options ? try and make a pair with ( 3 * * and 4 * * ) . make the 3 * * number as large as possible and make the 4 * * number as small as possible . 376 and 425 ( difference is 49 ) or try and make a pair with ( 5 * * and 6 * * ) . make the 5 * * number as large as possible and make the 6 * * number as small as possible . we get 574 and 623 ( difference is 49 ) b"
annotated_formula: subtract(subtract(const_100, multiply(subtract(7, 2), const_10)), const_1)