factorization of numbers with euclidian approach

Anyone know about this topic?. Factorization of numbers with euclidian approach I searching in the internet, but i couldnt find any source of this topic?. Some one can help me about this topic?. I suppose to find application factorization of numbers with euclidian approach.

anyone can help?

-

1 Answer

Perhaps you mean to use the Euclidean Algorithm for prime factorization of a number? You may also be interested in the section on Euclidean Division.

Assuming you are interested in the unique prime factorization of a given number, you might also want to scroll down the page of the entry for the Fundamental Theorem of Arithmetic, where Euclid's Lemma is used in the proof.

Perhaps you can include a specific example (problem) which you are asked to factor?

-
i guess so, can u give me some example of Euclidean Algorithm for prime factorization of a number sir? – user46309 Dec 17 '12 at 14:29
I suppose to find application Euclidean Algorithm for prime factorization, but first i want to learn the theory, i'm sorry to bother u sir, but can u show me, process Euclidean Algorithm if we want to get prime factorization of 616. I still read en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic – user46309 Dec 17 '12 at 14:47
Euclid's algorithm is sometimes used as one small part of the process of factoring a number. Given an integer $n$, there are ways of generating numbers $m$ that might have a common factor with $n$; you use Euclid's algorithm to find that common factor if there is one. – Gerry Myerson Dec 25 '12 at 6:45