OpenLink Software

About: (math) A theoretical problem in which every nth person, counting around a circle of people, is chosen for execution, and this process repeats after the removal of each chosen person, with the last person left being freed. The problem is to select one's position so as to be the last to be chosen.     Permalink

an Entity references as follows:

Identifier (URI)Rank
nodeID://b97230253
Faceted Search & Find service v1.16.118

Alternative Linked Data Documents: iSPARQL | ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3240 as of Jul 22 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (125 GB total memory, 54 GB memory in use)
Copyright © 2009-2026 OpenLink Software