calculators
calculators copied to clipboard
Source code of calculators hosted at https://www.alpertron.com.ar
Add a button after the factorization finishes that generates the ECPP factorization certificates, so everybody is sure that the factors shown are prime.
Convert old applet to HTML5 + Javascript + WebAssembly
Since Google Chrome and Microsoft Edge are about to support MathML, the calculators should detect that this feature is present and in this case, use it instead of the current...
For the five roots of the polynomial x^5-1, the representations only use integers and i and the operations of addition, subtraction, multiplication, division, and the extraction of roots, but for...
Add N-1/N+1 primality testing and P-1/P+1 integer factoring to the integer factorization calculator
Currently, for the integer factorization calculator, "Prime" (primality testing) only uses the Baillie-PSW probable primality testing (a probable primality testing, i.e. they _might_ be pseudoprimes) and the ECPP primality testing,...
Currently the modulus of the polynomial factorization calculator must be a prime number or a power of a prime, but I think that a general composite number modulus should be...
I know you calculator isn’t about being efficient, but your ᴇᴄᴍ step takes much time and doesn’t use worker thread for multrithreading. Would it be possible to let users supplying...
I know you’d prefer ɴꜰꜱ, but for large fields, this is definitely the best way to do. https://gist.github.com/jproney/7e6cb7a40a8bf342e978a900a32e4dfc should apply to finite rings too. The point is if you know...
I'm trying to solve **26x^2-91xy-26y^2-58x-59y-71=0** The solver (directly running the C version or running through webassembly) returns ``` x0 = -2 y0 = -1 ``` with 2 recurrence equation and...
Given that more than 90% the users run web browsers that support MathML, the code has to be changed to support it. So, the display will be a lot faster...