Skip to content
Get started

Round trips on a fully linked network

Five servers are all directly linked to one another (every pair is connected). A packet starts at server A and makes exactly 66 hops; each hop moves it along a link to a different server.

How many of the possible 66-hop routes end back at A?

Show hints (3)+
  1. Routes of length kk from ii to jj are the entries of AkA^k.
  2. A=J−IA = J - I: what are the eigenvalues of the all-ones matrix JJ?
  3. All servers look alike, so each diagonal entry of A6A^6 is tr⁡(A6)/5\operatorname{tr}(A^6)/5.

Answer

Reveal answer →

820

Create a free account to see the full worked solution and track your progress.

Interview format: Trading Aptitude Tests, Prop Trading

Related questions