Implement a program to find Primitive Pythagorean Triads.

Eg:

a= 3 b= 4 c= 5
a= 5 b= 12 c= 13
a= 8 b= 15 c= 17
a= 7 b= 24 c= 25
a= 20 b= 21 c= 29
a= 12 b= 35 c= 37
a= 9 b= 40 c= 41

The issue provides example primitive Pythagorean triads but names no file, notebook, input range, output format, or test. First inspect the repository structure and contribution guidance to find the appropriate notebook or program entry point, then clarify the expected bounds and output before implementing. Done means the program generates the requested examples and has a reproducible way to verify its results.

Written by the indexing model from the issue text.