N-route

Tuesday, 30th Sep, 2014 by Krilling for Company in Binary numbers, Digit-sums, Geometry, Mathematics and tagged Arithmetic, binary, binary numbers, digit sums, digits, integer, integer spiral, integers, math, mathematics, maths, number spiral, recreational math, recreational mathematics, recreational maths, rectangles, Squares, ternary, ternary numbers | Leave a comment

In maths, one thing leads to another. I wondered whether, in a spiral of integers, any number was equal to the digit-sum of the numbers on the route traced by moving to the origin first horizontally, then vertically. To illustrate the procedure, here is a 9×9 integer spiral containing 81 numbers:

| 65 | 64 | 63 | 62 | 61 | 60 | 59 | 58 | 57 |
| 66 | 37 | 36 | 35 | 34 | 33 | 32 | 31 | 56 |
| 67 | 38 | 17 | 16 | 15 | 14 | 13 | 30 | 55 |
| 68 | 39 | 18 | 05 | 04 | 03 | 12 | 29 | 54 |
| 69 | 40 | 19 | 06 | 01 | 02 | 11 | 28 | 53 |
| 70 | 41 | 20 | 07 | 08 | 09 | 10 | 27 | 52 |
| 71 | 42 | 21 | 22 | 23 | 24 | 25 | 26 | 51 |
| 72 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 |
| 73 | 74 | 75 | 76 | 77 | 78 | 79 | 80 | 81 |

Take the number 21, which is three places across and up from the bottom left corner of the spiral. The route to the origin contains the numbers 21, 22, 23, 8 and 1, because first you move right two places, then up two places. And 21 is what I call a route number, because 21 = 3 + 4 + 5 + 8 + 1 = digitsum(21) + digitsum(22) + digitsum(23) + digitsum(8) + digitsum(1). Beside the trivial case of 1, there are two more route numbers in the spiral:

58 = 13 + 14 + 6 + 7 + 7 + 6 + 4 + 1 = digitsum(58) + digitsum(59) + digitsum(60) + digitsum(61) + digitsum(34) + digitsum(15) + digitsum(4) + digitsum(1).

74 = 11 + 12 + 13 + 14 + 10 + 5 + 8 + 1 = digitsum(74) + digitsum(75) + digitsum(76) + digitsum(77) + digitsum(46) + digitsum(23) + digitsum(8) + digitsum(1).

Then I wondered about other possible routes to the origin. Think of the origin as one corner of a rectangle and the number being tested as the diagonal corner. Suppose that you always move away from the starting corner, that is, you always move up or right (or up and left, and so on, depending on where the corners lie). In a x by y rectangle, how many routes are there between the diagonal corners under those conditions?

It’s an interesting question, but first I’ve looked at the simpler case of an n by n square. You can encode each route as a binary number, with 0 representing a vertical move and 1 representing a horizontal move. The problem then becomes equivalent to finding the number of distinct ways you can arrange equal numbers of 1s and 0s. If you use this method, you’ll discover that there are two routes across the 2×2 square, corresponding to the binary numbers 01 and 10:

Across the 3×3 square, there are six routes, corresponding to the binary numbers 0011, 0101, 0110, 1001, 1010 and 1100:

Across the 4×4 square, there are twenty routes:

(Please open in new window if it fails to animate)

Across the 5×5 square, there are 70 routes:

(Please open in new window etc)

Across the 6×6 and 7×7 squares, there are 252 and 924 routes:

After that, the routes quickly increase in number. This is the list for n = 1 to 14:

1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620, 184756, 705432, 2704156, 10400600… (see A000984 at the Online Encyclopedia of Integer Sequences)

After that you can vary the conditions. What if you can move not just vertically and horizontally, but diagonally, i.e. vertically and horizontally at the same time? Now you can encode the route with a ternary number, or number in base 3, with 0 representing a vertical move, 1 a horizontal move and 2 a diagonal move. As before, there is one route across a 1×1 square, but there are three across a 2×2, corresponding to the ternary numbers 01, 2 and 10:

