It has been a long time since we were all excited by the aperiodic tilings of Penrose's kites and darts. There was even a version using images of chickens:
![]() |
Penrose chickens |
It has been a long time since we were all excited by the aperiodic tilings of Penrose's kites and darts. There was even a version using images of chickens:
![]() |
Penrose chickens |
Five days ago I started a new run of testing candidates for the property of being a million-digit Leyland prime. The million-digit part is relatively easy; the primality testing, not so much. My last run required nine months, not counting the month it took to sieve. I'm not pushing it for now. Of the 59364 candidates in this run, I'm only doing 9000 on my three iMacs. This should be done in July. My Mac minis are testing much smaller Leyland numbers (currently ~386750 digits) for primality and I'll keep that going until I exhaust my current crop of sieved numbers in that range. Only then will I divert them to help in the million-digit hunt.
If we look at OEIS A094776, one sees the beginnings of sequences that apply the inherent concept to strings of more than one digit. Keith Lynch suggested the idea (tongue-in-cheek, I thought) on MathFun a few days ago and Maximilian Hasler actually worked out the numbers for strings 10 to 18. I decided to chart a more comprehensive listing...
My results: sorted by strings and sorted by powers of two. There are "coincidences" where two or more strings share the same power of two as their final non-appearance exponent (for example, the two 71s in A094776 for digits 5 and 7). I'll list those here after brief summaries of each n-digit result:
1-digit strings
{71,5}
{71,7}
...
range: 119.5 ± 48.5
average: 1026/10
...
{153,3}
{168,2}
string coincidence
71: {5,7}
2-digit strings
{1300,91}
{1416,07}
...
range: 2399.5 ± 1099.5
average: 215386/100
...
{3493,28}
{3499,95}
string coincidence
2146: {33,48}
3-digit strings
{20589,141}
{20729,713}
...
range: 37290.5 ± 16701.5
average: 28860154/1000
...
{51375,552}
{53992,661}
string coincidences
22044: {024,275}
24486: {404,675}
25305: {410,947}
25440: {317,604}
25668: {442,815}
25704: {123,766}
25980: {096,868}
26046: {378,588}
26136: {422,677}
26316: {227,929}
26477: {152,690}
26695: {085,256}
26792: {048,732}
27003: {737,974}
27121: {545,932}
27479: {183,687}
28196: {300,554}
28252: {116,641}
28270: {099,575}
28317: {578,656}
28425: {287,392}
28532: {171,910}
28609: {017,919}
28784: {033,719}
28850: {164,647}
28891: {346,505}
29173: {648,787}
29705: {668,997}
29711: {335,799}
29976: {665,995}
30977: {131,395}
32637: {076,426}
33550: {555,796}
33607: {582,598}
33631: {117,735}
39571: {021,622}
The loud sound of a helicopter just before 10:30 p.m. last night got me to look out the window and, because of the unusual appearance of the tail, run to get my camera and take a photo from the front porch. The aircraft disappeared behind the apartment buildings on Weston Rd. — seemingly landing (in the vicinity of Weston's UP Express train station; I'm going to guess at the Toronto Paramedic Services lot). Coincidentally, a UP Express service alert appeared one-and-a-half hours later.
![]() |
click to enlarge |
![]() |
click to enlarge |
![]() |
manual distribution worksheet for 59536 primality tests |
What have I discovered? Of Leyland numbers with at least one million decimal digits, but fewer than one million one hundred decimal digits, there is only one prime. That prime was discovered by Gabor Levai long before I got to it. I saved all of my primality-test output where the 59536 entries are listed smallest to largest. If you want to see the one prime, search for "PRP".
The execution times vary wildly (due to processor circumstances) with an average of 9.45 hours per test. That would work out to 64 years if I hadn't been able to multi-process. I know now how to keep the execution times to 6 hours or less per test but that means running fewer processes per machine. Still, I might be able to shave a couple of months off the total time required for the next run.
Éric Angelini presented a proposal for three "digit-spine" sequences on his blog here, as well as to the MathFun community. I decided to take on the first one:
s = 1, 10, 2, 0, 3, 26, 9, 119, 532, 4, 6, 896, 118, 34, 15, ...
p = 2, 11, 2, 2, 3, 23, 7, 113, 523, 3, 5, 887, 113, 31, 13, ...
d = 1, 1, 0, 2, 0, 3, 2, 6, 9, 1, 1, 9, 5, 3, 2, ...