 On Thu, 9/17/09, Igor Chudov <ichudov@gmail.com> wrote:
> My site algebra.com is about 80,000
> lines of mod_perl code.
>
> I wrote a relatively large framework, with many homegrown
> perl modules, about five years ago.
> It uses a database, image generation modules, a big
> mathematical engine that I wrote (that "shows
> work", unlike popular third party packages), etc.
>
>
> All pages of my site are dynamic and it is very image heavy
> due to math formulae.
>
> I can say two things:
>
> 1) It is relatively fast, serving pages in 0.1 seconds or
> so
>
> 2) Despite the quantity of code, and its age, it is still
> very maintainable and understandable (to me).
In that case, would you like to fix its mangled output?
e.g. http://www.algebra.com/algebra/homework/divisibility/Prime_factorization_algorithm.wikipedia
Â Â (Redirected from Prime factorization algorithm)
faster than O((1+Îµ)b) for all positive Îµ
an integer M with 1 â‰¤ M â‰¤ N
Pollard's p âˆ’ 1 algorithm
Section 4.5.4: Factoring into Primes, pp. 379â€“417.
Chapter 5: Exponential Factoring Algorithms, pp. 191â€“226. Chapter 6: Subexponential
Factoring Algorithms, pp. 227â€“284. Section 7.4: Elliptic curve method, pp. 301â€“313.
Eric W. Weisstein, â€œRSA640 Factoredâ€
v â€¢ d â€¢ e
AKS Â· APR Â· Ballieâ€“PSW Â· ECPP Â· Fermat Â· Lucas Â· Lucasâ€“Lehmer
Â· Lucasâ€“Lehmerâ€“Riesel Â· Proth's theorem Â· PÃ©pin's Â· Solovayâ€“Strassen
Â· Millerâ€“Rabin Â· Trial division
Sieve of Atkin Â· Sieve of Eratosthenes Â· Sieve of Sundaram Â· Wheel factorization
CFRAC Â· Dixon's Â· ECM Â· Euler's Â· Pollard's rho Â· P âˆ’ 1 Â· P + 1 Â·
QS Â· GNFS Â· SNFS Â· rational sieve Â· Fermat's Â· Shanks' square forms Â· Trial
division Â· Shor's
Ancient Egyptian multiplication Â· Aryabhata Â· Binary GCD Â· Chakravala Â· Euclidean
Â· Extended Euclidean Â· integer relation algorithm Â· integer square root Â· Modular
exponentiation Â· Schoof's Â· ShanksTonelli
Looks like you've got utf8 and iso88591 messed up.
Phil
