1089

From The Wiki Camp 2
Jump to navigation Jump to search

For any 3-digit number whose first and last digits are unique X,

((mod((abs(x-(((mod(x,10))*100)+((x-(mod(x,100)))/100)+((mod(x,100))-(mod(x,10)))))),10))*100+90+(((abs(x-(((mod(x,10))*100)+((x-(mod(x,100)))/100)+((mod(x,100))-(mod(x,10))))))-(mod((abs(x-(((mod(x,10))*100)+((x-(mod(x,100)))/100)+((mod(x,100))-(mod(x,10)))))),100)))/100))+((((abs(x-(((mod(x,10))*100)+((x-(mod(x,100)))/100)+((mod(x,100))-(mod(x,10))))))-(mod((abs(x-(((mod(x,10))*100)+((x-(mod(x,100)))/100)+((mod(x,100))-(mod(x,10)))))),100)))/100)*100+90+(mod((abs(x-(((mod(x,10))*100)+((x-(mod(x,100)))/100)+((mod(x,100))-(mod(x,10)))))),10))) = 1089

<< 1088 1090 >>