DBpedia – Linked Data Fragments

DBpedia 2016-04

Query DBpedia 2016-04 by triple pattern

Matches in DBpedia 2016-04 for { ?s ?p "In number theory, a positive integer k is said to be an Erdős–Woods number if it has the following property:there exists a positive integer a such that in the sequence (a, a + 1, …, a + k) of consecutive integers, each of the elements has a non-trivial common factor with one of the endpoints."@en }

Showing triples 1 to 2 of 2 with 100 triples per page.