Abstract
The view-obstruction problem for then-dimensional cube is equivalent to the conjecture that for anynpositive integersv1,...,vnthere is a real numberxsuch that each vix≥(n+1)-1(here y denotes the distance fromyto the nearest integer). This conjecture has been previously solved forn≤4. In this paper we prove that when 2n-3 is a prime andn≥4 we can find a real numberxwhich gives each vix≥1/(2n-3). In fact more than this is proved.
| Original language | English |
|---|---|
| Pages (from-to) | 126-133 |
| Number of pages | 8 |
| Journal | Journal of Number Theory |
| Volume | 74 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1999 |
Fingerprint
Dive into the research topics of 'The View-Obstruction Problem forn-Dimensional Cubes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver