0%

Problem 600


Problem 600


Integer sided equiangular hexagons

Let H(n) be the number of distinct integer sided equiangular convex hexagons with perimeter not exceeding n.
Hexagons are distinct if and only if they are not congruent.

You are given H(6)=1, H(12)=10, H(100)=31248.
Find H(55106).

p600-equiangular-hexagons.png

Equiangular hexagons with perimeter not exceeding 12


整数边长等角六边形

H(n)表示周长不超过n的不同整数边长等角凸六边形的数量。
当且仅当两个六边形不全等时视为不同的六边形。

已知H(6)=1,H(12)=10,H(100)=31248。
H(55106)。

p600-equiangular-hexagons.png

边长不超过12的等角六边形


Gitalking ...