# Monthly Archives: October 2022

# Straight to Shell

# The Devil’s Digits

As I’ve said before, I love the way that numbers can come in many different guises. For example, take the number 21. It comes in all these guises:

21 = 10101 in base 2 = 210 in base 3 = 111 in b4 = 41 in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21 in b10 = 1A in b11 = 19 in b12 = 18 in b13 = 17 in b14 = 16 in b15 = 15 in b16 = 14 in b17 = 13 in b18 = 12 in b19 = 11 in b20 = 10 in b21

But I’ve not chosen 21 at random. If you sum the 1s in the representations of 21 in bases 2 to 21, look what you get:

21 = 10101 in base 2 = 210 in base 3 = 111 in b4 = 41 in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21 in b10 = 1A in b11 = 19 in b12 = 18 in b13 = 17 in b14 = 16 in b15 = 15 in b16 = 14 in b17 = 13 in b18 = 12 in b19 = 11 in b20 = 10 in b21

21 = 1

_{s=1}01_{s=2}01_{s=3}in base 2 = 21_{s=4}0 in base 3 = 111_{s=7}in b4 = 41_{s=8}in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21_{s=9}in b10 = 1_{s=10}A in b11 = 1_{s=11}9 in b12 = 1_{s=12}8 in b13 = 1_{s=13}7 in b14 = 1_{s=14}6 in b15 = 1_{s=15}5 in b16 = 1_{s=16}4 in b17 = 1_{s=17}3 in b18 = 1_{s=18}2 in b19 = 11_{s=20}in b20 = 1_{s=21}0 in b21

In other words, 21 = digcount(21,dig=1,base=2..21). But n = digcount(n,dig,b=2..n) doesn’t happen for any other digit and doesn’t happen often with 1:

3 = digcount(3,d=1,b=2..3) = 11 in b2 = 10 in b3

4 = digcount(4,d=1,b=2..4) = 100 in b2 = 11 in b3 = 10 in b4

6 = digcount(6,d=1,b=2..6) = 110 in b2 = 20 in b3 = 12 in b4 = 11 in b5 = 10 in b6

10 = digcount(10,d=1) = 1010 in b2 = 101 in b3 = 22 in b4 = 20 in b5 = 14 in b6 = 13 in b7 = 12 in b8 = 11 in b9 = 10 in b10

15 = digcount(15,d=1) = 1111 in b2 = 120 in b3 = 33 in b4 = 30 in b5 = 23 in b6 = 21 in b7 = 17 in b8 = 16 in b9 = 15 in b10 = 14 in b11 = 13 in b12 = 12 in b13 = 11 in b14 = 10 in b15

21 = digcount(21,d=1) = 10101 in b2 = 210 in b3 = 111 in b4 = 41 in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21 in b10 = 1A in b11 = 19 in b12 = 18 in b13 = 17 in b14 = 16 in b15 = 15 in b16 = 14 in b17 = 13 in b18 = 12 in b19 = 11 in b20 = 10 in b21

After that, the digcount(n,d=1,b=2..n) → n/2 (see “Digital Dissection” for further discussion). But I decided to look for the first n where digcount(n,dig,b=2..n) = 666:

digcount(1270,1) = 666

digcount(3770,2) = 666

digcount(7667,3) = 666

digcount(12184,4) = 666

digcount(18845,5) = 666

digcount(25806,6) = 666

digcount(34195,7) = 666

digcount(43352,8) = 666

digcount(54693,9) = 666

It doesn’t stop there, of course. You can carry on for ever, looking for digcount(n,A) = 666, digcount(n,B) = 666, digcount(n,C) = 666, where A = 10, B = 11 and C=12, and so on. But it doesn’t start there, either. What about digcount(n,0) = 666? That isn’t easy to find, because 0 usually occurs far less often than other digits in the representation of n. Here are the integers setting records for digcount(n,0,b=2..n):

2 → digcount(2,0) = 1 ← 2= 10 in base 2

4 → digcount(4,0) = 3; ← 4 = 100 in base 2, 11 in base 3, 10 in base 4

8 → digcount(8,0) = 5 ← 8 = 1000 in base 2, 22 in base 3, 20 in base 4, 13 in base 5, 12 in base 6, 11 in base 7, 10 in base 8

