mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 1000
Search took 0.23 seconds.
Search: Posts Made By: alpertron
Forum: Msieve 2020-04-25, 14:13
Replies: 11
Views: 718
Posted By alpertron
WebAssembly threads requires SharedArrayBuffer....

WebAssembly threads requires SharedArrayBuffer. This was implemented on major browsers but since Spectre and Meltdown attacks were found in January 2018, the feature was disabled in both Chrome and...
Forum: Msieve 2020-04-25, 01:51
Replies: 11
Views: 718
Posted By alpertron
Probably for larger inputs his port of msieve is...

Probably for larger inputs his port of msieve is faster because I have not implemented the double large prime variation for SIQS.

But for an intermediate value, such as 10^59+213, it takes 4.3...
Forum: PrimeNet 2019-11-22, 03:28
Replies: 27
Views: 1,507
Posted By alpertron
You can see in...

You can see in https://www.mersenne.org/report_ecm/ the effort done on Fermat numbers.

For example, for 2^33554432+1 (F25, about 10 million digits), the 35-digit level was finished and Prime95 has...
Forum: PrimeNet 2019-11-22, 03:04
Replies: 27
Views: 1,507
Posted By alpertron
The program Prime95 is optimized for huge...

The program Prime95 is optimized for huge numbers. Ryan Propper uses GMP-ECM or a similarly step-2 optimized application, and then he sends the results manually to the Primenet server.

It is clear...
Forum: PrimeNet 2019-11-22, 01:34
Replies: 27
Views: 1,507
Posted By alpertron
If you look at the current assignments at...

If you look at the current assignments at https://www.mersenne.org/primenet/ , there is a lot of assignments of numbers of several million digits (up to about 6 million digits). How can you optimize...
Forum: PrimeNet 2019-11-22, 00:33
Replies: 27
Views: 1,507
Posted By alpertron
The program Prime95 operates with huge numbers....

The program Prime95 operates with huge numbers. B2 is always set to 100*B1 to prevent memory overflow. That's why the number of curves for Prime95 is greater that the number you indicated above.
Forum: Programming 2019-11-15, 21:07
Replies: 13
Views: 1,199
Posted By alpertron
Thanks for testing. Actually, it detects whether...

