\(0\) to \(10^9+6\)

Let \(G_n\) be an undirected graph of \(n\) rows with the particular triangular structure.

In the figure above is described \(G_3\).

Let \(t_n\) be the minimum number of edges to remove to \(G_n\) to make it bipartite.

What is \(t_{10^9+8} \bmod {(10^9+7)} ?\)

×

Problem Loading...

Note Loading...

Set Loading...