A random large emirp pair

One might think from my previous post that large base-ten emirps congregate near — or at least involve —  powers of ten. Well, record ones certainly do but that is surely an artifact of the convenience of searching for such integers in those locations, expressing them without having to show all of their digits, and even proving their primality.

I recently found that Mathematica has a RandomPrime function which can be configured to generate primes with a specific number of digits. By repeated application of it and checking each against the primality (most often lack-of-primality) of the integer created by reversing its decimal digits, I can now create random emirps.

While[PrimeQ[IntegerReverse[r = RandomPrime[{10^999, 10^1000}]]] == False]; r

3279288520829477235642879267287999159015788532533738855066046440495522398413879852102369701530100869580838076083149157548206285059151203914266414912431580164820025933969565023665242290427065104497454406152915882315883324964117545072539206755054402862798019415649139491569247916954175149446689650326543522910485350967102290630555006513883295579511863580034048864302120190250042483217978026251237207016901362308898161048199473494827584506196053490289923397647958362118557321048941198888848619470770742015547396263817662528411868482723797066437421483218035169802940903987225108903574471943089572864902145297776096342849868617007993544349744145780223402039236076990018520939944400626427281300176781542771736168164872520396475344293444882067084862153824121702601618059184428161120858343524815906494130051717507462817874659446095816309231120150861019479629358822063445459770400310760092233488204681637298530785169163900358943079863912831713129072815997830914582590098549219524593979172161769855800664064007

The reverse of this is:

7004604660085589671612719793954259129458900952854190387995182709213171382193689703498530093619615870358927361864028843322900670130040779545443602288539269749101680510211329036185906449564787182647057171500314946095184253438580211618244819508161062071214283512684807602884443924435746930252784618616371772451876710031827246260044499390258100996706329302043220875414479434453997007168689482436906777925412094682759803491744753098015227893090492089615308123841247346607973272848681148252667183626937455102470770749168488888911498401237558112638597467933299820943506916054857284943749918401618988032631096107027321526208797123842400520910212034688404300853681159755923883156005550360922017690535840192253456230569866449415714596197429651949319465149108972682044505576029352705457114694233885132885192516044547944015607240922425663205659693395200284610851342194146624193021519505826028457519413806708380859680010351079632012589783148932255940446406605588373352358875109519997827629782465327749280258829723

I did not think that I would be able to prove their primality, but factordb (click on either number to see its evaluation there) was very helpful in doing just that for me, mostly without my input.

Some recent large emirps

[Let it be understood that all emirps come in pairs, say (p, q) where the number of (decimal) integer digits of p and of q are identical, but p < q. Since, in the following, we are dealing with record large integers, I will state the value of q, the larger of the pair, notwithstanding the fact that p is roughly the same size. I leave it as an exercise for my readers to figure out, should they so choose, the corresponding smaller values of each pair.]

In 2007, Jens Kruse Andersen noted the 10007-digit 10^10006+941992101*10^4999+1 as the then-largest-known emirp. Eighteen years later, Stephan Schöler managed to up this by 4 decimal digits with his 3867632931*10^10001+1. In a one-month-ago-today Numberphile, Matt Parker highlighted this discovery, bringing about (of course!) a flurry of new records:

Gamer "Gelly Gelbertson" provided 10^10056+10^6692+10^5872+1, a 10057-digit term in my own OEIS A393530. Mykola Kamenyuk gave us the 11120-digit 117954861*10^11111+1 and (a primo-proof later) 190907571*10^11111+1. More recently, in the YouTube comments, @wuudturner provided the 12346-digit 79191501*10^12338+1 and @vgdominion4049, the 20001-digit 10^20000+518406362*10^9996+1.

I doubt that this is the end of it and I will replace this paragraph with further updates. Email me if you spot any errors or have anything to add.

Within You Without You (cover)

War (on Iran). What is it good for?

Numerical relativity

The Azolla event

Kids dancing

Emirps in A157711

After watching Matt Parker's February 16th Numberphile video on Stephan Schöler's largest currently known emirp, I wondered of course if any of the primes that are the sum of four distinct powers of ten (A157711, on which I have been working now for nine months) were emirps. It turns out there were a healthy number and I decided to create two new OEIS sequences for them: A393530 and A393531.

While more than half (533) of the first 1000 digit-lengths had no solutions, the others had anywhere from 1 to 7 (digit-length 41) solutions. Moreover, the accumulation of emirp-pair counts showed a steady rise, giving me hope that this would continue for larger digit-lengths:

emirp-pair count accumulations for the first 1036 digit-lengths (click to enlarge)

I will see if I can increase my counts to 2000+ digit-lengths. I was going to attempt a search for a record large pair but gamer "Gelly Gelbertson" beat me to it with his Numberphile video comment (10^10056+10^4184+10^3364+1, 10^10056+10^6692+10^5872+1), apparently made on February 18th (although I discovered it only on March 14th):

click to enlarge

The five-millionth term of A157711

The sum of the first 4006 prime counts of A383675 is 4998755. The sum of the first 4007 prime counts is 5001521. Hence, the five-millionth term of A157711 is a 4007-digit integer:

4998756 10^4006+10^39+10^18+1

4998757 10^4006+10^104+10^53+1

4998758 10^4006+10^108+10^16+1

4998759 10^4006+10^177+10^120+1

4998760 10^4006+10^192+10^59+1

...

4999995 10^4006+10^2671+10^2184+1

4999996 10^4006+10^2672+10^696+1

4999997 10^4006+10^2672+10^1708+1

4999998 10^4006+10^2673+10^392+1

4999999 10^4006+10^2673+10^530+1

5000000 10^4006+10^2673+10^876+1

5000001 10^4006+10^2673+10^1124+1

5000002 10^4006+10^2675+10^1928+1

5000003 10^4006+10^2676+10^1232+1

5000004 10^4006+10^2677+10^1160+1

5000005 10^4006+10^2677+10^2092+1

...

5001517 10^4006+10^4003+10^3570+1

5001518 10^4006+10^4003+10^3818+1

5001519 10^4006+10^4003+10^3854+1

5001520 10^4006+10^4004+10^609+1

5001521 10^4006+10^4005+10^1892+1

A157711(1*10^6) = 10^1793+10^673+10^615+1 [2025 June 19]

A157711(2*10^6) = 10^2535+10^1160+10^398+1 [2025 July 21]

A157711(3*10^6) = 10^3103+10^2747+10^859+1 [2025 September 10]

A157711(4*10^6) = 10^3583+10^3040+10^2776+1 [2025 December 7]

A157711(5*10^6) = 10^4006+10^2673+10^876+1 (above)

A157711(6*10^6) ~ 10^4388

I'll continue to update (here, until the next millionth is reached) my current plot of A383675:

A383675 to n=4166; max=(4137,3448) [updated March 16]  click to enlarge

Rubik's cube record