mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 1000
Search took 0.27 seconds.
Search: Posts Made By: alpertron
Forum: Programming 2020-09-27, 22:47
Replies: 14
Views: 2,177
Posted By alpertron
Hello folks, I have added more features to...

Hello folks,

I have added more features to this calculator at https://www.alpertron.com.ar/POLFACT.HTM

Now it quickly factors integer polynomials with degree up to 1000 using Van Hoeij...
Forum: Factoring 2020-09-25, 03:28
Replies: 29
Views: 4,594
Posted By alpertron
I've just updated the page...

I've just updated the page https://www.alpertron.com.ar/BRILLIANT3.HTM with your results. Thanks a lot.
Forum: Factoring 2020-09-19, 00:24
Replies: 29
Views: 4,594
Posted By alpertron
I've just added the discoveries posted to this...

I've just added the discoveries posted to this thread to https://www.alpertron.com.ar/BRILLIANT.HTM and also fixed the errors detected at https://www.alpertron.com.ar/BRILLIANT2.HTM
Forum: Factoring 2020-09-13, 17:02
Replies: 29
Views: 4,594
Posted By alpertron
At this moment I'm making changes to my...

At this moment I'm making changes to my calculator that factors and finds the roots of polynomials (you can see it at https://www.alpertron.com.ar/POLFACT.HTM). After that, I will update the page of...
Forum: Lounge 2020-08-26, 14:44
Replies: 48
Views: 1,907
Posted By alpertron
In Argentina merchants are required to indicate...

In Argentina merchants are required to indicate the price per kg or liter, so this cheat cannot be done.
Forum: Data 2020-07-11, 19:34
Replies: 164
Views: 21,951
Posted By alpertron
After running my Nvidia GTX 950 for 30 days, I...

After running my Nvidia GTX 950 for 30 days, I was able to find more than 60 factors in the ranges 71->72 bits, 72->73 bits and partially in 73->74 bits, reducing the number of unfactored Mersenne...
Forum: Factoring 2020-06-15, 15:28
Replies: 22
Views: 2,169
Posted By alpertron
Your code takes too long for changing...

Your code takes too long for changing polynomials. But that step should be very fast (that is why SIQS is named in that way). Probably you are using very few primes in the construction of your...
Forum: Msieve 2020-04-25, 14:13
Replies: 11
Views: 1,742
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: 1,742
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: 28
Views: 2,190
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: 28
Views: 2,190
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: 28
Views: 2,190
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: 28
Views: 2,190
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: 14
Views: 2,177
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: 14
Views: 2,177
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: 14
Views: 2,177
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: 14
Views: 2,177
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: 14
Views: 2,177
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: 14
Views: 2,177
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: 14
Views: 2,177
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: 14
Views: 2,177
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: 46,507
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: 46,507
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: mersenne.ca 2019-07-07, 14:23
Replies: 447
Sticky: mersenne.ca
Views: 25,320
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: 10,344
Posted By alpertron
Now the page includes the methods used for...

Now the page includes the methods used for factoring polynomials.
Showing results 1 to 25 of 1000

 
All times are UTC. The time now is 13:24.

Mon Sep 28 13:24:49 UTC 2020 up 18 days, 10:35, 1 user, load averages: 1.50, 1.99, 2.33

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.