There are 13 routes across a 3×3 square, corresponding to the ternary numbers 0011, 201, 021, 22, 0101, 210, 1001, 120, 012, 102, 0110, 1010, 1100:

And what about cubes, hypercubes and higher?

Will Two Power?

Saturday, 13th Sep, 2014 by Krilling for Company in Mathematics, Powers and tagged Arithmetic, powers of 2, powers of two, recreational math, recreational mathematics, recreational maths, two | Leave a comment

It’s such a simple thing: repeatedly doubling a number: 1, 2, 4, 8, 16, 32, 61, 128… And yet it yields such riches, reminiscent of DNA or a literary text:

2^0 = 1
2^1 = 2
2^2 = 4
2^3 = 8
2^4 = 16
2^5 = 32
2^6 = 64
2^7 = 128
2^8 = 256
2^9 = 512
2^10 = 1024
2^20 = 1048576
2^30 = 1073741824
2^40 = 1099511627776
2^50 = 1125899906842624
2^60 = 1152921504606846976
2^70 = 1180591620717411303424
2^80 = 1208925819614629174706176
2^90 = 1237940039285380274899124224
2^100 = 1267650600228229401496703205376
2^200 = 1606938044258990275541962092341162602522202993782792835301376

Although, by Benford’s law*, 1 is the commonest leading digit, do all numbers eventually appear as the leading digits of some power of 2? I conjecture that they do. indeed, I conjecture that they do infinitely often. If the function first(n) returns the power of 2 whose leading digits are the same as the digits of n, then:

first(1) = 2^0 = 1
first(2) = 2^1 = 2
first(3) = 2^5 = 32
first(4) = 2^2 = 4
first(5) = 2^9 = 512
first(6) = 2^6 = 64
first(7) = 2^46 = 70368744177664
first(8) = 2^3 = 8
first(9) = 2^53 = 9007199254740992
first(10) = 2^10 = 1024

And I conjecture that this is true of all bases except bases that are powers of 2, like 2, 4, 8, 16 and so on. A related question is whether the leading digits of any 2^n are the same as the digits of n. Yes:

2^6 = 64
2^10 = 1024
2^1542 = 1.54259995… * 10^464
2^77075 = 7.70754024… * 10^23201
2^113939 = 1.13939932… * 10^34299
2^1122772 = 1.12277217… * 10^337988

That looks like a look of calculation, but there’s a simple way to cut it down: restrict the leading digits. Eventually they will lose accuracy, because the missing digits are generating carries. With four leading digits, this happens:

1: 0001
2: 0002
4: 0004
8: 0008
16: 0016
32: 0032
64: 0064
128: 0128
256: 0256
512: 0512
1024: 1024
2048: 2048
4096: 4096
8192: 8192
16384: 1638…
32768: 3276…
65536: 6552…

But working with only fifteen leading digits, you can find that 1122772 = the leading digits of 2^1122772, which has 337989 digits when calculated in full.

Previously pre-posted (please peruse):

• Talcum Power

*Not Zipf’s law, as I originally said.

Talcum Power

Tuesday, 19th Aug, 2014 by Krilling for Company in Base Behavior, Mathematics, Powers, Prime numbers and tagged 2, base 10, bases, digits, infinity, math, mathematical conjecture, mathematical proof, mathematics, maths, Mersenne primes, number bases, paradoxes of infinity, powers, powers of 2, prime numbers, primes, recreational math, recreational mathematics, recreational maths, substrings, two | Leave a comment

If primes are like diamonds, powers of 2 are like talc. Primes don’t crumble under division, because they can’t be divided by any number but themselves and one. Powers of 2 crumble more than any other numbers. The contrast is particularly strong when the primes are Mersenne primes, or equal to a power of 2 minus 1:

3 = 4-1 = 2^2 – 1.
4, 2, 1.

7 = 8-1 = 2^3 – 1.
8, 4, 2, 1.

