PROBLEM: Lone Runner Problem

DESCRIPTION: The lone runner conjecture says that if there are k+1 runners traveling
around a circular track with constant and distinct velocities, there will be a
time when one runner is at least a distance of 1/k+1 from the others runners,
i.e. he is "lonely."
 

INVESTIGATOR: Rahul Bhargava

PAPERS:  lrunner.dvi   lrunner.tex   fig1.eps   fig2.eps

PROGRAMS: lrunner.nb

INVESTIGATOR: George Perez

PAPERS and PROGRAMS: georgejp.tex  georgejp.dvi