Thanks for testing. Actually, it detects whether the Web browser supports WebAssembly or not, so in the second case it uses asm.js (which is a subset of JavaScript that can be executed efficiently in...
Forum: Programming 2019-11-15, 02:40
Replies: 13
Views: 1,199
Posted By alpertron
I've fixed several errors, including the number...

I've fixed several errors, including the number of digits in groups, a fix on biquadratic equations, now it works on Web browsers that do not support WebAssembly and other minor errors.

With...
Forum: Programming 2019-11-13, 20:17
Replies: 13
Views: 1,199
Posted By alpertron
Those old browsers do not support WebAssembly....

Those old browsers do not support WebAssembly. This was added on Firefox version 52, dated March 7, 2017.
Forum: Programming 2019-11-13, 20:15
Replies: 13
Views: 1,199
Posted By alpertron
The answer shown by the application is wrong. I...

The answer shown by the application is wrong. I unchecked Pretty Print, copied the output to Notepad++, deleted all (xxx digits) and spaces, replaced i by I and finally copied that to gp. All five...
Forum: Programming 2019-11-13, 11:32
Replies: 13
Views: 1,199
Posted By alpertron
I installed the NoScript extension to Firefox on...

I installed the NoScript extension to Firefox on Windows 10, and the Javascript was disabled when I loaded the calculator. After selecting "Temp TRUSTED" for my Web site, it worked OK and I could see...
Forum: Programming 2019-11-12, 22:16
Replies: 13
Views: 1,199
Posted By alpertron
The problem is that 4-1 is legal, because the...

The problem is that 4-1 is legal, because the parser converts that to 3. You can enter any polynomial expression, as explained in the help that you can read by expanding the "accordions". The trick...
Forum: Programming 2019-11-12, 21:31
Replies: 13
Views: 1,199
Posted By alpertron
I started Firefox 70.0.1 on Windows 10, entered...

I started Firefox 70.0.1 on Windows 10, entered .4-1 so it showed x^4-1 in the polynomial box, then I pressed the Factor button. The output with Pretty Print disabled is:


x^4 − 1

Irreducible...
Forum: Programming 2019-11-12, 20:32
Replies: 13
Views: 1,199
Posted By alpertron
Calculator that can factor and find exact roots of polynomials

Hello folks,

I have uploaded to https://www.alpertron.com.ar/POLFACT.HTM a calculator that can factor polynomials over the integers or modulo a power of a prime. It also can find exact roots of...
Forum: PrimeNet 2019-09-01, 12:51
Replies: 497
Views: 44,491
Posted By alpertron
I think that if all prime factors of M1277 are...

I think that if all prime factors of M1277 are less than its square root, the GCD will give you M1277.
Forum: PrimeNet 2019-08-21, 13:44
Replies: 497
Views: 44,491
Posted By alpertron
Today TJAOI finished finding prime factors less...

Today TJAOI finished finding prime factors less than 266.

The last one is the prime factor 73786932973062531511 of M193866301 (65.99999915 bits)
Forum: PrimeNet 2019-07-07, 14:23
Replies: 319
Views: 16,835
Posted By alpertron
It appears that the page...

It appears that the page https://www.mersenne.ca/manyfactors.php does not show the number of Mersenne numbers with 4 factors known.
Forum: Programming 2019-04-21, 00:15
Replies: 61
Views: 8,121
Posted By alpertron
Now the page includes the methods used for...

Now the page includes the methods used for factoring polynomials.
Forum: Programming 2019-04-02, 17:30
Replies: 61
Views: 8,121
Posted By alpertron
I've just added integer polynomial factorization...

I've just added integer polynomial factorization to https://www.alpertron.com.ar/POLFACT.HTM . This is new code. The old Java code only supported evaluation and factorization of polynomials modulo...
Forum: Prime Wiki 2019-03-11, 23:50
Replies: 6
Sticky: Let me in!
Views: 772
Posted By alpertron
Since I contributed several pages on...

Since I contributed several pages on Mersennewiki, I would like to edit the new wiki.

Please assign the user ID the same as my forum ID.

Done
Forum: PrimeNet 2019-01-16, 23:16
Replies: 319
Views: 16,835
Posted By alpertron
https://www.mersenne.ca/exponent/2568793 The...

https://www.mersenne.ca/exponent/2568793

The fourth factor is the product of the second and third. Probably this problem occurs because the Prime95 application executing on my computer submitted...
Forum: PrimeNet 2018-12-03, 13:55
Replies: 319
Views: 16,835
Posted By alpertron
I found that in page...

I found that in page https://www.mersenne.ca/exponent/2535283 , the fifth "prime" factor is the product of the third and fourth.
Forum: Data 2018-10-23, 14:18
Replies: 511
Views: 42,639
Posted By alpertron
I was able to configure Bash for Windows to run...

I was able to configure Bash for Windows to run Primo on Windows 10.

I performed the following steps in Ubuntu 18.04 on Bash for Windows:

1) Install Xming (the X server)
2) Open Bash for...
Forum: Programming 2018-09-16, 12:56
Replies: 6
Views: 1,998
Posted By alpertron
I found no further errors, so the new...

I found no further errors, so the new factorization application is at its expected location: https://www.alpertron.com.ar/ECM.HTM
Forum: Programming 2018-09-12, 17:32
Replies: 6
Views: 1,998
Posted By alpertron
Now when the code detects that the number can be...

Now when the code detects that the number can be divided by a very small factor (less than 100000), it will quickly determine the maximum exponent of this small factor that can divide the number, so...
Showing results 1 to 25 of 1000

 
All times are UTC. The time now is 09:33.

Wed Jun 3 09:33:47 UTC 2020 up 70 days, 7:06, 2 users, load averages: 1.47, 1.76, 1.71

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.