Pari's APR-CL is amazing, it outperforms anything else on its good sizes. But I didn't know it was still competitive at 1400 digits!

[QUOTE=CRGreathouse;235827]Pari's APR-CL is amazing, it outperforms anything else on its good sizes. But I didn't know it was still competitive at 1400 digits![/QUOTE]

64-bit -- that's the ticket. I'm sure a 32-bit build would've taken much longer.

Anyway, Primo has also now certified the 1420 digit prime.

[QUOTE=axn;235830]64-bit -- that's the ticket. I'm sure a 32-bit build would've taken much longer.[/QUOTE]

Got it. So my Linux binary will be fast even with large APR-CL tests, while the Windows binary (which comes only in 32-bit AFAIK) will be slow beyond some low barrier.

A 100 digit "random" example:

[CODE]6251819008108609189596199559212521890205619120810821098260051085182656115590152280982625995812869989
6866982185665292860822510655119592815801500928601280180216195020681252126556619656816098018006181529[/CODE]

and a 200 digit:
[CODE]11656108198915696525808686856699860995699900519880802615918508880102012126101891982602512250191269051209601510191152210810162966052968585011015190121958951555916915818509269655021861561890611262206919
61690229211906819519812055969260581851691655515685612106151011058589625099629101801225116101510960215069216105221520928616810192121020108880581651920808861500666956609866995898980852596951686180195911[/CODE]

300 digit:
[CODE]681206522556696105560255589009822608069551286209568058596565581025808029021210162601009980212668818820221889092928996216598005918809826660609581920962290018259092068889820256561012528110052505616116098081191551221191518908162958802156895529826990666918511699105625125158908062285599269919892156859181
181658951268616692665582290806851521529501669115816999066928625568951208856291806815161122155161180860911919505250011825210195952028688890260652810062296026185609099928608816500865912966826260688122028818899212086600109291012120620808520185595965850895602982155690809228600685552095501969955225902189[/CODE]

a couple more
 

500 digits:

[CODE]10052026115582591061802080695802268610510028100118806262896990592998186618611122526956861850215805598921889929116150206909906005915690829210505115622281581565261586599125295521096169186992562652919112901682298521182560960669215265905265560558916559600289618968515219916121216619980126125520885915618265985090212085820620560960911526655980682226612128669989096508259980610286066815550559158921125918880895068209256668168518216058682652920501599199092518902666915586808292295085258962210056905925216081
18091252650695001229685258056226280898551699920681526066166510502625928985091281589189995260289056808881652112685165505551899098201908665280596068669982121992228908655992511609609502902858021206058659281951658802552192108661991212191661251589681968200965591685509559250659251269909609528112586228910621161625929526698169196012556252166598519259518518222951150501262806951650090660690205191162668812686550851205819895692522111981998186626506696829290881100182001501989220856908020819016528551192025001[/CODE]

1000 digits:

[CODE]1655501699065280182255110282821295595562195518096610005501868619581606899056108962552698966080208989521862218118562018016625988169256802281222901096900111528588565282099198968502255825822090068801919862092092518885950051966160925186892959895258092255195109868258256062662060115020828952600862608108518818202960590255260860218606269556209162811168900059269182629695219989860011285215581168912929052082581156025528850561952020609062891686629699086569016600989616061528526608851591552108168659191865050061088181502801560509168180891912559956508221811508608126569560292198009655219606069266619186665886211102508628229658585251126109908959122959900019569206011156526605256155891662596529962116829122129928182825199890002101850591658288696591112892959582562868000528950816806510116916106956580860185201858820850892290205021916086856855089052518291116206810001252066522058825966866929101915802886890552596192961888868209812829212198081506262266695580229956081659801598501121692685228661968205122595180691559
6551690815652215028961998225892691211058651086591809566220855699922929051808612126282186028988881962619652550689882085161016269989965288502259902521000189029111628152506805589589809161205020622680580288581025810980859569019169110159089180568250008982952856562682111659698828591650581012000686615282818266212216289112966259652991685519525099259511109026956100066562216568066019211525858596228298052011129885999816199926909096125596008612620956959218098051181228059566552161680818916050951082051818801900505981616598918012551651588099258251909196860099106959806696299891682906090202561950588255209511852802506262168911855125821100986866125696292816926500068911182916029556929098120980925520650962028188158018092980092568280205110902992909528528986015615522608525686562689815260919961500565888152602602986161088900602285285522058968616602825958858251110069601062221822089526918865299108102958118122981256868020809968692552968019506689091856198981055000199608155612955655621282820115522810825906691055591
[/CODE]

That last one took a while to find... probably will stop here.

These prime partnerable numbers depend on decimal digit properties.
Even so, they form a non-trivial sequence. I'd be curious to see what
the first 100 of these numbers look like. If someone wants to write
(I'm guessing) a one-liner?

1762 digits: 1<687>98652<1068>1 and 1<1068>25986<687>1

[QUOTE=axn;235932]1762 digits: 1<687>98652<1068>1 and 1<1068>25986<687>1[/QUOTE]

are you making a string reversing code I've tried but I can't get tit to work right now lol if i do maybe i can finally care about this.

[QUOTE=science_man_88;235935]are you making a string reversing code I've tried but I can't get tit to work right now lol if i do maybe i can finally care about this.[/QUOTE]

There's a GP script in [url=http://oeis.org/classic/A004086]A004086[/url]. The code I have in my script file is

[code]rev(n:int,B=10)={
my(m=n%B);
n\=B;
while(n>0,
m=m*B+n%B;
n\=B
);
m
};
addhelp(rev, "rev(n, {B=10}): Base-B digit reversal of n. Sloane's A004086.");[/code]

But I imagine the other code is faster, since mine is about as naive as could be.

[QUOTE=CRGreathouse;235941]There's a GP script in [url=http://oeis.org/classic/A004086]A004086[/url]. The code I have in my script file is

[code]rev(n:int,B=10)={
my(m=n%B);
n\=B;
while(n>0,
m=m*B+n%B;
n\=B
);
m
};
addhelp(rev, "rev(n, {B=10}): Base-B digit reversal of n. Sloane's A004086.");[/code]

But I imagine the other code is faster, since mine is about as naive as could be.[/QUOTE]

see my first idea was to invert a vector of some kind but I bet that's slow as well.

[QUOTE=science_man_88;235935]are you making a string reversing code I've tried but I can't get [U][I]tit [/I][/U]to work right now lol if i do maybe i can finally care about this.[/QUOTE]

please edit this out lol