var ret []pythagorean.Triplet
	set := make(map[pythagorean.Triplet]struct{})
	//https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple
	m := 2

	trp := make(map[pythagorean.Triplet]struct{})
	// https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple

	for c <= max {
		// this method finds the primitive triplets
		for n := 1; n < m; n++ {

	for m := 2; c <= max; m++ {
		for n := 1; n < m && c <= max; n++ {

			// this formula reports triplets like {15, 8, 17} so we have to sort them

			// this formula reports triplets like {15, 8, 17} so we have to swap them

			}
			if b > c {
				b, c = c, b

			for k := 1; ; k++ {

			for k := 1; c*k <= max; k++ {

					set[pythagorean.Triplet{a * k, b * k, c * k}] = struct{}{}
				}
				if c*k > max {
					break

					trp[pythagorean.Triplet{a * k, b * k, c * k}] = struct{}{}

			}
			if c > max {
				break

		m++

	for tr := range set {
		ret = append(ret, tr)

	var triplets []pythagorean.Triplet
	for tr := range trp {
		triplets = append(triplets, tr)

	sort.Slice(ret, func(i, j int) bool { return ret[i][0] < ret[j][0] })
	return ret

	sort.Slice(triplets, func(i, j int) bool { return triplets[i][0] < triplets[j][0] })
	return triplets

	var ret []pythagorean.Triplet

	var triplets []pythagorean.Triplet

			ret = append(ret, candidates[i])

			triplets = append(triplets, candidates[i])

	return ret

	return triplets