MathDB

Circle

\omega_1

of radius

1

and circle

\omega_2

of radius

2

are concentric. Godzilla inscribes square

CASH

\omega_1

and regular pentagon

MONEY

\omega_2

. It then writes down all 20 (not necessarily distinct) distances between a vertex of

CASH

and a vertex of

MONEY

and multiplies them all together. What is the maximum possible value of his result?

Problem Statement