Combinatorics · Counting paths · Binary words · Graph trails
Two roads run from Novi Sad to Belgrade, an old one and a new one, and they are joined by \(7\) connecting roads. In how many different ways can one travel from Novi Sad to Belgrade along these roads, if in each journey every piece of road is travelled at most once?
Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.
Serbian Regional Competition (Okruzno takmicenje) 2006, high school grade I, category A, problem 3. Organized by the Mathematical Society of Serbia (DMS). Source