We call an integer sided triangle -pandigital if it contains one angle of degrees and, when the sides of the triangle are written in base , together they use all digits of that base exactly once.
For example, the triangle is -pandigital because it contains one angle of degrees and the sides written in base are using each of the digits of that base once.
Find the sum of the largest sides of all -pandigital triangles with .
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.