# Euclidean Algorithm vs Factorization

Can a person offer me a description targeted to a senior high school pupil regarding why locating thegcd of 2 numbers is much faster making use of the euclidean algorithm contrasted to making use of factorization, there need to be no algorithm performance entailed, simply a basic description, something my bro in quality 9 can recognize.

0
2019-05-18 21:48:09
Source Share
Answers: 3

For really handful after that factorization is quicker than the Euclidean algorithm. Yet the Euclidea algorithm offers extra ; it permits one to calculate reciprocals. in modular math.

For bigger numbers, locating factorizations might be slow-moving or perhaps almost. difficult, yet the Eulcidean algorithm still functions well. Additionally modern-day. factorization approaches from Pollard rho to the number area filter, make. crucial use the Euclidean algorithm.

0
2019-05-21 21:25:42
Source

It comes down to the reality that presently recognized factorization algorithms are much slower than the fastest well-known gcd algorithms. It would certainly be hard to claim far more than that that would certainly be understandable to a 9' th quality pupil (actually one could say that very little even more than that is also recognized to specialists).

0
2019-05-21 06:30:25
Source

The Euclidean algorithm is a precise dish that inform you specifically what to do at any kind of provided action ; there is no presuming, no experimentation entailed. Attempting to factor a number will certainly (despite having several of the most effective approaches presently recognized) entail hunches and also test - and also - mistake ; test department is certainly the timeless instance, yet also several of our ideal approaches (elliptic contour factorization and also number area filter, to call 2) all entail some "arbitrary presuming" and also tests to search for variables. Certain, they are extra brilliant means of screening than merely attempting every little thing around, yet you still generally wind up doing a great deal of dirty work along the road that leads no place (separating by a number that is not a consider test department ; not obtaining excellent relationships in the number area filter ; executing all calculations on an elliptic contour modulo $n$ and also not locating any kind of non - invertible components), or executing excellent - looking calculations that wind up with an unimportant variable ($1$ or $n$). Fundamentally, this is "thrown away initiative", waste that merely does not accompany the Euclidean algorithm.

Included: Note that this is a representation of our existing well-known factoring approaches, and also not always (as Bill Dubuque mentions, we simply do not recognize regardless) an integral trouble in factoring. You do not intend to contrast "factoring" with "Euclidean algorithm", you intend to contrast details means of factoring with the Euclidean algorithm. And also the means we understand (and also the means the senior high school pupils recognize, which are most likely to be test department plus a handful or 2 of divisibility examinations to make the previous less complex) have these downsides.

Probably an example would certainly be that the Euclidean algorithm resembles having a complete dish to prepare a recipe, and also all the active ingredients outlined all set to be made use of ; factorization entails beginning to prepare the recipe, searching via your products for active ingredients, and also perhaps understanding component - means via that you do not have the appropriate active ingredients, compeling you to begin again from square one with a new recipe for which you wish you do have the active ingredients. Also if the previous scenario entails an intricate recipe while the last is a collection of efforts at really straightforward and also fast recipes, opportunities are you will certainly invest much less complete time with the complete - dish - and also - all - active ingredients - laid - out - method than the allowed is - shot - this - and also - hope - we - have - all - the - things method.

0
2019-05-21 06:01:53
Source