Let x and y be two positive real numbers with < y. Consider a traveler, on the interval [0, y/2], departing from 0 taking steps of length equal to x. Every time step reaches an endpoint interval, traveler rebounds off in order complete length. We show that footprints are output full Euclidean algorithm for y, whenever y/x is rational number. In case irrational, is, theoretically, not finite; ho...

With the development of cities, urban congestion is nearly an unavoidable problem for almost every large-scale city. Road planning effective means to alleviate congestion, which a classical non-deterministic polynomial time (NP) hard problem, and has become important research hotspot in recent years. A K-means clustering algorithm iterative analysis that been regarded as solve road problems by ...