mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 1000 Search took 0.14 seconds. Search: Posts Made By: alpertron
 Forum: Programming 2020-11-30, 17:15 Replies: 33 Views: 5,022 Posted By alpertron I should add TEX output to my calculators when... I should add TEX output to my calculators when requested by user. That would be an interesting addition to the programs.
 Forum: Programming 2020-11-30, 15:47 Replies: 33 Views: 5,022 Posted By alpertron There is a copy error. Using your input I get: ... There is a copy error. Using your input I get: x1 to x3 = 0 r = (19 + 3 * 33^(1/2))^(1/3) s = (19 - 3 * 33^(1/2))^(1/3) x4 = 1 + r + s x5 = 1 - (r + s) / 2 + (i/2) * (r - s) * 3^(1/2) x6 =...
 Forum: Programming 2020-11-28, 23:13 Replies: 33 Views: 5,022 Posted By alpertron I fixed the LLL routine and optimized the Hensel... I fixed the LLL routine and optimized the Hensel Lifting. Now the factorization of polynomials of degree less than 1000 with small coefficients can be done in seconds.
 Forum: Data 2020-11-26, 02:28 Replies: 3 Views: 115 Posted By alpertron Thanks. So this was a false alarm. Thanks. So this was a false alarm.
 Forum: Data 2020-11-26, 01:06 Replies: 3 Views: 115 Posted By alpertron Too few factors found in 600M to 620M I've just looked at https://www.mersenne.ca/status/tf/0/1/2/60000 and I found that there should be some hardware error: 21192 factors in the range 600M-610M today in the 72-bit range: only 3...
 2020-10-17, 02:44 Replies: 3 Views: 305 Posted By alpertron Computing the Jacobi symbol is a lot faster than... Computing the Jacobi symbol is a lot faster than modular exponentiation. This is the source code I wrote in C language based on Crandall's and Pomerance's Prime Number book: // Calculate...
 Forum: Programming 2020-10-04, 21:20 Replies: 33 Views: 5,022 Posted By alpertron When the irreducible polynomial has degree >= 5,... When the irreducible polynomial has degree >= 5, now my code performs the factorization of this polynomials with prime modulus up to 100. If the conditions of Keith Conrad's paper that you can...
 Forum: FermatSearch 2020-10-03, 18:15 Replies: 58 Views: 2,796 Posted By alpertron Before even thinking on performing the primality... Before even thinking on performing the primality check of F33, a lot more trial factoring is needed and then someone has to run P-1.
 Forum: Programming 2020-10-02, 19:42 Replies: 33 Views: 5,022 Posted By alpertron All these examples are working now. Thanks for... All these examples are working now. Thanks for finding the errors. Please refresh the page to get the current version.
 Forum: Programming 2020-10-02, 01:18 Replies: 33 Views: 5,022 Posted By alpertron I fixed this error. Please refresh the page and... I fixed this error. Please refresh the page and retry. Since the application works with integer polynomials, the slash operator performs the division disregarding the remainder. This means...
 Forum: Programming 2020-10-01, 18:32 Replies: 33 Views: 5,022 Posted By alpertron I've just fixed this error. Please refresh the... I've just fixed this error. Please refresh the page so the Web page is dated 1 October 2020 and try again.
 Forum: Programming 2020-09-30, 03:40 Replies: 33 Views: 5,022 Posted By alpertron Now the response of the Web application is... Now the response of the Web application is shorter for polynomials of the form x5+n (n = integer).
 Forum: Programming 2020-09-30, 02:53 Replies: 33 Views: 5,022 Posted By alpertron The values found by the solver are correct as you... The values found by the solver are correct as you can see by unsetting pretty print, and then factoring it again. This is the output of the calculator. R1 = 0 R2 = (15625)^(1/5) R3 = 0 R4...
 Forum: Programming 2020-09-27, 22:47 Replies: 33 Views: 5,022 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: 39 Views: 7,787 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: 39 Views: 7,787 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: 39 Views: 7,787 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: 4,147 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: 222 Views: 29,816 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: 3,842 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: 2,929 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: 2,929 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: 3,390 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: 3,390 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: 3,390 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...
 Showing results 1 to 25 of 1000

All times are UTC. The time now is 15:49.

Tue Dec 1 15:49:46 UTC 2020 up 82 days, 13 hrs, 3 users, load averages: 3.11, 2.62, 2.18