Collection of Maths Problems

Mathematics

Mathematics

Combinatorics

Linear algebra
Mathematical analysis
Combinatorics

Hadamard codes

Task number: 4034

Verify that the Hadamard codes generated by Sylvester’s construction are linear.

Hint
Check the closure w.r.t. the addition.

Difficulty level: Easy task (using definitions and simple reasoning)

Proving or derivation task

Cs translation

Send comment on task by email

About

Show task

Tasksfilter

Properties of sets (6)
- Subset (L2)
- Validity of identities (L1)
- Symmetric difference (L1)
- Sets of subsets (L1)
- Sets from intersection and union (L2)
- Sets obtainable using three operations (L2)
Mathematical induction (15)
- Divisibility (L1)
- Dividing the plane (L1)
- De Moivre’s formula (L1)
- Sums (L1)
- Sum with an exponential term (L1)
- Sum of binomial numbers (L1)
- Fibonacci sequence (L1)
- Fibonacci sequence squared (L2)
- Zeros and ones (L1)
- Fibonacci expansion (L2)
- Tiling a chessboard (L1)
- An integral expression (L2)
- Even and odd subsets (L1)
- Plus and minus (L2)
- Prime factorization (L1)
Relations (13)
- Verifying properties of relations (L1)
- Number of relations (L1)
- Closure of reflexivity (L1)
- Closure of transitivity (L1)
- Closure of symmetry (L1)
- Iniheritance of antisymmetry (L1)
- Transitivity I (L2)
- Transitivity II (L2)
- Comparing finite sets (L1)
- Mapping between infinite sets (L1)
- Definition of a bijection (L1)
- Bijection (L1)
- Reachability in a directed graph (L2)
Equivalence (3)
- Three concrete equivalences (L1)
- Number of equivalence relations (L1)
- Reachability in an undirected graph (L1)
Partial order (6)
- The number of order relations (L1)
- Ordering by divisibility (L1)
- Orders of pairs (L1)
- The largest and maximal elements (L1)
- Existence of maximal and largest elements (L1)
- Chains and antichains from Hasse diagram (L1)
Combinatorial counting (15)
- Embedded subsets (L1)
- Chess kings (L1)
- Pairs game (L1)
- Choice from a set of objects (L1)
- Placing balls (L2)
- Manhattan (L1)
- Mississippi (L1)
- Sprites and witches (L2)
- Color printing (L2)
- Number of triangulations (L2)
- Number of parenthesizations (L3)
- Length of a conference (L2)
- Seatings at tables (L2)
- Crossing chords (L3)
- Sum decompositions (L1)
Factorial and binomial coefficients (12)
- Factorial estimate (L1)
- Divisibility of the factorial of 50 (L1)
- Factorial divisibility (L2)
- Comparison of binomial coefficients (L2)
- Sums of binomial coefficients (L1)
- Estimation of the middle combination number (L1)
- Estimate of a combination number by another (L1)
- Estimation of the exponential function around zero (L1)
- Factorial estimate (L1)
- Series with binomial coefficients (L3)
- Estimation of the sum of the series (L1)
- Harmonic number (L2)
Inclusion-exclusion principle (9)
- Construction workers (L1)
- Sieve of Eratosthenes (L1)
- Numbers not divisible by 6, 10 or 14 (L1)
- Prime-looking numbers (L1)
- Ball (L1)
- Nationalities (L2)
- Words without subwords (L2)
- Stones on a chessboard (L2)
- Seven dinners (L3)
Discrete probability (19)
- Three dice (L1)
- Rings in soup (L1)
- Choosing balls (L1)
- Same birthdays (L1)
- Two assertions about dice (L1)
- Toy train (L2)
- Rings in soup II (L1)
- Independence in rolling dice (L1)
- Rolling dice and conditional probability (L1)
- Monty Hall problem (L3)
- Permutation - independent events (L1)
- Number of fixed points in a random permuation (L1)
- Consecutive ones (L1)
- Flipping coins (L1)
- Light bulbs (L1)
- Game with dice (L3)
- Variance of a uniform distribution (L1)
- Variance of a sum of variables (L1)
- Estimate using Chebyshev´s inequality (L2)
Introduction to graph theory (18)
- Isomorphism between two concrete graphs (L1)
- Non-isomorphic graphs (L1)
- Graphs with four vertices (L1)
- Sizes of graph classes (L1)
- Complement of a bipartite graph (L1)
- Isomorphism of complements (L1)
- Equivalence by isomorphism (L1)
- Exact number of automorphisms (L3)
- Forbidden subgraphs (L2)
- Forbidden induced path (L1)
- Common vertex on longest path (L2)
- Induced cycle (L1)
- Bipartite subgraph (L2)
- The number of edges disconnected graphs (L1)
- Connectivity algorithm (L1)
- Connected graph reduction (L1)
- The existence of a source and sink (L1)
- Number of acyclic orientations (L2)
Adjacency matrices (2)
- The diagonal of the third power (L1)
- The sum the adjacency matrix (L1)
Vertex degrees, Eulerian graphs (13)
- Graph by score (L1)
- Identical scores (L1)
- Graphs with even degrees (L1)
- Regular graph (L1)
- Construction of regular graphs (L2)
- Balanced orientation (L1)
- Eulerian graph and union of cycles (L1)
- Graphs with open Eulerian trails (L1)
- Decomposition into two k-factors (L2)
- The sprinkler truck problem (L2)
- The number of matchings (L1)
- Oriented Eulerian graphs (L1)
- Evenness of line graphs (L1)
Trees and spanning trees (11)
- Equivalent definition of tree (L1)
- Ordering of vertices (L1)
- Score of a tree (L1)
- The number of leaves (L1)
- Independent set (L1)
- Existence od a spanning tree (L1)
- Bridges in a spanning tree (L1)
- Two spanning trees (L1)
- Graphs with few cycles (L1)
- Graph with n spanning trees (L1)
- Tree complements (L1)
Algorithms for trees (8)
- Uniqueness of the minimum spanning tree (L1)
- Minimal spanning tree (L1)
- Negative weights (L1)
- The number of non-isomorphic trees (L1)
- Possibilities for the graph center (L2)
- Tree codes (L2)
- Prüfer codes (L1)
- Prüfer codes and palindroms (L2)
Connectivity and network flows (17)
- Connectivity of particular graphs (L1)
- Connectivity of planar graphs (L1)
- Edge versus vertex connectivity (L2)
- Graph operations (L2)
- Cubic graphs (L2)
- Dense graph (L2)
- Vertices on a common cycle (L1)
- Edges on a common cycle (L2)
- Claims about common cycles (L1)
- One-way street problem (L1)
- Spanning trees of 2-connected graphs (L1)
- Fan theorem (L2)
- Long cycle (L3)
- Cycle in a k-connected graph (L3)
- Fold-Fullkerson’s theorem for vertices (L2)
- Network flow (L1)
- Network flow in a grid (L1)
Shortest paths (5)
- Dijkstra’s Algorithm (L1)
- Negative edges (L2)
- Oriented graphs (L1)
- Vertex weights (L2)
- Bottleneck problem (L2)
Planar graphs (12)
- Particular graph (L1)
- Petersen graph is not planar (L1)
- Nonplanarity of a complete graph (L1)
- Maximal number of faces (L1)
- Complete bipartite graphs (L1)
- Single stroke drawing (L1)
- Planar cubic graphs given by faces (L2)
- Nash-Wiliams theorem (L3)
- Platonic solids (L1)
- Dual graph characterization (L1)
- The number of faces (L1)
- Faces in a planar drawing (L1)
Graphs on surfaces (8)
- Drawing of K5 and K3,3 (L1)
- Petersen graph (L1)
- Different drawings of K5 on torus (L2)
- Complete graphs in the projective plane (L1)
- Complete graph on the torus (L1)
- Quadrangular faces (L3)
- Critical nonplanar and edge replacement (L1)
- Outerplanar graphs (L2)
Graph coloring (9)
- Edge connectivity of a critical graph (L1)
- Four color theorem (L1)
- Bipartite are Vizing class I (L1)
- Outerplanar graphs (L2)
- Chromatic index of complete graph (L2)
- Dual coloring (L2)
- Cubic graphs of Vizing class II (L2)
- Graph nonexistence (L2)
- Chromatic index of planar cubic graphs (L3)
Tutte polynomial (4)
- Tutte polynomial of a cycle (L1)
- Tutte polynomial of a multiedge (L1)
- Dual of a planar graph (L1)
- Total cyclic orientations (L3)
Matching (9)
- Two edges in matching (L1)
- Two unmatchable edges (L1)
- Edge omission in cubic graph (L3)
- Prescribed edge in cubic graph (L3)
- Two edges omitted in cubic graph (L2)
- 2-factorization of 2k-regular graph (L2)
- k-regular edge k-connected graph (L1)
- k-regular edge (k-1)-connected graph (L1)
- k-regular edge (k-2)-connected graph (L2)
Circulations and cycle spaces (5)
- Cyklomatic nunber of the grid (L1)
- Cycles in complete bipartite graph (L1)
- Cycles in the complete graph (L1)
- Space with symmetric difference (L1)
- Eulerian sets (L3)
Generating functions (14)
- Word problems (L1)
- Fruit basket (L1)
- Term adjustment (L1)
- Generating functions for given sequences (L1)
- Partial sums (L1)
- Coefficients (L1)
- Sums of series (L2)
- Dice roll (L2)
- Non-standard fair dice (L3)
- Linear recurrences (L2)
- The limit of averages (L1)
- Recurrence with a square root (L1)
- Triangulations of an n-gon (L2)
- Rectangle tiling (L2)
Finite projective planes (12)
- Trivial finite projective planes (L1)
- Alternative axiomatization I (L2)
- Spot It / Dobble (L2)
- Minimal cover (L2)
- Alternative axiomatization II (L3)
- Axiomatization only by cardinality (L1)
- General position (L2)
- Graphs without four-cycle (L1)
- Graphs of projective planes (L2)
- Two lines of a Latin square (L1)
- Orthogonality of ordinary squares (L1)
- Magic squares (L1)
Double counting (8)
- Number of vertices of a planar graph (L1)
- Summer camp (L1)
- Counting with majority I (L2)
- Counting with majority II (L2)
- Matrix filling (L2)
- Square coloring (L3)
- Maximal antichain with prescribed elements (L2)
- Number of spanning trees (L2)
Systems of distinct representatives (14)
- Sets of n-1 elements (L1)
- The number of SDR of (n-1)-element sets (L1)
- Goban stones (L1)
- Deficit Hall theorem (L2)
- Goban stones II (L2)
- Vertex cover in bipartite graph (L2)
- Perfect matchings of complete graph (L1)
- k-regular bipartite graph (L1)
- Bipartite graph with big degrees (L2)
- Generalized Latin squares (L2)
- (3,3)-SAT (L2)
- Orientation of sparse graph (L2)
- Matching in an inclusion graph (L2)
- Point coloring (L3)
Ramsey theory (12)
- Ramsey theorem for 2-colored graph (L1)
- Ramsey theorem for vertices (L1)
- Two-colored graph (L1)
- Triangle on six vertices (L1)
- Variants of Ramsey theorem (L1)
- Rocks on the chessboard (L2)
- Triangle and 4-cycle (L2)
- Points in the plane (L1)
- Plane coloring (L2)
- Hamiltonian cycle (L2)
- Grid points (L3)
- Monotone subsequences (L3)
Self-correcting codes (7)
- Metric (L1)
- Parity bit (L1)
- Dimensions (L1)
- Parameters of a specific code (L1)
- Hadamard codes (L1)
- Self-dual code (L1)
- Hamming code matrix (L1)
Miscellanea (3)
- Breaking a chocolate bar (L2)
- Sets with small intersections (L2)
- Lines in space (L2)
Review (8)
- Relation (L1)
- Partial order (L1)
- Anagrams (L1)
- Inclusion and exclusion (L1)
- Conditional random events (L1)
- Graph score (L1)
- Trees (L1)
- Faces (L1)

Search

Task list filter?

Choose required ranks and required tasks. The table of contents will list only tasks having one of the required ranks in corresponding rankings and at least one of the required tags (overall). If you wish to filter only according to some rankings or tags, leave the other groups empty.

Task rankings

Difficulty levelEasy task (using definitions and simple reasoning)Moderate taskHard task

Task tags

Task typeReasoning taskRoutine calculation trainingProving or derivation taskSolution require uncommon idea Complex taskTask with theoryOpen problem

«

Updated: Sep. 14th, 2020