This article includes a list ofgeneral references, butit lacks sufficient correspondinginline citations. Please help toimprove this article byintroducing more precise citations.(January 2009) (Learn how and when to remove this message)

Finger binary is a system forcounting and displayingbinary numbers on thefingers of either or bothhands. Each finger represents one binary digit orbit. This allows counting from zero to 31 using the fingers of one hand, or 1023 using both: that is, up to 2⁵−1 or 2¹⁰−1 respectively.

Modern computers typically store values as some whole number of 8-bitbytes, making the fingers of both hands together equivalent to 1¼ bytes of storage—in contrast to less than half a byte when using ten fingers to count up to 10.^[1]

In the binary number system, eachnumerical digit has two possible states (0 or 1) and each successive digit represents an increasingpower of two.

Note: What follows is but one of several possible schemes for assigning the values 1, 2, 4, 8, 16, etc. to fingers, not necessarily the best. (see below the illustrations.): The rightmost digit represents two to thezeroth power (i.e., it is the "ones digit"); the digit to its left represents two to the first power (the "twos digit"); the next digit to the left represents two to the second power (the "fours digit"); and so on. (Thedecimal number system is essentially the same, only that powers of ten are used: "ones digit", "tens digit" "hundreds digit", etc.)

It is possible to useanatomical digits to representnumerical digits by using a raised finger to represent a binary digit in the "1" state and a lowered finger to represent it in the "0" state. Each successive finger represents a higher power of two.

With palms oriented toward the counter's face, the values for when only the right hand is used are:

When only the left hand is used:

When both hands are used:

And, alternately, with the palms oriented away from the counter:

The values of each raised finger are added together to arrive at a total number. In the one-handed version, all fingers raised is thus31 (16 + 8 + 4 + 2 + 1), and all fingers lowered (a fist) is 0. In the two-handed system, all fingers raised is1,023 (512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1) and two fists (no fingers raised) represents 0.

It is also possible to have each hand represent an independent number between 0 and 31; this can be used to represent various types of paired numbers, such asmonth andday, X-Ycoordinates, or sports scores (such as fortable tennis orbaseball). Showing the time as hours and minutes is possible using 10 fingers, with the hour using 4 fingers (1-12) and the minutes using 6 fingers (0-59).

• 
  0 =empty sum
• 
  1 = 1
• 
  2 = 2
• 
  4 = 4
• 
  6 = 4 + 2
• 
  7 = 4 + 2 + 1
• 
  14 = 8 + 4 + 2
• 
  16 = 16
• 
  19 = 16 + 2 + 1
• 
  26 = 16 + 8 + 2
• 
  28 = 16 + 8 + 4
• 
  30 = 16 + 8 + 4 + 2
• 
  31 = 16 + 8 + 4 + 2 + 1
• 

When used in addition to the right.

• 
  512 = 512
• 
  256 = 256
• 
  768 = 512 + 256
• 
  448 = 256 + 128 + 64
• 
  544 = 512 + 32
• 
  480 = 256 + 128 + 64 + 32
• 
  992 = 512 + 256 + 128 + 64 + 32

Just as fractional and negative numbers can be represented in binary, they can be represented in finger binary.

Representing negative numbers is extremely simple, by using the leftmost finger as asign bit: raised means the number is negative, in asign-magnitude system. Anywhere between −511 and +511 can be represented this way, using two hands. Note that, in this system, both a positive and a negative zero may be represented.

If a convention were reached on palm up/palm down or fingers pointing up/down representing positive/negative, you could maintain 2¹⁰ −1 in both positive and negative numbers (−1,023 to +1023, with positive and negative zero still represented).

Fractions can be stored natively in a binary format by having each finger represent a fractional power of two:${\displaystyle \frac{1}{2^x}}$. (These are known asdyadic fractions.)

Using the left hand only:

Using two hands:

The total is calculated by adding all the values in the same way as regular (non-fractional) finger binary, then dividing by the largest fractional power being used (32 for one-handed fractional binary, 1024 for two-handed), andsimplifying the fraction as necessary.

For example, with thumb and index finger raised on the left hand and no fingers raised on the right hand, 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 abit 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 thenumerator and the rightmost finger's original value is used to determine thedenominator.

For instance, if the thumb and index finger on the left hand are the only raised digits, the rightmost raised finger (the index finger) becomes "1". The thumb, to its immediate left, is now the 2s digit; added together, they equal 3. The index finger's original value (1/4) determines the denominator: the result is 3/4.

Combinedinteger and fractional values (i.e.,rational numbers) can be represented by setting aradix point somewhere between two fingers (for instance, between the left and right pinkies). All digits to the left of the radix point are integers; those to the right are fractional.

Dyadic fractions, explained above, have limited use in a society based around decimal figures. A simple non-dyadic fraction such as 1/3 can be approximated as 341/1024 (0.3330078125), but the conversion between dyadic anddecimal (0.333) orvulgar (1/3) forms is complicated.

Instead, either decimal or vulgar fractions can be represented natively in finger binary. Decimal fractions can be represented by using regular integer binary methods and dividing the result by 10, 100, 1000, or some other power of ten. Numbers between 0 and 102.3, 10.23, 1.023, etc. can be represented this way, in increments of 0.1, 0.01, 0.001, etc.

Vulgar fractions can be represented by using one hand to represent thenumerator and one hand to represent thedenominator; a spectrum of rational numbers can be represented this way, ranging from 1/31 to 31/1 (as well as 0).

In theory, it is possible to use other positions of the fingers to represent more than two states (0 and 1); for instance, aternary numeral system (base 3) could be used by having a fully raised finger represent 2, fully lowered represent 0, and "curled" (half-lowered) represent 1. This would make it possible to count up to 242 (3⁵−1) on one hand or 59,048 (3¹⁰−1) on two hands. In practice, however, many people will find it difficult to hold all fingers independently (especially the middle and ring fingers) in more than two distinct positions.

• Chisanbop
• Senary § Finger counting

• Pohl, Frederik (2003).Chasing Science (reprint, illustrated ed.). Macmillan. p. 304.ISBN 978-0-7653-0829-0.
• Pohl, Frederik (1976).The Best of Frederik Pohl. Sidgwick & Jackson. p. 363.ISBN 978-0-283-98341-2.
• Fahnestock, James D. (1959).Computers and how They Work. Ziff-Davis Pub. Co. p. 228.

• Binary Counting

• Finger-counting
• Elementary arithmetic
• Binary arithmetic

• Articles with short description
• Short description matches Wikidata
• Articles lacking in-text citations from January 2009
• All articles lacking in-text citations