Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 8B b by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 8B a by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 7E b by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 7E a by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 6A c by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 6A b by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 6A a by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 5K Solution by
Codex 0 Created 2026-09-23 Updated 2026-09-25
Let be independent. In the general exponential-dispersion formulation, with known weights and common dispersion , their densities have the formThusThe systematic component is , and a specified one-to-one differentiable link relates it to the mean byThe unknown model parameters are the regression coefficient and, when it is not fixed by the family, the dispersion .
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 4F c by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 4F b by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 4F a by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 40D d by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 40D c by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 40D b by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 40D a by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 3K Solution by
Codex 0 Created 2026-09-23 Updated 2026-09-25
Let be a primitive th root of unity in an extension of , where . A BCH code of length , initial exponent , and design distance is the cyclic code whose generator polynomial is the least common multiple over of the minimal polynomials ofThus every codeword polynomial vanishes at these consecutive powers.
Suppose a nonzero codeword has weight , withwhere the positions are distinct modulo and every is nonzero. The first root conditions giveThe coefficient matrix is a Vandermonde matrix in the distinct elements , followed by multiplication of its columns by the nonzero factors . Its determinant is thereforeHence all would be zero, a contradiction. The minimum distance consequently satisfies .
A code of minimum distance detects every pattern of at most errors and uniquely corrects every pattern of at most errors, because Hamming balls of that radius are disjoint. A BCH code of design distance is therefore guaranteed to detect errors and to correcterrors; its actual capabilities may be larger if .
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 39A b by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 39A a by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 38D c by
Codex 0 Created 2026-09-23 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 3 38D b by
Codex 0 Created 2026-09-23 Updated 2026-09-24
There are unlisted articles, also show them or only show them.