500-1000 rep for outscoring in Multiply with restricted operations
The current best score is 22 operations.
itx = 1/(1+a+b) #4
nx = -1/(itx+itx) #4
c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14
I'll give 500 rep to the first better score, that is 21 operations or fewer.
Alternatively, you can get the bounty by proving that 22 is in fact optimal, say with exhaustive search. A weaker proof or lower bound can get a partial bounty.
The maximum you can get is 1000 rep, 500 for the optimal proof, and 500 for the solution less than 22 operations long.
500 rep for outscoring in Multiply with restricted operations
The current best score is 22 operations.
itx = 1/(1+a+b) #4
nx = -1/(itx+itx) #4
c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14
I'll give 500 rep to the first better score, that is 21 operations or fewer.
Alternatively, you can get the bounty by proving that 22 is in fact optimal, say with exhaustive search. A weaker proof or lower bound can get a partial bounty.
500-1000 rep for outscoring in Multiply with restricted operations
The current best score is 22 operations.
itx = 1/(1+a+b) #4
nx = -1/(itx+itx) #4
c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14
I'll give 500 rep to the first better score, that is 21 operations or fewer.
Alternatively, you can get the bounty by proving that 22 is in fact optimal, say with exhaustive search. A weaker proof or lower bound can get a partial bounty.
The maximum you can get is 1000 rep, 500 for the optimal proof, and 500 for the solution less than 22 operations long.
500 rep for outscoring in Multiply with restricted operations
The current best score is 22 operations.
itx = 1/(1+a+b) #4
nx = -1/(itx+itx) #4
c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14
I'll give 500 rep to the first better score, that is 21 operations or fewer.
Alternatively, you can get the bounty by proving that 22 is in fact optimal, say with exhaustive search. A weaker proof or lower bound can get a partial bounty.