12 → digcount(12,0) = 6

16 → digcount(16,0) = 8

18 → digcount(18,0) = 9

32 → digcount(32,0) = 11

36 → digcount(36,0) = 13

64 → digcount(64,0) = 15

72 → digcount(72,0) = 18

128 → digcount(128,0) = 20

144 → digcount(144,0) = 24

252 → digcount(252,0) = 25

264 → digcount(264,0) = 27

288 → digcount(288,0) = 29

360 → digcount(360,0) = 30

504 → digcount(504,0) = 33

540 → digcount(540,0) = 36

720 → digcount(720,0) = 40

900 → digcount(900,0) = 42

1080 → digcount(1080,0) = 47

1680 → digcount(1680,0) = 48

1800 → digcount(1800,0) = 53

2160 → digcount(2160,0) = 56

2520 → digcount(2520,0) = 61

3600 → digcount(3600,0) = 64

4320 → digcount(4320,0) = 66

So what is the first n for which digcount(n,0) = 666? Watch this space.

# The Fuchsia’s So White

# Reciprocal Recipes

Here’s a sequence. What’s the next number?

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...

Here’s another sequence. What’s the next number?

0, 1, 1, 2, 3, 5, 8, 13, 21, 34...

Those aren’t trick questions, so the answers are 1 and 55, respectively. The second sequence is the famous Fibonacci sequence, where each number after [0,1] is the sum of the previous two numbers.

Now try dividing each of those sequences by powers of 2 and summing the results, like this:

1/2 + 1/4 + 1/8 + 1/16 + 1/32 + 1/64 + 1/128 + 1/256 + 1/512 + 1/1024 + 1/2048 + 1/4096 + 1/8192 + 1/16384 + 1/32768 + 1/65536 + 1/131072 + 1/262144 + 1/524288 + 1/1048576 +... = ?

0/2 + 1/4 + 1/8 + 2/16 + 3/32 + 5/64 + 8/128 + 13/256 + 21/512 + 34/1024 + 55/2048 + 89/4096 + 144/8192 + 233/16384 + 377/32768 + 610/65536 + 987/131072 + 1597/262144 + 2584/524288 + 4181/1048576 +... = ?

What are the sums? I was surprised to learn that they’re identical:

1/2 + 1/4 + 1/8 + 1/16 + 1/32 + 1/64 + 1/128 + 1/256 + 1/512 + 1/1024 + 1/2048 + 1/4096 + 1/8192 + 1/16384 + 1/32768 + 1/65536 + 1/131072 + 1/262144 + 1/524288 + 1/1048576 +... = 1

0/2 + 1/4 + 1/8 + 2/16 + 3/32 + 5/64 + 8/128 + 13/256 + 21/512 + 34/1024 + 55/2048 + 89/4096 + 144/8192 + 233/16384 + 377/32768 + 610/65536 + 987/131072 + 1597/262144 + 2584/524288 + 4181/1048576 +... = 1

I discovered this when I was playing with an old scientific calculator and calculated these sums:

5^2 + 2^2 = 29

5^2 + 4^2 = 41

5^2 + 6^2 = 61

5^2 + 8^2 = 89

The sums are all prime numbers. Then I idly calculated the reciprocal of 1/89:

1/89 = 0·011235955056179775...

The digits 011235… are the start of the Fibonacci sequence. It seems to go awry after that, but I remembered what David Wells had said in his wonderful *Penguin Dictionary of Curious and Interesting Numbers* (1986): “89 is the 11th Fibonacci number, and the period of its reciprocal is generated by the Fibonacci sequence: 1/89 = 0·11235…” He means that the Fibonacci sequence generates the digits of 1/89 like this, when you sum the columns and move carries left as necessary:

0

↓1

↓↓1

↓↓↓2

↓↓↓↓3

↓↓↓↓↓5

↓↓↓↓↓↓8

↓↓↓↓↓↓13

↓↓↓↓↓↓↓21

↓↓↓↓↓↓↓↓34

↓↓↓↓↓↓↓↓↓55

↓↓↓↓↓↓↓↓↓↓89...

↓↓↓↓↓↓↓↓↓↓

0112359550...

I tried this method of summing the Fibonacci sequence in other bases. Although it was old, the scientific calculator was crudely programmable. And it helpfully converted the sum into a final fraction once there were enough decimal digits:

