// all the ellipses sizes.
func getDivisibleSize(totalSizes []uint64) (result uint64) {
	gcd := func(x, y uint64) uint64 {
		for y != 0 {
			x, y = y, x%y
		}
		return x
	}
	result = totalSizes[0]
	for i := 1; i < len(totalSizes); i++ {
		result = gcd(result, totalSizes[i])
	}
	return result
}

// isValidSetSize - checks whether given count is a valid set size for erasure coding.

    //     moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,
    //     then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles
    //     in all.
    // (3) "Successive". We can consider that we are exchanging a block of size d (a[0..d-1]) with a
    //     block of size n-d (a[d..n-1]), where in general these blocks have different sizes. If we

pkg math/big, method (*Int) DivMod(*Int, *Int, *Int) (*Int, *Int)
pkg math/big, method (*Int) Exp(*Int, *Int, *Int) *Int
pkg math/big, method (*Int) Format(fmt.State, int32)
pkg math/big, method (*Int) GCD(*Int, *Int, *Int, *Int) *Int
pkg math/big, method (*Int) GobDecode([]uint8) error
pkg math/big, method (*Int) GobEncode() ([]uint8, error)
pkg math/big, method (*Int) Int64() int64