FACTREEAll subjectsInteresting facts, connected
Mathematics facts
Explore 911 surprising and carefully explained Mathematics facts, then follow their connected ideas.
Cross-Correlation AnalysisCross-correlation analysis measures the similarity between two signals as one is shifted relative to the other. It reveals how much they resemble each other at different time…Cryptography and the RSA Algorithm Based on Prime FactorizationRSA is a public-key cryptosystem whose security rests on the practical difficulty of factoring large composite numbers. This card explains how RSA works—key generation…Curvature and Radius of CurvatureCurvature measures how sharply a curve bends at a point. The radius of curvature is the radius of the circle that best matches the curve at that point. This concept bridges…Curvature and the Theorema Egregium for SurfacesCurvature measures how a surface bends in space. The Theorema Egregium, proved by Gauss in 1827, states that the Gaussian curvature of a surface is intrinsic—it can be…Curvature in Riemannian Geometry and General RelativityThis card explores the concept of curvature, which measures how a space deviates from being flat. From Gauss's intrinsic description of surfaces to Riemann's generalization to…Curvature of Space Curves and the Frenet–Serret FormulasThis card explains how the shape of a curve in three-dimensional space is captured by curvature and torsion, and how the Frenet–Serret formulas describe the motion of a moving…Data DistributionA data distribution describes how the values of a dataset are spread or clustered across possible outcomes. It reveals the frequency of each value, highlighting patterns like…Dedekind Cuts: Constructing the Real Numbers from RationalsDedekind cuts build the real numbers by partitioning the rationals into two sets, with every rational either below or above a cut. Each cut defines a unique real…Descriptive StatisticsDescriptive statistics are essential tools that allow scientists to summarize vast datasets using key measures such as mean, median, mode, and standard deviation. These metrics…Descriptive StatisticsDescriptive statistics are essential tools that summarize and describe data, offering insights into central tendencies, variability, and patterns. By calculating measures like…Descriptive StatisticsDescriptive statistics summarize and describe the main features of a dataset. They provide simple, quantitative measures like mean, median, mode, range, and standard deviation…Design of Experiments: The Role of RandomizationThis card explains how randomization in experimental design ensures that treatment groups are comparable on average and that unmeasured confounding variables are balanced. By…Diagonalization and Self-Reference in Mathematical SystemsDiagonalization is a powerful technique that constructs self-referential statements by arranging a list and modifying the diagonal entries. It reveals that some mathematical…Differentiability of Functions of Several VariablesIn multivariable calculus, differentiability is far stronger than having partial derivatives: it requires a linear approximation that works in every direction. This card builds…Differential Equations and Their Classification by Order and LinearityDifferential equations describe relationships between functions and their derivatives, capturing how quantities change in physics, biology, and engineering. They are classified…Differential Equations for Modeling Population Growth and DecayDifferential equations capture how populations change over time, balancing growth and decay. This card explains the classic exponential model dP/dt = rP, its solution P(t) = P0…Differential Forms and Integration on ManifoldsDifferential forms are mathematical objects that generalize functions and vectors, providing a unified framework for calculus on curved spaces. Integration of forms over…Dijkstra's Algorithm for Shortest Paths in GraphsDijkstra's algorithm finds the shortest path from a source node to all other nodes in a weighted graph with non-negative edge weights. It works by greedily expanding the set of…Diophantine Approximation and Continued FractionsDiophantine approximation asks how closely irrational numbers can be approximated by rationals, and continued fractions provide the best possible approximations. This card…Directed Graphs and Topological SortingA directed graph gives relationships a direction, and when those relationships never loop back, a topological sort produces a linear order where every edge points forward. This…Discrete Fourier Transform (DFT)The Discrete Fourier Transform (DFT) is a mathematical tool that decomposes complex signals into their constituent frequencies, enabling analysis in the frequency domain. By…Discrete Fourier Transform (DFT)The Discrete Fourier Transform (DFT) is a mathematical technique that converts a finite sequence of equally spaced samples into a sequence of complex numbers representing the…Discrete Random VariablesDiscrete random variables are numerical representations of outcomes in events with distinct, separate possibilities, such as rolling a die or flipping a coin. They are defined…Discrete Random VariablesDiscrete random variables represent outcomes from experiments with distinct, countable possibilities, such as flipping a coin or rolling a die. They assign probabilities to…Discrete vs Continuous DistributionsProbability distributions describe how likely different outcomes are. Discrete distributions apply to countable outcomes (e.g., dice rolls), while continuous distributions…Discrete vs Continuous Random VariablesDiscrete and continuous random variables differ in how they represent uncertainty. Discrete variables take distinct, countable values like the number of students, while…Discrete vs. Continuous DistributionsDistributions describe how probabilities are assigned to outcomes. Discrete distributions count distinct, separate outcomes (e.g., dice rolls), while continuous distributions…Divergence and Curl: Interpreting Vector Field Flow and RotationDivergence measures how much a vector field spreads out from a point, while curl measures its local rotation. This card builds intuition for both, explains their mathematical…Divergence Criteria for SeriesDivergence criteria are mathematical rules used to determine whether an infinite series grows without bound or converges to a finite value. These tools analyze the behavior of…Divergent SeriesA divergent series is an infinite sum that does not approach a finite limit. Unlike convergent series, where adding more terms gets closer to a fixed number, a divergent series…Duality in Linear Programming: Primal and Dual RelationshipsDuality is a fundamental principle in linear programming where every optimization problem (the primal) has a paired problem (the dual). This card explains how to construct the…Eigenvalues and Eigenvectors and Their Role in DiagonalizationEigenvalues and eigenvectors reveal the hidden structure of a matrix, showing the directions in which a linear transformation acts as simple scaling. Diagonalization expresses…Eigenvalues and Eigenvectors for Matrix DiagonalizationEigenvalues and eigenvectors reveal a matrix's hidden structure, identifying the directions that remain unchanged under its transformation. When a matrix has enough independent…Eigenvalues and Eigenvectors in Machine Learning AlgorithmsEigenvalues and eigenvectors are mathematical tools that reveal the intrinsic structure of linear transformations. In machine learning, they underpin principal component…Eigenvalues and Eigenvectors in Matrix DiagonalizationMatrix diagonalization uses eigenvalues and eigenvectors to transform a matrix into a simpler diagonal form. This process reveals the core actions of a matrix, such as scaling…Eigenvalues and Eigenvectors of a Matrix in Data ScienceEigenvalues and eigenvectors reveal the intrinsic structure of a matrix, showing which directions are preserved under transformation and how much they stretch or shrink. In…Electoral Systems and the Emergence of Multiparty PoliticsThis card explains how different electoral rules—such as proportional representation and first-past-the-post—shape the number of political parties in a democracy. By…Electoral Systems and Women's Legislative RepresentationThis card examines how the design of electoral systems—particularly proportional representation versus majoritarian systems—shapes the number of women elected to national…Electoral Systems Design and Its Consequences for Minority Political RepresentationElectoral systems—the rules that translate votes into seats—are not neutral technicalities. They shape the number and influence of political parties and the degree to which…Elementary Symmetric Polynomials and Vieta's FormulasElementary symmetric polynomials are the coefficients of a monic polynomial written in terms of its roots. Vieta's formulas express these coefficients directly as sums and…Elliptic Curve Cryptography and the Mathematics of Secure KeysElliptic curve cryptography (ECC) is a modern public-key cryptosystem that uses the algebraic structure of elliptic curves over finite fields to provide security with shorter…Elliptic Curves and the Birch and Swinnerton-Dyer ConjectureElliptic curves are smooth, cubic equations whose rational points form a finitely generated abelian group. The Birch and Swinnerton-Dyer (BSD) conjecture links the rank of this…Elliptic Operators and the Index TheoremElliptic operators are differential operators that are invertible up to compact perturbations and are central to geometry and analysis. The Atiyah–Singer index theorem computes…Empirical Rule (68-95-99.7 Rule)The empirical rule states that for a normal distribution, approximately 68% of data falls within one standard deviation of the mean, 95% within two, and 99.7% within three. It…Empirical Rule (68-95-99.7 Rule)The empirical rule describes how data is distributed in a normal (bell-shaped) curve: about 68% falls within one standard deviation of the mean, 95% within two, and 99.7%…Equations in MathematicsAn equation states that two mathematical expressions are equal, forming the foundation of algebra and problem-solving. By using variables and operations, equations model…Error AnalysisError analysis is the study of uncertainties in measurements and computations. It distinguishes between systematic errors (consistent bias) and random errors (statistical…Error MarginError margin (or margin of error) quantifies the uncertainty in survey or experimental results. It indicates how much the reported value might differ from the true population…Error TermsError terms represent the difference between observed values and predicted values in a statistical model. They capture random noise, measurement errors, and unaccounted…Error Terms in Regression AnalysisIn statistical modeling, an error term represents the difference between observed values and the values predicted by a model. It captures the influence of unmeasured factors…Error VarianceError variance measures the spread or variability in data that cannot be explained by the factors we are studying. It represents random noise, measurement imprecision, or…Error-Correcting Codes: Hamming and Reed–Solomon CodesError-correcting codes add redundancy to data so that transmission errors can be detected and corrected automatically. Hamming codes handle single-bit errors with minimal…Ethnic Fractionalization and the Design of Consociational Power-Sharing ArrangementsEthnic fractionalization measures the probability that two randomly selected individuals belong to different ethnic groups, indicating societal diversity. Consociational…Ethnic Fractionalization and the Risk of Civil ConflictEthnic fractionalization measures the probability that two randomly selected individuals in a country belong to different ethnic groups. This card explores how high…Euclidean and Non-Euclidean Geometry: Parallel Postulate VariationsEuclid's Fifth Postulate, or the parallel postulate, states that through a point not on a line, exactly one parallel line exists. Replacing this postulate with alternatives…Euler Paths and the Seven Bridges of KönigsbergIn 1736, Leonhard Euler solved the puzzle of Königsberg's seven bridges, founding graph theory. He showed that a route crossing each bridge exactly once is impossible because…Euler's Formula and the Unity of Exponential and Trigonometric FunctionsEuler's formula, e^(iθ) = cos θ + i sin θ, reveals a profound connection between exponential growth and circular motion. It shows that complex exponentials encode rotation…Euler's Formula for Polyhedra and Its Role in Graph TheoryEuler's formula for polyhedra states that for any convex polyhedron, vertices minus edges plus faces equals 2. This simple equation is a gateway from geometry to topology and…Euler's Number (e)Euler's number e (~2.71828) is a fundamental mathematical constant that arises from the idea of continuous growth. It is the base of natural logarithms and the unique number…Euler's Number (e)Euler's number (e) is a fundamental mathematical constant approximately equal to 2.71828. It is the base of natural logarithms and arises naturally in processes involving…Euler's Totient Function and Its Cryptographic ApplicationsEuler's totient function φ(n) counts the integers from 1 to n that are coprime to n. This simple count underpins modern cryptography, especially RSA encryption, where it…Euler's Totient Function and Its Role in RSA EncryptionEuler's totient function φ(n) counts integers coprime to n. It's the key that unlocks RSA cryptography, enabling the key generation and mathematical guarantee that decryption…euler_s_formula_and_the_bridge_to_complex_exponentialsEuler's formula e^(iθ) = cos(θ) + i sin(θ) reveals a deep connection between exponential functions and trigonometry, showing that complex exponentials represent rotations in…Eulerian Paths and Circuits: Conditions for Traversable GraphsA graph is traversable if you can trace every edge exactly once. An Eulerian circuit requires all vertices even degree, while an Eulerian trail requires exactly two odd…Eulerian Paths and Hamiltonian Cycles: Two Quest Types in Graph TheoryEulerian paths trace every edge exactly once, while Hamiltonian cycles visit every vertex exactly once. Euler's theorem gives a simple degree condition for the former, but no…Expected ValueExpected value is the long-run average outcome of a random event when repeated many times. It provides a rational basis for decisions under uncertainty, guiding everything from…Expected Value CalculationExpected value calculation is a mathematical method used to determine the average outcome of a random event by multiplying each possible result by its probability and summing…Expected Value FundamentalsExpected value is a statistical tool that predicts the long-term average outcome of uncertain events by weighting each possible result with its probability. It helps assess…Expected Value in ProbabilityExpected value is a mathematical tool that calculates the long-term average outcome of a random event by weighting each possible result by its probability. It plays a crucial…Expected Value in ProbabilityThe expected value is a fundamental concept that allows us to predict the long-term average outcome of random events. It represents the weighted average of all possible…Expected Value of a Random Variable: Beyond the Simple AverageExpected value is a weighted average that accounts for the probability of each outcome, not just the arithmetic mean. This card explains how the expected value is defined for…Exponential DecayExponential decay describes how a quantity decreases over time at a rate proportional to its current value. It's characterized by the quantity halving at regular intervals…Exponential GrowthExponential growth describes a process where a quantity increases by a constant percentage over equal time intervals, leading to a rapid, accelerating rise. It is characterized…Fast Fourier Transform (FFT)The Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform (DFT) and its inverse. It decomposes a signal into its constituent…Fast Fourier Transform (FFT)The Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. It reduces the complexity from O(N²) to O(N log N)…Fast Fourier Transform (FFT)The Fast Fourier Transform (FFT) is an algorithm that computes the Discrete Fourier Transform (DFT) much faster than the naive method. It converts a time-domain signal into its…Fast Fourier Transform (FFT)The Fast Fourier Transform (FFT) is an efficient algorithm that computes the Discrete Fourier Transform (DFT) in O(N log N) time instead of O(N²). It decomposes a signal into…Fast Fourier Transform (FFT)The Fast Fourier Transform (FFT) is an efficient algorithm that computes the Discrete Fourier Transform (DFT) in O(N log N) time instead of O(N²). It decomposes a signal into…Fast Fourier Transform (FFT)The Fast Fourier Transform is an efficient algorithm for computing the Discrete Fourier Transform (DFT) and its inverse. It converts a time-domain signal into its frequency…Federalism and the Diffusion of Policy Innovation Across StatesThis card explains how federal systems—where power is shared between national and state governments—function as natural laboratories for policy experimentation. When a state…Fermat's Little Theorem and Its Use in Primality TestingFermat's Little Theorem states that for a prime number p and any integer a not divisible by p, a^(p–1) ≡ 1 (mod p). This simple fact becomes a powerful tool for primality…Fiber Bundles and the Hopf FibrationA fiber bundle wraps a smaller space around a base space, creating a global structure that locally looks like a simple product. The Hopf fibration shows how a circle can be…Field Extensions and Galois TheoryThis card explains what a field extension is and how Galois theory uses it to study polynomial equations. By associating groups of symmetries with extensions, it reveals when…Finite Automata and the Languages They RecognizeFinite automata are abstract machines with finite memory that read strings and decide whether to accept them. They define the simplest class of languages, the regular…Finite Automata and the Regular Languages They RecognizeFinite automata are abstract machines with finite memory that read strings and decide whether to accept them. They define the simplest class of languages, the regular…Finite Fields and Their Role in Coding TheoryFinite fields are algebraic structures with a finite number of elements where arithmetic behaves like familiar numbers but wraps around. They underpin error-correcting codes…Finite State Machines: The Idea of Finite Memory in ComputationA finite state machine is a simple computational model with a finite number of states that processes a sequence of inputs, transitioning from one state to another based on the…Fisher Information and the Cramér-Rao Lower Bound for Unbiased EstimatorsFisher information measures how much a probability distribution reveals about an unknown parameter from a single observation. The Cramér-Rao lower bound uses this to set a…Fixed EffectsFixed effects is a statistical method used in panel data analysis to control for unobserved, time-invariant characteristics of entities (e.g., individuals, firms, countries).…Fixed Effects (in Panel Data)Fixed effects is a statistical method for analyzing panel data—repeated observations of the same units over time. It controls for all time-invariant differences between units…Fixed-Point Iteration and Convergence in Numerical AnalysisFixed-point iteration is a method for finding solutions to equations by repeatedly applying a function until the output stabilizes. It underpins many numerical algorithms and…Fluid Dynamics and the Navier–Stokes EquationsFluid dynamics studies how liquids and gases move, and the Navier–Stokes equations are its central mathematical model. These nonlinear partial differential equations express…Formal Power Series and Their Role in CombinatoricsFormal power series are infinite algebraic expressions treated as formal objects, ignoring convergence. In combinatorics, they encode sequences as coefficients, turning…Formal Proofs and Hilbert's ProgramThis card explains the notion of a formal proof—a sequence of formulas derived from axioms using fixed inference rules—and David Hilbert's program to secure the foundations of…Fourier AnalysisFourier Analysis is a mathematical framework that decomposes complex signals into simple sine and cosine waves. It reveals the frequency components hidden within any periodic…Fourier SeriesA Fourier series is a way to represent a periodic function as a sum of simple sine and cosine waves. By combining these fundamental building blocks with different frequencies…Fourier Series and the Representation of Periodic FunctionsFourier series express any periodic function as an infinite sum of sine and cosine waves of integer frequencies. This card explains how such a decomposition is possible, how…Fourier Series for Representing Periodic Functions Beyond Sines and CosinesFourier series are typically introduced as sums of sines and cosines, but that is just one convenient basis. This card explores how any periodic function can be represented…Fourier Series for Solving Heat EquationsThe heat equation describes how temperature spreads through a material. Fourier discovered that any initial temperature distribution can be represented as a sum of sine and…Fourier Series: Decomposing Periodic Functions into HarmonicsFourier series express a periodic function as an infinite sum of sine and cosine waves. This card explains how any periodic signal can be decomposed into fundamental and…