Each . in the mileage table above represents an entry indicating the distance between a pair of the five cities. If the table were extended to represent the distances between all pairs of 30 cities and each distance were to be represented by only one entry, how many entries would the table then have?
(A) 60
(B) 435
(C) 450
(D) 465
(E) 900
Can someone shed some light on this problem?
Thanks
(A) 60
(B) 435
(C) 450
(D) 465
(E) 900
Can someone shed some light on this problem?
Thanks
You do not have the required permissions to view the files attached to this post.













