Authors: Patrick A Devlin
In number theory, and especially the study of the diophantine approximation, the Lonely Runner Conjecture is a conjecture with important and widespread applications in mathematics. This paper attempts to prove the conjecture for any n runners in the special case of integers with particularly correlated prime factors.
Comments: 5 Pages.
Unique-IP document downloads: 359 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.