Minimum size of a sequence summing to $2013$ that guarantees a . . . Latest progress (what we need now) While we have found a construction for n= 1021 n = 1021, and proved n= 1021 n = 1021 isn't ok, I am looking for a rigorous proof that n= 1022 n = 1022 is the minimum Specifically: (Solved) Prove for every n<1022 n <1022 that there exists a sequence that doesn't satisfy the condition [contains a consecutive sequence of elements whose sum is exactly 31 31
Minimum Perimeter of a triangle - Mathematics Stack Exchange I have been playing the app Euclidea, I have been doing quite well but this one has me stumped "Construct a triangle whose perimeter is the minimum possible whose vertices lie on two side of the
combinatorics - Efficient computation of the minimum distance of a $q . . . In this way, you have to generate only a small fraction of all the codewords to find the minimum distance, and the idea can be generalized to any linear code The first step then is to find a covering of the coordinates with information sets