MathDB
2013-2014 Fall OMO #18

Source:

October 30, 2013
Online Math Open

Problem Statement

Given an n×nn\times n grid of dots, let f(n)f(n) be the largest number of segments between adjacent dots which can be drawn such that (i) at most one segment is drawn between each pair of dots, and (ii) each dot has 11 or 33 segments coming from it. (For example, f(4)=16f(4)=16.) Compute f(2000)f(2000).
Proposed by David Stoner
Back to ProblemsView on AoPS