Username:      Password:        
New User   Forgot?


No: 01       November 04, 2020



You will make a travel through the edges of two tetrahedrons (ABCD, and CDEF) joined as shown in the figure.

-You will start at A, and finish at F.
-You can visit the vertices more than once except the finishing vertex F.
-You cannot pass through the edges more than once.

In how many ways can this travel be done?

Note: Two travels having same edges in different order will be considered as different.

[ You need to be a member of this site
before you can submit an answer ]

Today's Bonus: 0 point
Popularity: 62.5 %     Difficulty: 37.5 %    

Home | About | Rules | Archive | Scoreboard | Links

© 2004-2020 HALICI Informatics and Software Co.