This HTML5 document contains 3 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
dbpedia-owlhttp://dbpedia.org/ontology/
n4http://commons.wikimedia.org/wiki/Special:FilePath/SternBrocotTree.
foafhttp://xmlns.com/foaf/0.1/
n6http://commons.wikimedia.org/wiki/Special:FilePath/SternBrocotTree.svg?width=
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpediahttp://dbpedia.org/resource/
Subject Item
dbpedia:Stern–Brocot_tree
rdfs:comment
In number theory, the Stern–Brocot tree is an infinite complete binary tree in which the vertices correspond one-for-one to the positive rational numbers, whose values are ordered from left to right as in a search tree.The Stern–Brocot tree was discovered independently by Moritz Stern (1858) and Achille Brocot (1861).
foaf:depiction
n4:svg
dbpedia-owl:thumbnail
n6:300