Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2016-05-04 10:24:57

MathsPersonOkay
Member
Registered: 2016-05-04
Posts: 2

Maths Difficult Competition Question

There are many towns on the island of Tetra, all connected by roads. Each town has three roads leading to three other different towns: own red road, one yellow road and one blue road, where no two roads meet other than at towns. If you start from any town and travel along red and yellow roads alternately (RYRY...) you will get back to your starting town after having travelled over six different roads. In fact RYRYRY will always get you back to where you started. In the same way, going along yellow and blue roads alternately will always get you back to the starting point after travelling along six different roads (YBYBYB). On the other hand, going along red and blue roads alternately will always get you back to the starting point after travelling along four different roads (RBRB). How many towns are there on Tetra?

Can anyone please explain this in a detailed manner as this is a struggle for me.  Thank you.

Offline

#2 2016-05-04 18:13:02

thickhead
Member
Registered: 2016-04-16
Posts: 1,086

Re: Maths Difficult Competition Question


{1}Vasudhaiva Kutumakam.{The whole Universe is a family.}
(2)Yatra naaryasthu poojyanthe Ramanthe tatra Devataha
{Gods rejoice at those places where ladies are respected.}

Offline

Board footer

Powered by FluxBB