MathDB

2006 SMT Team Round #12 - Number of k-tuples

Source:

August 22, 2011

Problem Statement

Find the total number of

k

-tuples

(n_1,n_2,...,n_k)

of positive integers so that

n_{i+1}\ge n_i

for each

i

, and

k

regular polygons with numbers of sides

n_1,n_2,...,n_k

respectively will fit into a tesselation at a point. That is, the sum of one interior angle from each of the polygons is

360^{\circ}