You're welcome.

Oh, ok. Thanks. I'll try to think about it)
P.S. nice kata)

You should take each square with its all adjacent squares or rectangles to form the resulting true rectangles list.

The pink and the blue squares aren't adjacent, you can't replace one of them with the yellow one and form another rectangle.

I have a question. Looking at the example with 22 * 6, I still can not understand why the answer is (12 * 6) (12 * 6), but only 2 times. If you can also connect the blue and pink squares. Or why 16 * 6 only once, if the yellow and pink square can be replaced by blue. I think that the correct answer should be ['(4 * 2)', '(12 * 6)', '(12 * 6)', '(12 * 6)', '(6 * 4)', '(18 * 6) ',' (10 * 6) ',' (10 * 6) ',' (10 * 6) ',' (16 * 6) ',' (16 * 6) ',' (16 * 6 ) ',' (22 * 6) ']
can you explain to me why I'm wrong?

You have there the triple [45, 108, 117], is pythagorean but not primitive, a, b, c are divisible by 3

My program found:
[{'number triples below-eq 888': 156}, {'max perimeter': 2106}, {'largest triple': [(585, 648, 873)]}]

Hi! I need some help. I am trying to solve this kata, but my program finds 25 PPT when c_max = 150:

{
'3,4,5': [3, 4, 5],
'5,12,13': [5, 12, 13],
'15,8,17': [15, 8, 17],
'7,24,25': [7, 24, 25],
'21,20,29': [21, 20, 29],
'9,40,41': [9, 40, 41],
'35,12,37': [35, 12, 37],
'11,60,61': [11, 60, 61],
'45,28,53': [45, 28, 53],
'33,56,65': [33, 56, 65],
'13,84,85': [13, 84, 85],
'63,16,65': [63, 16, 65],
'55,48,73': [55, 48, 73],
'39,80,89': [39, 80, 89],
'15,112,113': [15, 112, 113],
'77,36,85': [77, 36, 85],
'65,72,97': [65, 72, 97],
'45,108,117': [45, 108, 117],
'17,144,145': [17, 144, 145],
'99,20,101': [99, 20, 101],
'91,60,109': [91, 60, 109],
'51,140,149': [51, 140, 149],
'117,44,125': [117, 44, 125],
'105,88,137': [105, 88, 137],
'143,24,145': [143, 24, 145]
}

Some idea?