Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Lonely Runner Conjecture
CHF 56.30
Auf Lager
SKU
NBATOILR86B
1 Verfügbar 
Geliefert zwischen Fr., 13.02.2026 und Mo., 16.02.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, and especially the study of diophantine approximation, the lonely runner conjecture is a conjecture originally due to J. M. Wills in 1967. Applications of the conjecture are widespread in mathematics; they include view obstruction problems and calculating the chromatic number of distance graphs and circulant graphs. The conjecture was given its picturesque name by L. Goddyn in 1998.Consider k + 1 runners on a circular track of unit length. At t = 0, all runners are at the same position and start to run; the runners'' speeds are pairwise distinct. A runner is said to be lonely if she is at distance of at least 1/(k + 1) from each other runner. The lonely runner conjecture states that every runner gets lonely at some time.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131310669
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B8mm x T150mm
- EAN 9786131310669
- Format Fachbuch
- Titel Lonely Runner Conjecture
- Gewicht 188g
- Herausgeber Betascript Publishing
- Anzahl Seiten 128
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
