The Three Gap Theorem (Steinhauss Conjecture)
| dc.creator | Mayero, Micaela | |
| dc.date | 2006-09-22 | |
| dc.date.accessioned | 2026-07-07T07:23:56Z | |
| dc.date.available | 2026-07-07T07:23:56Z | |
| dc.description | We deal with the distribution of N points placed consecutively around the circle by a fixed angle of a. From the proof of Tony van Ravenstein, we propose a detailed proof of the Steinhaus conjecture whose result is the following: the N points partition the circle into gaps of at most three different lengths. We study the mathematical notions required for the proof of this theorem revealed during a formal proof carried out in Coq. | |
| dc.identifier | https://arxiv.org/abs/cs/0609124 | |
| dc.identifier | http://arxiv.org/abs/cs/0609124 | |
| dc.identifier | Types for Proofs and Programs: International Workshop, TYPES'99, Lökeberg, Sweden, June 1999. Selected Papers (2000) 162 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116168 | |
| dc.subject | Logic in Computer Science | |
| dc.title | The Three Gap Theorem (Steinhauss Conjecture) | |
| dc.type | text |