Skeleton for simplified Pythagorean triplet

PythTriple.cs

var soln = new List<(int a, int b, int c)>();

// Bound for a
// NOTE: this is a first guess, we'll do better later
// a + b + c = N => If all are equal, upper bound is N/3
double aMax = n / 3.0;

for (int a=1; a<aMax; a++)
{

  // Find b,c ...
  
  soln.Add((a, b, c));
}