About: dbpedia:Stern–Brocot_tree   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : platform.yourdatastories.eu:8890 associated with source document(s)

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).

AttributesValues
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
  • External Image
thumbnail
is known for of
Faceted Search & Find service v1.13.91 as of Nov 14 2017


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3212 as of Mar 29 2016, on Linux (x86_64-unknown-linux-gnu), Single-Server Edition (68 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2026 OpenLink Software