Rational Numbers

Euclid's theorem states there are infinitely many prime numbers. The classic proof is by contradiction. It assumes a finite list of all primes \(p_1, p_2, \dots, p_n\). It then considers the number \(P = p_1 p_2 \cdots p_n + 1\). This number \(P\) is either prime or not. If it's prime, it's a new prime not on the list.

A partial differential equation (PDE) is an equation that imposes relations between the various partial derivatives of a multivariable function. The function is often called the unknown, and a PDE describes a relationship between this unknown function and its derivatives. Unlike ordinary differential equations (ODEs), which involve functions of a single variable, PDEs are fundamental to modeling multidimensional systems.

A technique for solving first-order and hyperbolic second-order partial differential equations (PDE). The method reduces a PDE to a family of ordinary differential equations (ODEs) along specific curves called 'characteristics'. Along these curves, the PDE simplifies, allowing the solution to be found by integrating the system of ODEs. It is particularly powerful for problems involving transport and wave propagation.

A direct corollary of the fundamental theorem of algebra is that any non-constant polynomial with real coefficients can be factored into a product of linear factors and irreducible quadratic factors, all with real coefficients. The linear factors correspond to the real roots, while the irreducible quadratic factors correspond to pairs of complex conjugate roots \(a \pm bi\).

A transcendental number is a real or complex number that is not algebraic, meaning it is not a root of any non-zero polynomial equation with integer (or rational) coefficients. All transcendental numbers are irrational, but not all irrational numbers are transcendental (e.g., \(\sqrt{2}\) is irrational but algebraic, as it is a root of \(x^2 - 2 = 0\)).

Despite being dense, meaning between any two distinct rational numbers there is another, the set of all rational numbers \(\mathbb{Q}\) is countably infinite. This means that all rational numbers can be put into a one-to-one correspondence with the natural numbers \(\mathbb{N} = \{1, 2, 3, ...\}\). This surprising result demonstrates that \(\mathbb{Q}\) has the same cardinality as \(\mathbb{N}\) and \(\mathbb{Z}\).

A key result in number theory stating that if a prime number \(p\) divides the product of two integers \(a\) and \(b\), then \(p\) must divide at least one of those integers. That is, if \(p | ab\), then \(p | a\) or \(p | b\). This property is essential for proving the uniqueness part of the Fundamental Theorem of Arithmetic.

An irrational number is any real number that cannot be expressed as a ratio of two integers, \(p/q\), where \(p\) is an integer and \(q\) is a non-zero integer. In other words, they are real numbers that are not rational. Their decimal representation never terminates and never enters a permanently repeating pattern.

A real number is rational if and only if its decimal representation is periodic. This means the sequence of digits eventually repeats a finite sequence of digits indefinitely. This repeating part is called the repetend. For example, \(1/3 = 0.333...\) (repetend is '3') and \(3/7 = 0.428571428571...\) (repetend is '428571'). Terminating decimals are a special case where the repetend is '0'.

Bézout's theorem is a fundamental statement in intersection theory. It asserts that the number of intersection points of two plane algebraic curves of degrees \(m\) and \(n\) is exactly \(mn\), provided that one works in a projective plane over an algebraically closed field, counts points with multiplicity, and includes points at infinity where parallel asymptotes meet.

The fundamental theorem of algebra states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This guarantees that the field of complex numbers is algebraically closed, meaning polynomial equations that cannot be solved in real numbers can be solved in complex numbers. For a polynomial \(p(z) = a_n z^n + \dots + a_1 z + a_0\), there exists a \(z_0 in \mathbb{C}\) such that \(p(z_0) = 0\).

This theorem states that every integer greater than 1 is either a prime number or can be uniquely represented as a product of prime numbers, disregarding the order of the factors. For example, \(1200 = 2^4 \times 3^1 \times 5^2\). This unique factorization is a cornerstone of number theory, providing a fundamental multiplicative structure for the integers.

The canonical representation, or standard form, of a positive integer \(n\) is its unique prime factorization written as a product of prime powers with the primes in increasing order. For any integer \(n > 1\), it can be written as \(n = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}\), where \(p_1 < p_2 < \cdots < p_k\) are prime numbers and the exponents \(a_i\) are positive integers.

A fundamental existence and uniqueness theorem for partial differential equations associated with Cauchy initial value problems. It states that if the PDE and the initial conditions are 'analytic' (can be represented by convergent power series), then a unique analytic solution exists in a neighborhood of the initial surface. It provides a local existence guarantee but does not address global behavior or well-posedness.