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
Roman numerals 10=(,) and results from either crossing of the thumbs, or holding both hands up in a cross. Another possibility is that each represents a finger and represents the thumb of one hand. This way the numbers between 1–10 can be counted on one hand using the order: =P, =PR, =PRM, =IT, =T, =TP, =TPR, =TPRM, =IN, =N (P=pinky, R=ring, M=middle, I=index, T=thumb N=no fingers/other hand). This pattern can also be continued using the other hand with the fingers representing and the thumb . A third hypothesis about the origins states that the basic ciphers were , , and (or )