31 = 32-1 = 2^5 – 1.
32, 16, 8, 4, 2, 1.

127 = 2^7 – 1.
128, 64, 32, 16, 8, 4, 2, 1.

8191 = 2^13 – 1.
8192, 4096, 2048, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1.

131071 = 2^17 – 1.
131072, 65536, 32768, 16384, 8192, 4096, 2048, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1.

524287 = 2^19 – 1.
524288, 262144, 131072, 65536, 32768, 16384, 8192, 4096, 2048, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1.

2147483647 = 2^31 – 1.
2147483648, 1073741824, 536870912, 268435456, 134217728, 67108864, 33554432, 16777216, 8388608, 4194304, 2097152, 1048576, 524288, 262144, 131072, 65536, 32768, 16384, 8192, 4096, 2048, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1.

Are Mersenne primes infinite? If they are, then there will be just as many Mersenne primes as powers of 2, even though very few powers of 2 create a Mersenne prime. That’s one of the paradoxes of infinity: an infinite part is equal to an infinite whole.

But are they infinite? No-one knows, though some of the greatest mathematicians in history have tried to find a proof or disproof of the conjecture. A simpler question about powers of 2 is this: Does every integer appear as part of a power of 2? I can’t find one that doesn’t:

0 is in 1024 = 2^10.
1 is in 16 = 2^4.
2 is in 32 = 2^5.
3 is in 32 = 2^5.
4 = 2^2.
5 is in 256 = 2^8.
6 is in 16 = 2^4.
7 is in 32768 = 2^15.
8 = 2^3.
9 is in 4096 = 2^12.
10 is in 1024 = 2^10.
11 is in 1099511627776 = 2^40.
12 is in 128 = 2^7.
13 is in 131072 = 2^17.
14 is in 262144 = 2^18.
15 is in 2097152 = 2^21.
16 = 2^4.
17 is in 134217728 = 2^27.
18 is in 1073741824 = 2^30.
19 is in 8192 = 2^13.
20 is in 2048 = 2^11.

666 is in 182687704666362864775460604089535377456991567872 = 2^157.
1066 is in 43556142965880123323311949751266331066368 = 2^135.
1492 is in 356811923176489970264571492362373784095686656 = 2^148.
2014 is in 3705346855594118253554271520278013051304639509300498049262642688253220148477952 = 2^261.

I’ve tested much higher than that, but testing is no good: where’s a proof? I don’t have one, though I conjecture that all integers do appear as part or whole of a power of 2. Nor do I have a proof for another conjecture: that all integers appear infinitely often as part or whole of powers of 2. Or indeed, of powers of 3, 4, 5 or any other number except powers of 10.

I conjecture that this would apply in all bases too: In any base b all n appear infinitely often as part or whole of powers of any number except those equal to a power of b.

1 is in 11 = 2^2 in base 3.
2 is in 22 = 2^3 in base 3.
10 is in 1012 = 2^5 in base 3.
11 = 2^2 in base 3.
12 is in 121 = 2^4 in base 3.
20 is in 11202 = 2^7 in base 3.
21 is in 121 = 2^4 in base 3.
22 = 2^3 in base 3.
100 is in 100111 = 2^8 in base 3.
101 is in 1012 = 2^5 in base 3.
102 is in 2210212 = 2^11 in base 3.
110 is in 1101221 = 2^10 in base 3.
111 is in 100111 = 2^8 in base 3.
112 is in 11202 = 2^7 in base 3.
120 is in 11202 = 2^7 in base 3.
121 = 2^4 in base 3.
122 is in 1101221 = 2^10 in base 3.
200 is in 200222 = 2^9 in base 3.
201 is in 12121201 = 2^12 in base 3.
202 is in 11202 = 2^7 in base 3.

