Search Results for "fast"
Sort By:
Showing 2 open source projects for "fast"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
Book-Reviews-In-Mathematica
Partial Differential Equations, Complex Analysis, Mathematica, Farlow
Cliff* Notes, Mathematica Evaluatable "Partial Differential Equations for Scientists and Engineers", Farlow "Physics for Scientists and Engineers", Serway "A First Course in Complex Analysis", Beck "PDE", Asmar "PDE, An Introduction", Colton "Elementary Differential Equations", 7th, Rainville "Ordinary Differential Equations", Tenenbaum "Linear Algebra And It's Applications", Lay "Swokowski Calculus", 5th, Swokowski "Chemistry Concepts & Problems, A Self-Teaching Guide",... -
2
n-chinese-remainders
chinese remainder theorem - progressive solving, n-soln, extras
"chinese remainder" solves a system of equations over modulus quickly. crtwo is an improvement to Mathematica's release. crtwo: solves Chinese Remainder a pair at a time, (uses gcd), yet is still fast. Which means crtwo, unlike text book soln, uses an algorithm to solve or fail one mod equation at a time. showing win or fail of each eqn and solving other sawtooth intersections is possible, due to that. crAll2@crtwo provides n soln near x for CR using width of soln crchart3 shows sawtooth CR waves and visible soln align1: solves i m2 == j m2 + b -> {i,j,dist} (like PowerMod->i but b is any and gcd(m1,m2) not req.) ...
- Previous
- You're on page 1
- Next
