I am thinking an interesting number that satisfy:
.
Find the smallest value of if all given numbers are distinct positive integers.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Wolfram Mathematica exhaustive search: Flatten [ ParallelTable [ If [ a b a + a a b + ( a c ) b + b b + c b + 1 = ( a a b ) b + 1 , { a , b , c } , Nothing ] , { a , 9 } , { b , 9 } , { c , 9 } ] , 2 ] → ( 2 3 5 ) . Since the digits are distinct, that condition also has been meet. Any other values using larger integer ought to result in even larger answers as there are no subtractions in the expressions.
Wolfram Mathematica exhaustive search means write a little program that saves the triple of values of a,b,and c such that the logical expression (the comparison of the left and right sides of the given expression is itself a logical) when true saves the triple. I suspected that the variables were all less then or equal to 9 and would have tried larger values if the initial search were not successful.
See: Hardy-Ramanujan number.