Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Trial_division> ?p ?o. }
Showing items 1 to 44 of
44
with 100 items per page.
- Trial_division abstract "Trial division is the most laborious but easiest to understand of the integer factorization algorithms. The essential idea behind trial division tests to see if an integer n, the integer to be factored, can be divided by each number in turn that is less than n. For example, for the integer n = 12, the only numbers that divide it are 1,2,3,4,6,12. Selecting only the largest powers of primes in this list gives that 12 = 3 × 4.".
- Trial_division wikiPageExternalLink factor.htm.
- Trial_division wikiPageID "557660".
- Trial_division wikiPageRevisionID "604979078".
- Trial_division hasPhotoCollection Trial_division.
- Trial_division subject Category:Articles_with_example_Python_code.
- Trial_division subject Category:Division.
- Trial_division subject Category:Integer_factorization_algorithms.
- Trial_division subject Category:Primality_tests.
- Trial_division type Abstraction100002137.
- Trial_division type Act100030358.
- Trial_division type Activity100407535.
- Trial_division type Algorithm105847438.
- Trial_division type Cognition100023271.
- Trial_division type Event100029378.
- Trial_division type Experiment105798043.
- Trial_division type HigherCognitiveProcess105770664.
- Trial_division type Inquiry105797597.
- Trial_division type IntegerFactorizationAlgorithms.
- Trial_division type PrimalityTests.
- Trial_division type ProblemSolving105796750.
- Trial_division type Procedure101023820.
- Trial_division type Process105701363.
- Trial_division type PsychologicalFeature100023100.
- Trial_division type Rule105846932.
- Trial_division type Thinking105770926.
- Trial_division type Trial105799212.
- Trial_division type YagoPermanentlyLocatedEntity.
- Trial_division comment "Trial division is the most laborious but easiest to understand of the integer factorization algorithms. The essential idea behind trial division tests to see if an integer n, the integer to be factored, can be divided by each number in turn that is less than n. For example, for the integer n = 12, the only numbers that divide it are 1,2,3,4,6,12. Selecting only the largest powers of primes in this list gives that 12 = 3 × 4.".
- Trial_division label "Divisions successives".
- Trial_division label "División por tentativa".
- Trial_division label "Probedivision".
- Trial_division label "Trial division".
- Trial_division label "Перебор делителей".
- Trial_division label "试除法".
- Trial_division sameAs Probedivision.
- Trial_division sameAs División_por_tentativa.
- Trial_division sameAs Divisions_successives.
- Trial_division sameAs m.02pv3g.
- Trial_division sameAs Q1333681.
- Trial_division sameAs Q1333681.
- Trial_division sameAs Trial_division.
- Trial_division wasDerivedFrom Trial_division?oldid=604979078.
- Trial_division isPrimaryTopicOf Trial_division.