Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Euler's_factorization_method> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Euler's_factorization_method abstract "Euler's factorization method is a technique for factoring a number by writing it as a sum of two squares in two different ways. For example the number can be written as or as and Euler's method gives the factorization .The idea that two distinct representations of an odd positive integer may lead to a factorization was apparently first proposed by Marin Mersenne. However, it was not put to use extensively until Euler one hundred years later. His most celebrated use of the method that now bears his name was to factor the number , which apparently was previously thought to be prime even though it is not a pseudoprime by any major primality test.Euler's factorization method is more effective than Fermat's for integers whose factors are not close together and potentially much more efficient than trial division if one can find representations of numbers as sums of two squares reasonably easily. Euler's development ultimately permitted much more efficient factoring of numbers and, by the 1910s, the development of large factor tables going up to about ten million[citation needed]. The methods used to find representations of numbers as sums of two squares are essentially the same as with finding differences of squares in Fermat's factorization method.The great disadvantage of Euler's factorization method is that it cannot be applied to factoring an integer with any prime factor of the form 4k + 3 occurring to an odd power in its prime factorization, as such a number can never be the sum of two squares. Even odd composite numbers of the form 4k + 1 are often the product of two primes of the form 4k + 3 (e.g. 3053 = 43 × 71) and again cannot be factored by Euler's method.This restricted applicability has made Euler's factorization method disfavoured for computer factoring algorithms, since any user attempting to factor a random integer is unlikely to know whether Euler's method can actually be applied to the integer in question. It is only relatively recently that there have been attempts to develop Euler's method into computer algorithms for use on specialised numbers where it is known Euler's method can be applied.".
- Euler's_factorization_method wikiPageID "15822069".
- Euler's_factorization_method wikiPageRevisionID "600606580".
- Euler's_factorization_method hasPhotoCollection Euler's_factorization_method.
- Euler's_factorization_method subject Category:Integer_factorization_algorithms.
- Euler's_factorization_method type Abstraction100002137.
- Euler's_factorization_method type Act100030358.
- Euler's_factorization_method type Activity100407535.
- Euler's_factorization_method type Algorithm105847438.
- Euler's_factorization_method type Event100029378.
- Euler's_factorization_method type IntegerFactorizationAlgorithms.
- Euler's_factorization_method type Procedure101023820.
- Euler's_factorization_method type PsychologicalFeature100023100.
- Euler's_factorization_method type Rule105846932.
- Euler's_factorization_method type YagoPermanentlyLocatedEntity.
- Euler's_factorization_method comment "Euler's factorization method is a technique for factoring a number by writing it as a sum of two squares in two different ways. For example the number can be written as or as and Euler's method gives the factorization .The idea that two distinct representations of an odd positive integer may lead to a factorization was apparently first proposed by Marin Mersenne. However, it was not put to use extensively until Euler one hundred years later.".
- Euler's_factorization_method label "Euler's factorization method".
- Euler's_factorization_method label "Metodo di fattorizzazione di Eulero".
- Euler's_factorization_method label "Método de factorización de Euler".
- Euler's_factorization_method sameAs Eulerova_faktorizační_metoda.
- Euler's_factorization_method sameAs Método_de_factorización_de_Euler.
- Euler's_factorization_method sameAs Metodo_di_fattorizzazione_di_Eulero.
- Euler's_factorization_method sameAs m.03qcp3b.
- Euler's_factorization_method sameAs Q1608174.
- Euler's_factorization_method sameAs Q1608174.
- Euler's_factorization_method sameAs Euler's_factorization_method.
- Euler's_factorization_method wasDerivedFrom Euler's_factorization_method?oldid=600606580.
- Euler's_factorization_method isPrimaryTopicOf Euler's_factorization_method.