Try this beautiful problem from the Pre-RMO, 2017 based on Number of ways.
There are five cities A, B, C, D, E on a certain island. Each city is connected to every other city by road, find numbers of ways can a person starting from city A come back to A after visiting some cities without visiting a city more than once and without taking the same road more than once. (The order in which he visits the cities such as A \(\rightarrow\) B \(\rightarrow\) C \(\rightarrow\) A and A \(\rightarrow\) C \(\rightarrow\) B \(\rightarrow\) A are different).
Number of ways
Integers
Combinatorics
Answer: is 60.
PRMO, 2017, Question 9
Combinatorics by Brualdi
A B C D E in this way orderwise such that from A person can visit B,C return to A in $4 \choose 2$ with 2! ways of approach
from A person visits B, C, D comes back to A in $4 \choose 3$ with 3! ways of approach
from A person visits B, C, D, E comes back to A in $4 \choose 4$ with 4! ways of approach
ways=\({4 \choose 2}(2!)+{4 \choose 3}(3!)+{4 \choose 4}(4!)\)
=12+24+24
=12+48
=60.
In 2025, 8 students from Cheenta Academy cracked the prestigious Regional Math Olympiad. In this post, we will share some of their success stories and learning strategies. The Regional Mathematics Olympiad (RMO) and the Indian National Mathematics Olympiad (INMO) are two most important mathematics contests in India.These two contests are for the students who are […]
Cheenta Academy proudly celebrates the success of 27 current and former students who qualified for the Indian Olympiad Qualifier in Mathematics (IOQM) 2025, advancing to the next stage — RMO. This accomplishment highlights their perseverance and Cheenta’s ongoing mission to nurture mathematical excellence and research-oriented learning.
Cheenta students shine at the Purple Comet Math Meet 2025 organized by Titu Andreescu and Jonathan Kanewith top national and global ranks.
Celebrate the success of Cheenta students in the Stanford Math Tournament. The Unified Vectors team achieved Top 20 in the Team Round.