mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 11 of 11
Search took 0.01 seconds.
Search: Posts Made By: chroma
Forum: And now for something completely different 2019-06-01, 20:04
Replies: 109
Views: 22,812
Posted By chroma
Thank you for the next mfsieve compilation. I...

Thank you for the next mfsieve compilation.
I did a comparison of 3 mfsieve files
S1 - file compiled by the lalera
S2 - The mfsieve file in mtsieve framework
S3 - the file mfsieve-1.5 last...
Forum: And now for something completely different 2019-05-30, 20:42
Replies: 109
Views: 22,812
Posted By chroma
OpenCL.dl I have 2 times c: \ Windows \...

OpenCL.dl I have 2 times
c: \ Windows \ System32 \ OpenCL.DLL
c: \ Windows \ SysWOW64 \ OpenCL.DLL
Copying it to the folder from mfsieve gives nothing

The link I gave was mfsieve compiled by a...
Forum: And now for something completely different 2019-05-30, 08:34
Replies: 109
Views: 22,812
Posted By chroma
No The mfsieve can not be started with or...

No
The mfsieve can not be started with or without parameters. (also with -h)
Forum: And now for something completely different 2019-05-29, 20:19
Replies: 109
Views: 22,812
Posted By chroma
It's very nice that you've collected all the...

It's very nice that you've collected all the procedures for sieving into mtsieve framework
But mfsieve.exe does not work:
error: The clCreateComandQueueWithProperties procedure input was not found...
Forum: And now for something completely different 2019-05-29, 11:35
Replies: 109
Views: 22,812
Posted By chroma
Thanks! I added...

Thanks!
I added http://mfprimes.cba.pl/participate.html (http://mfprimes.cba.pl/participate.html)
Forum: And now for something completely different 2019-05-26, 19:54
Replies: 109
Views: 22,812
Posted By chroma
26-05-2019 the largest multifactorial primes is ...

26-05-2019 the largest multifactorial primes is

513,755!5 - 1 It has 542,165 digits

In the decimal notation it looks like this
4062150858<-- 439404 digits -->4990234374--> 102741 digits...
Forum: And now for something completely different 2017-03-05, 21:18
Replies: 109
Views: 22,812
Posted By chroma
A new record of largest multifactorial primes ...

A new record of largest multifactorial primes

220502!2+1 is prime! (digits: 541,239) SFukui 01/2017

http://primes.utm.edu/primes/page.php?id=122753
Forum: And now for something completely different 2017-02-16, 11:02
Replies: 109
Views: 22,812
Posted By chroma
The same case holds for mfp+1 (n!7+1) n -> (35...

The same case holds for mfp+1 (n!7+1)
n -> (35 = 5*7, 49 = 7^2, 147 = 3*7^2, 336 = 2^4*3*7, 2079 = 3^3*7*11, 8855 = 5*7*11*23, 20636 = 2^2*7*11*67, 22988 = 2^2*7*821, 41139 = 3^2*7*653, 208502 =...
Forum: And now for something completely different 2017-02-14, 21:47
Replies: 109
Views: 22,812
Posted By chroma
Congrats ! I verified this result ...

Congrats !
I verified this result

Primality testing 559741!7+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 79967
Calling Brillhart-Lehmer-Selfridge with factored part 33.95%...
Forum: And now for something completely different 2017-02-14, 21:41
Replies: 109
Views: 22,812
Posted By chroma
On my webpage, I have put all Kevin's results. I...

On my webpage, I have put all Kevin's results. I have been verifying only the results of multifactorial primes with digits <= 10,000. I haven't verified the rest.

The list of all multifactorial...
Forum: And now for something completely different 2017-01-31, 12:15
Replies: 109
Views: 22,812
Posted By chroma
Hello Mark, 2016-08-28 you wrote "I have...

Hello Mark,

2016-08-28 you wrote "I have replaced yet another sieve that I coded long along in MultiSieve.
It is a sieve for multifactorials".
WOW that's good information.
I downloaded...
Showing results 1 to 11 of 11

 
All times are UTC. The time now is 17:17.


Fri Jul 16 17:17:42 UTC 2021 up 49 days, 15:04, 1 user, load averages: 2.07, 1.87, 1.71

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.