The number of tickets that are printed for going from any one stop to another stop on the route is .

256

No worries! We‘ve got your back. Try BYJU‘S free classes today!

272

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

255

No worries! We‘ve got your back. Try BYJU‘S free classes today!

289

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B 272
Number of stops between City A and City B = 17

If a person rides from Stop 1, then the person will get off at any one of the remaining 16 stops.

This can continue for all the numbers from 1 to 17; however, he cannot get off from the station he boarded.

So, the number of tickets to be printed
$=^{17} P_{2} = \frac{17!}{(17 - 2)!} = \frac{17!}{15!} = \frac{17 \times 16 \times 15!}{15!}$
$= 17 \times 16$
$= 272$

Suggest Corrections

Similar questions

Q. There are

15

stations on a Railway line. How many tickets of different station should be printed so that a passenger can buy a ticket of any station from another?

Q. There are 10 railway stations between a station x and another station y.

Find the number of different tickets that must be printed so as to enable a passenger to travel from any one station to any other.

Q. On a railway route there are 15 stations. The number of different kinds of

Π^{n d}

class tickets requiton in order that it may be possible to book a passenger from one station to another is

There are $15$ stations on a certain railway line. How many different types of tickets must be printed so that a passenger can travel from one station to another in that line $?$

Q. If there are

10

stations on a route and the train has to be stopped at

4

them, then the number of ways in which the train can be stopped so that atleast two stopping stations are consecutive is :

Join BYJU'S Learning Program