There are 25 horses and you want to find the fastest 3 among them. You can race any 5 of the horses against each other and see the final standing, but not the running times. If all the horses have constant, permanent speeds, how many races do you need to organize in order to find the fastest 3?

Let us label the horses H1, H2, H3, H4, …, H24, H25.

We race H1 – H5 and (without loss of generality) find that H1 > H2 > H3 > H4 > H5. We conclude that H4, H5 are not among the fastest 3.

We race H6 – H10 and (without loss of generality) find that H6 > H7 > H8 > H9 > H10. We conclude that H9, H10 are not among the fastest 3.

We race H11 – H15 and (without loss of generality) find that H11 > H12 > H13 > H14 > H15. We conclude that H14, H15 are not among the fastest 3.

We race H16 – H20 and (without loss of generality) find that H16 > H17 > H18 > H19 > H20. We conclude that H19, H20 are not among the fastest 3.

We race H21 – H25 and (without loss of generality) find that H21 > H22 > H23 > H24 > H25. We conclude that H24, H25 are not among the fastest 3.

We race H1, H6, H11, H16, H21 and (without loss of generality) find that H1 > H6 > H11 > H16 > H21. We conclude that H16, H21 are not among the fastest 3.

Now we know that H1 is the fastest horse and only H2, H3, H6, H7, H11 could complete the fastest three. We race them against each other and find which are the fastest two among them. We complete the task with only 7 races in total.