Finger binary this is (512 + 256)/1024 = 768/1024 = 3/4. If using only one hand (left or right), it would be (16 + 8)/32 = 24/32 = 3/4 also. The simplification process can itself be greatly simplified by performing a bit shift operation: all digits to the right of the rightmost raised finger (i.e., all trailing zeros) are discarded and the rightmost raised finger is treated as the ones digit. The digits are added together using their now-shifted values to determine the numerator and the rightmost finger's original value is used to determine the denominator. For instance, if the thumb and
Prime-counting function numbers. On the other hand, the computation of formula_29 can be done using the following rules: Using his method and an IBM 701, Lehmer was able to compute formula_57. Further improvements to this method were made by Lagarias, Miller, Odlyzko, Deléglise and Rivat. Other prime-counting functions are also used because they are more convenient to work with. One is Riemann's prime-counting function, usually denoted as formula_58 or formula_59. This has jumps of 1/"n" for prime powers "p", with it taking a value halfway between the two sides at discontinuities. That added detail is used because then the function may be