0/3 + 1/3

^{2}+ 1/3^{3}+ 2/3^{4}+ 3/3^{5}+ 5/3^{6}+ 8/3^{7}+ 13/3^{8}+ 21/3^{9}+ 34/3^{10}+ 55/3^{11}+ 89/3^{12}+ 144/3^{13}+ 233/3^{14}+ 377/3^{15}+ 610/3^{16}+ 987/3^{17}+ 1597/3^{18}+ 2584/3^{19}+ 4181/3^{20}+... = 1/5 = 0·012101210121012101210 in b3

0/4 + 1/4

^{2}+ 1/4^{3}+ 2/4^{4}+ 3/4^{5}+ 5/4^{6}+ 8/4^{7}+ 13/4^{8}+ 21/4^{9}+ 34/4^{10}+ 55/4^{11}+ 89/4^{12}+ 144/4^{13}+ 233/4^{14}+ 377/4^{15}+ 610/4^{16}+ 987/4^{17}+ 1597/4^{18}+ 2584/4^{19}+ 4181/4^{20}+... = 1/11 = 0·011310113101131011310 in b4

0/5 + 1/5

^{2}+ 1/5^{3}+ 2/5^{4}+ 3/5^{5}+ 5/5^{6}+ 8/5^{7}+ 13/5^{8}+ 21/5^{9}+ 34/5^{10}+ 55/5^{11}+ 89/5^{12}+ 144/5^{13}+ 233/5^{14}+ 377/5^{15}+ 610/5^{16}+ 987/5^{17}+ 1597/5^{18}+ 2584/5^{19}+ 4181/5^{20}+... = 1/19 = 0·011242141011242141011 in b5

0/6 + 1/6

^{2}+ 1/6^{3}+ 2/6^{4}+ 3/6^{5}+ 5/6^{6}+ 8/6^{7}+ 13/6^{8}+ 21/6^{9}+ 34/6^{10}+ 55/6^{11}+ 89/6^{12}+ 144/6^{13}+ 233/6^{14}+ 377/6^{15}+ 610/6^{16}+ 987/6^{17}+ 1597/6^{18}+ 2584/6^{19}+ 4181/6^{20}+... = 1/29 = 0·011240454431510112404 in b6

0/7 + 1/7

^{2}+ 1/7^{3}+ 2/7^{4}+ 3/7^{5}+ 5/7^{6}+ 8/7^{7}+ 13/7^{8}+ 21/7^{9}+ 34/7^{10}+ 55/7^{11}+ 89/7^{12}+ 144/7^{13}+ 233/7^{14}+ 377/7^{15}+ 610/7^{16}+ 987/7^{17}+ 1597/7^{18}+ 2584/7^{19}+ 4181/7^{20}+... = 1/41 = 0·011236326213520225056 in b7

It was interesting to see that all the reciprocals so far were of primes. I carried on:

0/8 + 1/8^{2}+ 1/8^{3}+ 2/8^{4}+ 3/8^{5}+ 5/8^{6}+ 8/8^{7}+ 13/8^{8}+ 21/8^{9}+ 34/8^{10}+ 55/8^{11}+ 89/8^{12}+ 144/8^{13}+ 233/8^{14}+ 377/8^{15}+ 610/8^{16}+ 987/8^{17}+ 1597/8^{18}+ 2584/8^{19}+ 4181/8^{20}+... = 1/55 = 0·011236202247440451710 in b8

Not a prime reciprocal, but a reciprocal of a Fibonacci number. Here are some more sums:

0/9 + 1/9

^{2}+ 1/9^{3}+ 2/9^{4}+ 3/9^{5}+ 5/9^{6}+ 8/9^{7}+ 13/9^{8}+ 21/9^{9}+ 34/9^{10}+ 55/9^{11}+ 89/9^{12}+ 144/9^{13}+ 233/9^{14}+ 377/9^{15}+ 610/9^{16}+ 987/9^{17}+ 1597/9^{18}+ 2584/9^{19}+ 4181/9^{20}+... = 1/71 (another prime) = 0·011236067540450563033 in b9

0/10 + 1/10

