Hasil pencarian

...d, ''Newton Methods for Nonlinear Problems. Affine Invariance and Adaptive Algorithms.'' Springer Series in Computational Mathematics, Vol. 35. Springer, Berlin, ...olving Nonlinear Equations with Newton's Method'', no 1 in Fundamentals of Algorithms, SIAM, 2003. {{isbn|0-89871-546-6}}. ...

...y is the basis of the assumed security of some [[public key cryptography]] algorithms, such as [[RSA (algorithm)|RSA]]. ...s. Even though the structure of the factorization is known in these cases, finding the actual factors can be computationally challenging. ...

...'(''x'') = 0}} of degree {{mvar|n}} has a [[rational root theorem|rational root]] {{math|α}}, the associated polynomial can be factored to give the form {{ * one real double root if <math>\Delta = 0</math> ; ...

...ix}x^{im} & 0 \\0 & x^{jm} \end{bmatrix}</math>, ''x'' adalah salah satu [[root modulo primitif n | akar primitif]] dari ''F''_''q''. Karena uru === Algorithms === ...

...8}}: "The arithmetic content of the ''Śulva Sūtras'' consists of rules for finding Pythagorean triples such as (3, 4, 5), (5, 12, 13), (8, 15, 17), and (12, 3 ...topes, volume and surface area of convex bodies, [[Gaussian curvature]], [[algorithms]], [[tiling (geometry)|tilings]] and [[lattice (group)|lattice]]s.--> ...