In Brilliant Rail Road system there were a number of stations which all were connected among each other until more than one additional stations were created. If all the stations are now connected among each other and 17 types of new tickets had to be printed, how many stations were there before the new stations were created? Assume that tickets from station A to station B, from station B to station A, and their respective roundtrip tickets are considered as one type of ticket.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let's n to be the number of stations before the new stations were created. The number of tickets before the new stations were created, N b , is
(1) N b = ( 2 n ) = 2 n ( n − 1 )
Let's a to be the additional number of stations created, so the final number of total tickets, N a , is
(2) N a = ( 2 n + a ) = 2 ( n + a ) ( n + a − 1 )
Therefore
(3) N a − N b = 2 ( n + a ) ( n + a − 1 ) − 2 n ( n − 1 ) = 2 n 2 + 2 a n + a 2 − n − a − n 2 + n = 2 2 n a + a 2 − a = 2 a ( 2 n + a − 1 ) = 1 7 ⇒ a ( 2 n + a − 1 ) = 3 4
Now we know that
a > 1
3 4 = 2 × 1 7 , which are prime factors.
2n + a - 1 > a
Therefore
(4) a = 2
(5) 2n + a - 1 = 17
inserting (4) inside (5) we get n = 8