1 is in 13 = 2^3 in base 5.
2 is in 112 = 2^5 in base 5.
3 is in 13 = 2^3 in base 5.
4 = 2^2 in base 5.
10 is in 1003 = 2^7 in base 5.
11 is in 112 = 2^5 in base 5.
12 is in 112 = 2^5 in base 5.
13 = 2^3 in base 5.
14 is in 31143 = 2^11 in base 5.
20 is in 2011 = 2^8 in base 5.
21 is in 4044121 = 2^16 in base 5.
22 is in 224 = 2^6 in base 5.
23 is in 112341 = 2^12 in base 5.
24 is in 224 = 2^6 in base 5.
30 is in 13044 = 2^10 in base 5.
31 = 2^4 in base 5.
32 is in 230232 = 2^13 in base 5.
33 is in 2022033 = 2^15 in base 5.
34 is in 112341 = 2^12 in base 5.
40 is in 4022 = 2^9 in base 5.

1 is in 12 = 2^3 in base 6.
2 is in 12 = 2^3 in base 6.
3 is in 332 = 2^7 in base 6.
4 = 2^2 in base 6.
5 is in 52 = 2^5 in base 6.
10 is in 1104 = 2^8 in base 6.
11 is in 1104 = 2^8 in base 6.
12 = 2^3 in base 6.
13 is in 13252 = 2^11 in base 6.
14 is in 144 = 2^6 in base 6.
15 is in 101532 = 2^13 in base 6.
20 is in 203504 = 2^14 in base 6.
21 is in 2212 = 2^9 in base 6.
22 is in 2212 = 2^9 in base 6.
23 is in 1223224 = 2^16 in base 6.
24 = 2^4 in base 6.
25 is in 13252 = 2^11 in base 6.
30 is in 30544 = 2^12 in base 6.
31 is in 15123132 = 2^19 in base 6.
32 is in 332 = 2^7 in base 6.

1 is in 11 = 2^3 in base 7.
2 is in 22 = 2^4 in base 7.
3 is in 1331 = 2^9 in base 7.
4 = 2^2 in base 7.
5 is in 514 = 2^8 in base 7.
6 is in 2662 = 2^10 in base 7.
10 is in 1054064 = 2^17 in base 7.
11 = 2^3 in base 7.
12 is in 121 = 2^6 in base 7.
13 is in 1331 = 2^9 in base 7.
14 is in 514 = 2^8 in base 7.
15 is in 35415440431 = 2^30 in base 7.
16 is in 164351 = 2^15 in base 7.
20 is in 362032 = 2^16 in base 7.
21 is in 121 = 2^6 in base 7.
22 = 2^4 in base 7.
23 is in 4312352 = 2^19 in base 7.
24 is in 242 = 2^7 in base 7.
25 is in 11625034 = 2^20 in base 7.
26 is in 2662 = 2^10 in base 7.

1 is in 17 = 2^4 in base 9.
2 is in 152 = 2^7 in base 9.
3 is in 35 = 2^5 in base 9.
4 = 2^2 in base 9.
5 is in 35 = 2^5 in base 9.
6 is in 628 = 2^9 in base 9.
7 is in 17 = 2^4 in base 9.
8 = 2^3 in base 9.
10 is in 108807 = 2^16 in base 9.
11 is in 34511011 = 2^24 in base 9.
12 is in 12212 = 2^13 in base 9.
13 is in 1357 = 2^10 in base 9.
14 is in 314 = 2^8 in base 9.
15 is in 152 = 2^7 in base 9.
16 is in 878162 = 2^19 in base 9.
17 = 2^4 in base 9.
18 is in 218715 = 2^17 in base 9.
20 is in 70122022 = 2^25 in base 9.
21 is in 12212 = 2^13 in base 9.
22 is in 12212 = 2^13 in base 9.

He Say, He Sigh, He Sow #20

Wednesday, 23rd Jul, 2014 by Krilling for Company in Binary numbers, Geometry, π, Mathematics, Pi, Quotations and tagged base 2, base two, binary, binary digits of pi, binary notation, digits of pi, Ian Stewart, π, math, mathematics, maths, pi, pi in base 2, pi in base two, pi in binary, quotation, quotations, quotations about math, quotations about mathematics, quotations about maths, quotations about pi, trillionth digit of pi | 6 Comments

