Number Theory


A Special Case of the Lonely Runner Conjecture for any n

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.

Download: PDF

Submission history

[v1] 2012-10-21 02:45:00
[v2] 2012-10-21 10:17:43
[v3] 2012-10-21 17:08:12
[v4] 2012-10-24 03:04:41
[v5] 2012-10-25 09:56:10

Unique-IP document downloads: 381 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

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.

comments powered by Disqus