Just wanted to clarify.. The operation of the Riemann Sum is addition. It can also be used to signify subtraction by adding negative numbers. We also have an iteration of multiplication by using exponents. For example, 2^3 = 2 * 2 * 2. But even then the complexity doesn't reach to that accomplished behind the formalism of the Riemann Sum. I was thinking.. do we have something akin to the Riemman sum for the operation of division? I know it is tempting to say negative exponents, but is there research regarding the notation akin to the complexity reached by the Riemann sum?