“In 1997, Fabrice Bellard announced that the trillionth digit of π, in binary notation, is 1.” — Ian Stewart, The Great Mathematical Problems (2013).

Blue is the Killer

Monday, 23rd Jun, 2014 by Krilling for Company in Aesthetics, Art, Book Reviews, Consciousness, Geometry, Optical Illusions, Psychology and tagged biology, Carlton Books, consciousness, deceptive figures, eye, Eye Bogglers, eyes, Gianni A. Sarcone, illusions, impossible figures, Marie-Jo Waeber, mind, Optical Illusions, psychology, science, seeing, sight, trickery, vision | Leave a comment

Eye Bogglers: A Mesmerizing Mass of Amazing Illusions, Gianni A. Sarcone and Marie-Jo Waeber (Carlton Books 2011; paperback 2013)

A simple book with some complex illusions. It’s aimed at children but scientists have spent decades understanding how certain arrangements of colour and line fool the eye so powerfully. I particularly like the black-and-white tiger set below a patch of blue on page 60. Stare at the blue “for 15 seconds”, then look quickly at a tiny cross set between the tiger’s eyes and the killer turns colour.

So what’s not there appears to be there, just as, elsewhere, what’s there appears not to be. Straight lines seem curved; large figures seem small; the same colour seems light on the right, dark on the left. There are also some impossible figures, as made famous by M.C. Escher and now studied seriously by geometricians, but the only true art here is a “Face of Fruits” by Arcimboldo. The rest is artful, not art, but it’s interesting to think what Escher might have made of some of the ideas here. Mind is mechanism; mechanism can be fooled. Optical illusions are the most compelling examples, because vision is the most powerful of our senses, but the lesson you learn here is applicable everywhere. This book fools you for fun; others try to fool you for profit. Caveat spectator.

Simple but complex: The café wall illusion

On the M3!

Thursday, 19th Jun, 2014 by Krilling for Company in Latin, Magistra Mundi, Mathematics and tagged emphasis, English, English vs Latin, factorial, factorials, Language, Latin, Latin vs English, linguistics, math, Mathematica Magistra Mundi, mathematics, Mathematics Mistress of the World, maths, six, technology, word-order | Leave a comment

6 = 2 x 3. And 6 = 1 + 2 + 3. But 6 also equals 3!. That is, 6 = 3 x 2 x 1, or factorial three. If you have three different items, you can arrange them in six different ways. There are three posibilities for the first item, two for the second and one for the third.

You can illustrate this linguistically. All languages are governed by mathematics, but maths manifests itself in different ways. Emphasis is an important part of language, for example, but there are different ways to achieve it. English usually does it with stress or by adding an emphatic word. Other languages can do it by varying the order of words. Latin, for example:

Mathematica Magistra Mundi
— Mathematics is Mistress of the World.
Mathematica Mundi Magistra
— Mathematics of the World is Mistress.
Magistra Mathematica Mundi
— Mistress is Mathematics of the World
Magistra Mundi Mathematica
— Mistress of the World is Mathematics.
Mundi Mathematica Magistra
— Of the World Mathematics is Mistress.
Mundi Magistra Mathematica
— Of the World the Mistress is Mathematics.

Elsewhere other-posted:

• Mathematica Magistra Mundi — more on the motto
• Moto-Motto — a variant on the motto

Sphaerocephalus

Tuesday, 17th Jun, 2014 by Krilling for Company in Biology, Botany, Flowers, Geometry, Magistra Mundi, Science and tagged Asteraceae, botany, Drüsenblättrige Kugeldistel, Echinops, Echinops sphaerocephalus, flower, Flowers, geometry, globe thistle, great globe thistle, Kugeldistel, Mathematica Magistra Mundi, Oursin à tête ronde, science, Sphaerocephalus | Leave a comment

