Metadata
Author: Common crawl
Data
English[en]
So far, the remainder is 8 (1000 in binary), and 11 * 2^1 is the highest value that is less than or equal to this remainder, so we subtract that value from the remainder, and we set bit 1 of the result because we subtracted the divisor multiplied by two to the power of 1.
Spanish[es]
Hasta aquí, el resto es 8 (1000 en binario), y 11 * 2^1 es el valor más alto que resulta menor o igual que este resto, así que restamos ese valor y encendemos el bit 1 del resultado porque restamos el divisor multiplicado por dos elevado a la 1.