^{2}+ 1/10^{3}+ 2/10^{4}+ 3/10^{5}+ 5/10^{6}+ 8/10^{7}+ 13/10^{8}+ 21/10^{9}+ 34/10^{10}+ 55/10^{11}+ 89/10^{12}+ 144/10^{13}+ 233/10^{14}+ 377/10^{15}+ 610/10^{16}+ 987/10^{17}+ 1597/10^{18}+ 2584/10^{19}+ 4181/10^{20}+... = 1/89 (and another) = 0·011235955056179775280 in b10

0/11 + 1/11

^{2}+ 1/11^{3}+ 2/11^{4}+ 3/11^{5}+ 5/11^{6}+ 8/11^{7}+ 13/11^{8}+ 21/11^{9}+ 34/11^{10}+ 55/11^{11}+ 89/11^{12}+ 144/11^{13}+ 233/11^{14}+ 377/11^{15}+ 610/11^{16}+ 987/11^{17}+ 1597/11^{18}+ 2584/11^{19}+ 4181/11^{20}+... = 1/109 (and another) = 0·011235942695392022470 in b11

0/12 + 1/12

^{2}+ 1/12^{3}+ 2/12^{4}+ 3/12^{5}+ 5/12^{6}+ 8/12^{7}+ 13/12^{8}+ 21/12^{9}+ 34/12^{10}+ 55/12^{11}+ 89/12^{12}+ 144/12^{13}+ 233/12^{14}+ 377/12^{15}+ 610/12^{16}+ 987/12^{17}+ 1597/12^{18}+ 2584/12^{19}+ 4181/12^{20}+... = 1/131 (and another) = 0·011235930336A53909A87 in b12

0/13 + 1/13^{2}+ 1/13^{3}+ 2/13^{4}+ 3/13^{5}+ 5/13^{6}+ 8/13^{7}+ 13/13^{8}+ 21/13^{9}+ 34/13^{10}+ 55/13^{11}+ 89/13^{12}+ 144/13^{13}+ 233/13^{14}+ 377/13^{15}+ 610/13^{16}+ 987/13^{17}+ 1597/13^{18}+ 2584/13^{19}+ 4181/13^{20}+... = 1/155 (not a prime or a Fibonacci number) = 0·01123591ACAA861794044 in b13

The reciprocals go like this:

1/1, 1/5, 1/11, 1/19, 1/29, 1/41, 1/55, 1/71, 1/89, 1/109, 1/131, 1/155...

And it should be easy to see the rule that generates them:

5 = 1 + 4

11 = 5 + 6

19 = 11 + 8

29 = 19 + 10

41 = 29 + 12

55 = 41 + 14

71 = 55 + 16

89 = 17 + 18

109 = 89 + 20

131 = 109 + 22

155 = 131 + 24

[...]

But I don’t understand why the rule applies, let alone why the Fibonacci sequence generates these reciprocals in the first place.

# Cats and Dogmas

« Les chats furent créés dans notre monde pour réfuter le dogme que toutes choses furent créées pour servir l’Homme. » — Froquevielle

• “Cats were created in our world to refute the dogma that everything was created to serve mankind.”

**Post-Performative Post-Scriptum**

I can’t find any more details of “Froquevielle”, which may be a misspelling.

# Eye the Sky

(click for larger)

bolide, n. /ˈbɒlʌɪd/ A large meteor; usually one that explodes and falls in the form of aerolites; a fire-ball. Etymology: < French *bolide*, < Latin *bolid-em* (nominative *bolis*) large meteor, < Greek *βολίς* missile, < stem of *βάλλειν* to throw. — *Oxford English Dictionary*

# Careway to Seven

• დედაბერს შვიდი სოფლის ფიქრი აწუხებდა, იმისი კი არავისა ჰქონდაო.

• • *Dedabers shvidi soplis pikri ats’ukhbda, imisi k’i aravisa hkondao.*

• • • The old woman worried about seven villages, but nobody cared about her. — *A Comprehensive Georgian-English Dictionary*, ed. Donald Rayfield *et al* (2006)

**Post-Performative Post-Scriptum…**

The title of this incendiary intervention is of course a radical reference to core Black Sabbath platter “Freewheel Burnin'” (2004).

**Previously Pre-Posted…**

• Stare-Way to Hair, Then

• Russell in Your Head-Roe

• Sampled (Underfoot)