Echinops sphaerocephalus, or Great Globe Thistle

Prime Climb Time

Tuesday, 3rd Jun, 2014 by Krilling for Company in Base Behavior, Binary numbers, Digit-sums, Mathematics, Prime numbers and tagged Arithmetic, base 10, base 2, base 3, base 4, binary, different bases, digit sums, Goldilocks base, math, mathematics, maths, prime numbers, prime patterns, primes, primes in different bases, recreational math, recreational mathematics, recreational maths, sum of digits, sum of prime digits, sum of primes, ternary | Leave a comment

The third prime is equal to the sum of the first and second primes: 2 + 3 = 5. After that, for obvious reasons, the prime-sum climbs much more rapidly than the primes themselves:

2, 3, 05, 07, 11, 13, 17, 19, 023, 029...
2, 5, 10, 17, 28, 41, 58, 77, 100, 129...

But what if you use digit-sum(p₁..p_n), i.e., the sum of the digits of the primes from the first to the nth? For example, the digit-sum(p₁..p₅) = 2 + 3 + 5 + 7 + 1+1 = 19, whereas the sum(p₁..p₅) = 2 + 3 + 5 + 7 + 11 = 28. Using the digit-sums of the primes, the comparison now looks like this:

2, 3, 05, 07, 11, 13, 17, 19, 23, 29...
2, 5, 10, 17, 19, 23, 31, 41, 46, 57...

The sum climbs more slowly, but still too fast. So what about a different base? In base-2, the digit-sum(p₁..p₃) = (1+0) + (1+1) + (1+0+1) = 1 + 2 + 2 = 5. The comparison looks like this:

2, 3, 05, 07, 11, 13, 17, 19, 23, 29...
1, 3, 05, 08, 11, 14, 16, 19, 23, 27...

For primes 3, 5, 11, 19, and 23, p = digit-sum(primes <= p) in base-2. But the cumulative digit-sum soon begins to climb too slowly:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271...

1, 3, 5, 8, 11, 14, 16, 19, 23, 27, 32, 35, 38, 42, 47, 51, 56, 61, 64, 68, 71, 76, 80, 84, 87, 091, 096, 101, 106, 110, 117, 120, 123, 127, 131, 136, 141, 145, 150, 155, 160, 165, 172, 175, 179, 184, 189, 196, 201, 206, 211, 218, 223, 230, 232, 236, 240, 245...

So what about base-3?

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59...
2, 3, 6, 9, 12, 15, 20, 23, 28, 31, 34, 37, 42, 47, 52, 59, 64...

In base-3, for p = 2, 3 and 37, p = digit-sum(primes <= p), while for p = 23, 31, 47 and 59, p = digit-sum(primes < p), like this:

2 = 2.
3 = 2 + (1+0).
37 = 2 + (1+0) + (1+2) + (2+1) + (1+0+2) + (1+1+1) + (1+2+2) + (2+0+1) + (2+1+2) + (1+0+0+2) + (1+0+1+1) + (1+1+0+1) = 2 + 1 + 3 + 3 + 3 + 3 + 5 + 3 + 5 + 3 + 3 + 3.

23 = 2 + (1+0) + (1+2) + (2+1) + (1+0+2) + (1+1+1) + (1+2+2) + (2+0+1) = 2 + 1 + 3 + 3 + 3 + 3 + 5 + 3.
31 = 2 + (1+0) + (1+2) + (2+1) + (1+0+2) + (1+1+1) + (1+2+2) + (2+0+1) + (2+1+2) + (1+0+0+2) = 2 + 1 + 3 + 3 + 3 + 3 + 5 + 3 + 5 + 3.
47 = 2 + (1+0) + (1+2) + (2+1) + (1+0+2) + (1+1+1) + (1+2+2) + (2+0+1) + (2+1+2) + (1+0+0+2) + (1+0+1+1) + (1+1+0+1) + (1+1+1+2) + (1+1+2+1) = 2 + 1 + 3 + 3 + 3 + 3 + 5 + 3 + 5 + 3 + 3 + 3 + 5 + 5.
59 = 2 + (1+0) + (1+2) + (2+1) + (1+0+2) + (1+1+1) + (1+2+2) + (2+0+1) + (2+1+2) + (1+0+0+2) + (1+0+1+1) + (1+1+0+1) + (1+1+1+2) + (1+1+2+1) + (1+2+0+2) + (1+2+2+2) = 2 + 1 + 3 + 3 + 3 + 3 + 5 + 3 + 5 + 3 + 3 + 3 + 5 + 5 + 5 + 7.

