Consider n runners R0, R1, ... Rn-1, with distinct constant integer speeds S0, S1, ... Sn-1 respectively, where S0=0, running around the circumference of a circle of unit circumferential length from arbitrary starting points at time t=0. At time t, denote gi(t) be the minimum absolute distance along the circumference of Ri from R0. We first use aresult on prime numbers to obtain special cases of runners speeds, for which the Lonely Runner Conjecture (LRC) is true. We then develop an approach to the LRC that derives a time at which, some subset of the runners is placed at the extremities of arcs of sectors ensuring implicit separation from R0, while the remaining runners are directly separated from R0. We use this approach to show that in the general case for large n, there exists a time T at which, gi(T) > 1/(2n) for all integers i in [1,n-1], and (g1(T) + g2(T) + ... + gn-1(T))/(n-1) tends to 1/n.