二進制指算法 - 维基百科,自由的百科全书
二進制指算法是一种利用一只或多只手的手指通過二進制來計數的指算法。如果一個人只用一只手的手指,他可以從0數到31,如果两只手都用的话,他可以从0數到1023,如果連两只脚的脚趾都用到的话,他可以從0數到1,048,575[1][2]。
- 0
- 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
- 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
参考文献[编辑]
- ^ It is worth noting that because computers typically store data in a minimum size of one whole byte, the idea of decimal or fractions of a byte is only used here for comparison.
- ^ Pohl, Frederik. Chasing Science reprint, illustrated. Macmillan. 2003: 304 [2023-11-19]. ISBN 978-0-7653-0829-0. (原始内容存档于2023-11-19).
|