Consider the equation a?b?c =d.
Here a, b and c are 3 distinct integers from 0 to 9 (each inclusive) and “?” represents any
indicators out of “+”, “-“, “x” of “÷”. Note that the two query marks might symbolize the identical
operation or 2 diferent operations of the 4 operations given above.

Note that you’ll want to use the BODMAS Rule whereas coping with the equations that we create
on this method.
Find the smallest pure quantity that can not be created on this method.

I acquired this query from my courses. I can not discover a specific algorithm for this however by trial and error I believe the reply needs to be 81. Can somebody please let me know the right way to discover it.