
View Poll Results: What about This app you like it?  
Yes  4  36.36%  
No  3  27.27%  
Regular  1  9.09%  
Very bad  3  27.27%  
Voters: 11. You may not vote on this poll 

Thread Tools 
20190105, 03:09  #56  
Sep 2016
370_{10} Posts 
Quote:
I quite literally slapped that thing together over a weekend with no effort. No real optimizations. Even GMP Pi is faster. The reason why MiniPi gets any attention is probably because it's a single selfcontained file. 

20190105, 03:14  #57  
Jan 2019
43 Posts 
Quote:
HERE a video of Mersenne app in Android and comparison With apk Lucas lehmer in Google play. https://youtu.be/UR1jGwvUcQc 

20190105, 03:23  #58 
Sep 2003
13×199 Posts 

20190105, 16:13  #59 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
3^{3}·263 Posts 

20190105, 16:50  #60  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
3^{3}·263 Posts 
Quote:
a) grammar school conventional long multiplication (using what "digit size") Twice the exponent, four times as many partial products to compute and sum, for each of twice as many iterations. b) Karatsuba divide and conquer. Twice the exponent, THREE times as many partial products, plus some additional overhead. (applied recursively, or not?) c) ToomCook (for extra credit, which?) d) modular multiplication (using which relative primes?) e) fft (in which base?) f) a mix depending on operand or exponent size (which, and at what breakpoints) g) can't say, prepublication (what journal, and publication expected about when?) h) super secret new faster than linear, proprietary, classified, NSA and KGB and Spain's National Intelligence Agency are after thorken for releasing it in executable form i) Other (specify) What programming language did you use? Or put up some source code so we can look for ourselves. (Are you by any chance acquainted with Billy Rubin?) 

20190105, 20:10  #61 
∂^{2}ω=0
Sep 2002
República de California
2·3^{2}·653 Posts 
Does anyone reading this have an Android devboard with which to try an Mlucas build with? It would be best if it were one with an Arm CPU supporting the 128bit SIMD instructions (a.k.a. Arm v8+), but even failing that one could try a generic Ccode build using a scalardoublesbased FFT.
(Of course the OP is welcome to try same, but at present OP seems to be busy fending off rude questions about his bigint multiply algorithm. ;) 
20190105, 20:18  #62  
"Forget I exist"
Jul 2009
Dartmouth NS
10000011100010_{2} Posts 
Quote:
same exponents as OP, on the only working hardware I have at last check an android phone. I think it has a snapdragon processor, and PARIdroid was 2.11.0.1.5 edit2: seems my PARIdroid thinks they aren't prime though... Last fiddled with by science_man_88 on 20190105 at 21:02 

20190105, 21:09  #63 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
3^{3}×263 Posts 
Ok, in fairness to thorken, in post one, he says he found the application on a phone, and makes no claims to having written it.
From his third screen shot: Code:
Analizando M9967 Con 3000.37 Digitos Numeros Primos De Mersenne Encontrados 22 Tiempo Del Calculo 0h 2m 56s Calculo Den Numeros Primos De Mersenne A 0.12 PrimosM/Seg Indice De Velocidad 0.125 Puntos. MAX=100 Numeros Primos De Mersenne Calculados De 2^01 A 2^100001 Ultimo Numero Analizado Tenia 3000.37 Digitos Archivo Creado En Tu Telefono Con Los Numeros Primos De Mersenne (((    Fin Del Programa   ))) Programado Por Marcos Ochoa Diez ...@gmail.com http://youtube.com/... MvIiIaX Corp. 2019 serranoltexx:/sdcard/download # Code:
Analyzing M9967 with 3000.37 Digits Mersenne Primеs Found 22 Calculation Time 0h 2m 56s I calculate Mersenne's Prime Numbers at 0.12 PrimosM / Sec Speed Index 0.125 Points. MAX = 100 Mersenne Prime Numbers Calculated from 2 ^ 01 to 2 ^ 100001 Last Number Analyzed Tenia 3000.37 Digits File Created On Your Phone With Mersenne Cousins Numbers (((   End Of Program   ))) Programmed by Marcos Ochoa Ten ...@gmail.com http://youtube.com/... MvIiIaX Corp. 2019 serranoltexx: / sdcard / download # Code:
Analyzing M9967 with 3000.37 Digits Mersenne Primеs Found 22 Calculation Time 0h 2m 56s I calculate Mersenne's Prime Numbers at 0.12 PrimosM / Sec Speed Index 0.125 Points. MAX = 100 Mersenne Prime Numbers Calculated from 2^0  1 to 2^10000  1 Last Number Analyzed Had 3000.37 Digits File Created On Your Phone With Mersenne Prime Numbers (((   End Of Program   ))) Programmed by Marcos Ochoa Diez ...@gmail.com http://youtube.com/... MvIiIaX Corp. 2019 serranoltexx: / sdcard / download # Searching online for Marcos Ochoa Diez yielded (and I by no means endorse any of it) https://loteriaprimitiva.uptodown.c...dows/descargar https://generadordenumerosprimos....wn.com/windows https://www.amazon.com/MarcosOchoa.../dp/B00RN9BYNS https://yepdownload.com/monitorlunarip (Nothing on github or sourceforge in what I reviewed.) Last fiddled with by kriesel on 20190105 at 21:35 
20190105, 21:23  #64 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
19·269 Posts 
“Tenia” translates into “had”.
“Mersenne cousin numbers”, please replace cousin with prime. Last fiddled with by pinhodecarlos on 20190105 at 21:25 
20190105, 23:12  #65  
Sep 2003
13×199 Posts 
Quote:
GMP isn't that complicated and I could have written a simple LL test myself, however this code incorporates an optimization for the modulo that probably wouldn't have occurred to me. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
New test for Mersenne prime  allasc  Math  34  20220911 13:03 
Fastest software for Mersenne primality test?  JonathanM  Information & Answers  25  20200616 02:47 
Another way to PRP test Mersenne numbers  paulunderwood  Miscellaneous Math  18  20170126 20:33 
Conjectured Primality Test for Specific Class of Mersenne Numbers  primus  Miscellaneous Math  1  20141012 09:25 
another mersenne prime test  jocelynl  Math  8  20061020 19:36 