This carries on for a long time. For these primes, p = digit-sum(primes < p):

23, 31, 47, 59, 695689, 698471, 883517, 992609, 992737, 993037, 1314239, 1324361, 1324571, 1326511, 1327289, 1766291, 3174029

And for these primes, p = digit-sum(primes <= p):

3, 37, 695663, 695881, 1308731, 1308757, 1313153, 1314301, 1326097, 1766227, 3204779, 14328191

Now try the cumulative digit-sum in base-4:

2, 3, 5, 07, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59...
2, 5, 7, 11, 16, 20, 22, 26, 31, 36, 43, 47, 52, 59, 67, 72, 80...

The sum of digits climbs too fast. Base-3 is the Goldilocks base, climbing neither too slowly, like base-2, nor too fast, like all bases greater than 3.

Prime Time #2

Thursday, 29th May, 2014 by Krilling for Company in Mathematics, Prime numbers and tagged 29, David Wells, formula for primes, math, mathematics, maths, Penguin Dictionary of Curious and Interesting Numbers, prime formula, prime numbers, primes, recreational math, recreational mathematics, recreational maths, twenty-nine | Leave a comment

“2n² + 29 is prime for all values of n for 1 to 28.” — The Penguin Dictionary of Curious and Interesting Numbers, David Wells (1986).

• 31, 37, 47, 61, 79, 101, 127, 157, 191, 229, 271, 317, 367, 421, 479, 541, 607, 677, 751, 829, 911, 997, 1087, 1181, 1279, 1381, 1487, 1597.

Elsewhere other-posted:

• Prime Time #1
• Poulet’s Propellor — Musings on Math and Mathculinity
• La Spirale è Mobile

Performativizing Papyrocentricity #22

Thursday, 22nd May, 2014 by Krilling for Company in Über-Transgression..., Book Reviews, Civilization, History, Literature, Mathematics, Philosophy of mathematics, Politics, The Sea and tagged art, autobiography, biology, book collecting, book reviews, books, coastal wildlife, culture, film, First World War, G.H. Hardy, lost art, lost books, marine biology, math, mathematics, maths, Natural History, photography, popular culture, Scala Cinema, subterranean cinema, war, war photography | Leave a comment

Papyrocentric Performativity Presents:

• Plates from the Great – Shots from the Front: The British Soldier 1914-18, Richard Holmes (HarperPress 2008; paperback 2010)

• Math for the Mistress – A Mathematician’s Apology, G.H. Hardy (1940)

• Sinister Sinema – Scalarama: A Celebration of Subterranean Cinema at Its Sleazy, Slimy and Sinister Best, ed. Norman Foreman, B.A. (TransVisceral Books 2015)

• Rick Pickings – Lost, Stolen or Shredded: Stories of Missing Works of Art and Literature, Rick Gekoski (Profile Books 2013/2014)

• Slug is a Drug – Collins Complete Guide to British Coastal Wildlife, Paul Sterry and Andrew Cleave (HarperCollins 2012) (posted @ Overlord of the Über-Feral)

Or Read a Review at Random: RaRaR

Overlord In Terms of Core Issues Around Maximal Engagement with Key Notions of the Über-Feral

მეფე (2) • მსოფლიოს (3) • მათემატიკა (5) •

Category Archives: Mathematics