About: Dividing a circle into areas   Goto Sponge  NotDistinct  Permalink

An Entity of Type : yago:WikicatCircles, within Data Space : dbpedia.org associated with source document(s)

In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides, in such a way as to maximise the number of areas created by the edges and diagonals, has a solution by an inductive method.

AttributesValues
rdf:type
rdfs:label
  • Dividing a circle into areas
rdfs:comment
  • In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides, in such a way as to maximise the number of areas created by the edges and diagonals, has a solution by an inductive method.
sameAs
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
foaf:depiction
  • External Image
foaf:isPrimaryTopicOf
thumbnail
prov:wasDerivedFrom
has abstract
  • In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides, in such a way as to maximise the number of areas created by the edges and diagonals, has a solution by an inductive method.
title
  • Circle Division by Chords
urlname
  • CircleDivisionbyChords
http://purl.org/voc/vrank#hasRank
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git21 as of Mar 09 2019


Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3230 as of Apr 1 2019, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2019 OpenLink Software