MathDB

In an equilateral triangle of side length 6 , pegs are placed at the vertices and also evenly along each side at a distance of 1 from each other. Four distinct pegs are chosen from the 15 interior pegs on the sides (that is, the chosen ones are not vertices of the triangle) and each peg is joined to the respective opposite vertex by a line segment. If

N

denotes the number of ways we can choose the pegs such that the drawn line segments divide the interior of the triangle into exactly nine regions, find the sum of the squares of the digits of

N

Problem Statement