TCS
Company
Logical Reasoning
Mathematical Reasoning
Consider an equilateral triangle of side length n, which is divided into unit triangles, as
shown. Let f(n) be the number of paths from the triangle in the top row to the middle
triangle in the bottom row, such that adjacent triangles in our path share a common
edge and the path never travels up (from lower row to a higher row) or revisits a
triangle. An example of one such path is illustrated below for n = 5. Determine the
value of f(2005)
Read Solution (Total 6)
-
- f(n) = (n − 1)!
- 11 years agoHelpfull: Yes(5) No(6)
- rajesh.chaparala@gmail.com
- 11 years agoHelpfull: Yes(0) No(10)
- hello_tanmoy@hotmail.com
- 11 years agoHelpfull: Yes(0) No(5)
- f(n)=(n-1)!
i.e. (2004)!
- 9 years agoHelpfull: Yes(0) No(3)
- can anyone explain it
- 8 years agoHelpfull: Yes(0) No(0)
- f(n)= (n-1)1
therfore for f(2005)= 2004! - 5 years agoHelpfull: Yes(0) No(0)
TCS Other Question