Mathematics

Build from number systems and algebra to geometry, functions, and calculus. Then connect linear algebra and proof-based subjects to more advanced topics; numerical answers from individual problems are supporting examples, not separate foundations.

Numbers, Arithmetic, and Algebra

Build from number systems and arithmetic to algebraic expressions and equations.

Mathematical Ideas and Reasoning

• Mathematics — The discipline of numbers, structures, proofs, and abstraction, with major subfields including algebra, geometry, set theory, number theory, and game theory. It is associated with famous examples such as four-leaf roses, lemniscates, and limaçons, and with major philosophical debates over Platonism, intuitionism, and incompleteness. Notable works and figures linked to it include Russell and Whitehead’s Principia Mathematica, Hilbert’s problems, Gödel, Brouwer, and the Quine-Putnam indispensability thesis. Prize culture associated with the field includes the Fields Medal and Abel Prize, and it is also linked with the Erdős number.
  • William Clifford — William Clifford was a mathematician and philosopher whose work anticipated ideas about curved space. He is also the namesake of Clifford algebra and Clifford gates in quantum computing.

Number Systems and Types

• Number Sets and Their Relationships

  • Natural numbers (ℕ) — positive integers 1, 2, 3, … (some definitions include 0); closed under addition and multiplication.

  • Integers (ℤ) — natural numbers plus zero and their negatives; closed under addition, subtraction, and multiplication.
    • Integers — The integers are the whole numbers, their negatives, and zero, usually denoted by Z. They form the unique infinite cyclic group in algebra and are closed under addition, subtraction, and multiplication but not division. They also underlie reduced homology constructions and the quotient R/Z, and appear in basic Diophantine questions and factorization problems.

      • -1 — Negative one is the integer whose square is 1 and whose multiplicative inverse is itself. It is also i squared, so it appears in complex numbers, Euler’s identity e to the i pi, the alternating series test, the sign change from swapping rows in determinants, and opposite-direction conventions in some physical laws and directed versions of results such as Menelaus’s theorem. Its principal square root is i.

      • 1 or one — One is the first positive integer and the multiplicative identity. In mathematics and calculus, it appears in the reciprocal function, in the zeta function at 1, and as the value associated with positive inputs in the Heaviside step function.

      • 11 — Eleven is the two-digit number that follows ten and precedes twelve, and it is the maximum setting on the amplifiers in This Is Spinal Tap. It also names the latest major version of Microsoft Windows.

      • 120 — One hundred twenty degrees is the bond angle of a trigonal planar geometry. The same number also appears in basic arithmetic examples such as 5 factorial, which equals 120.

      • 18 — Eighteen is the number behind the 18-electron rule, a common stability guideline for transition-metal complexes. It is also the atomic number of argon and the group number associated with the noble gases.

      • 24 — Twenty-four is the factorial of 4, a number that also appears in combinatorics, geometry, and film frame rates. It is the standard sound-film projection rate of 24 frames per second.

      • 25 — 25 is the result of many straightforward calculations, from adding exponents in powers of the same base to finding the value of a linear relation or a roster limit. It also appears as the size of the standard baseball roster and as the number attached to a Mozart symphony and Beethoven’s “Für Elise.”

      • 3 — 3 is the integer after 2 and before 4, the smallest odd prime, and the number of sides in a triangle. It is the number of spatial dimensions, appears in the Collatz conjecture and the triple-alpha process, and is used in titles such as The Three Musketeers and Three Sisters. In chemistry, 3 can denote the atomic number of lithium, glyceraldehyde, ferric oxidation states, and the triprotic behavior of acids such as citric and phosphoric acid; it also gives the approximate van ’t Hoff factor for calcium chloride in the cited clue. Other references include the phrase “three-point shot,” the factor by which a cube’s side-length expansion scales its volumetric expansion coefficient, the equation log 1000 = 3, and the fact that if two sides of a scalene triangle are 8 and 6 and the third side is an even integer, there are three possible triangles.
        • Three (3) — Three is the number tied to Buddhism’s Three Jewels, three baskets of scripture, and the three marks or kinds of suffering described in some traditions. It is also the number of significant digits in 24.0 and the minimum dimension in which skew lines can exist.

      • 360 — 360 is a number that appears in combinatorics and geometry, including the count of distinguishable permutations of the letters in RHYTHM. It also fits several arithmetic trivia clues, such as being Euler’s totient of 427.

      • 38 — 38 is a number that appears in arithmetic and geometry, including a Ptolemy-theorem problem and several number-trivia clues. It is also the atomic number of strontium and the number of slots on an American roulette wheel.

      • 60 — Sixty is the numerical answer that appears in the sample geometry, chemistry, and probability questions. It can be the area of a trapezoid, the least common denominator of 10 and 12, or the diameter of a circle in the stated problem.

      • 80 — Eighty is the age cutoff above which cardinals are excluded from a papal conclave. It also appears in references to the Eighty Years’ War and in statistical shorthand such as the Pareto principle’s eighty-twenty rule.

      • 99 — 99 is the number associated with songs like “99 Luftballons” and with the highest-numbered two-digit interstate. It also appears in the idea of a 99-year lease, especially in the history of Hong Kong and U.S. base rights in the Philippines.

      • eighteen — Eighteen is a useful number in music and chemistry, appearing in Steve Reich’s Music for 18 Musicians and in the eighteen-electron rule for coordination complexes. It also marks the maximum number of electrons in the third energy level of an atom.

      • Four — Four is the natural number associated with the four noble truths and with Lagrange’s theorem that every natural number can be written as a sum of four squares. It is the number of Pevensie siblings and of the blades on Freddy Krueger’s glove. In chemistry, carbon can form a stable tetravalent backbone, and a four-member beta-lactam ring is a common structure. Four is also the number of lobes in each human cerebral hemisphere and in the liver, and it appears in music as the string quartet.

      • integer — Integers are the whole numbers and their negatives, usually written with the symbol Z in mathematics. They are the number type used whenever a value has no decimal part.

        • 10 — Ten is the base of the decimal system and the number most often associated with everyday counting. It appears in science as the common logarithm base and in physics through the dimensional count of superstring theory in many quizbowl clues. It also shows up in sports and pop culture, from jersey numbers to the number of fingers and toes on a normal human body.

        • 4 and 6 — The answers are 4 and 6, the x-intercepts of y = x squared minus 10x plus 24 and the two current versions of the Internet Protocol. In context, they point to the roots of the quadratic and to IPv4 and IPv6.

        • Fifteen — Fifteen is the number repeatedly used in clues about literature, matrices, phosphorus, and a classic quantum factoring demonstration. In packet style, it appears as a line count, an atomic number, and the two-digit integer factored in a scalable Shor-algorithm experiment.

      • Perfect powers
        • Perfect cubes — Perfect cubes are numbers of the form n cubed, such as 1, 8, 27, 64, and 125. Their sum formulas and Ramanujan’s 1729 taxi-cab number are standard clues to this family of integers.
  • Rational numbers (ℚ) — numbers expressible as p/q with integers p, q (q ≠ 0); decimals terminate or repeat.
    • rational numbers — The rational numbers are the numbers that can be written as a ratio or quotient of two integers, commonly denoted by Q or blackboard-bold Q. They are exactly the numbers with terminating or repeating decimal expansions, and they are countable and dense in the reals. The reals can be constructed from them by Dedekind cuts or Cauchy sequences.

      • 1 over 4 — This is the cosine value found from the given sine and tangent data. The simplified answer is one fourth.

      • 7/3 — The definite integral of (x+1)^2 from 0 to 1 equals 7/3.

      • mixed number — A mixed number is a rational number written as a whole number together with a fraction. It is the form used for quantities like two and five-eighths, especially in measurements.

      • one ninth — One ninth is the factor by which electric force changes when the distance between two charges is tripled under Coulomb’s law. The same value appears as the slope between the points (4, 3) and (-5, 2).

      • 1/8 — One-eighth is the value of one-half cubed and also the probability of getting three heads in three fair coin flips. It is a simple fractional result that also contrasts with the much larger sum of the geometric series in the other clue set.

  • Irrational numbers — real numbers not expressible as a ratio of integers; decimals are non-terminating and non-repeating. Examples: √2, π, e. They include all transcendental numbers, such as pi and e, as well as algebraic examples like the golden ratio.

    • Golden ratio — The golden ratio, usually written phi, is the irrational number about 1.618, equal to (1 + √5) / 2. It is the ratio in which the whole is to the larger part as the larger part is to the smaller, and it is the limiting ratio of consecutive Fibonacci numbers. It appears in Fibonacci growth, the golden spiral, the regular pentagon and pentagonal geometry, Penrose tilings, and many discussions of classical rectangles, Greek architecture, and classical design. The symbol phi is also used in science as a variable in real-gas equations, work functions, Ramachandran plots, and protein-folding analyses.

    • irrational number — An irrational number is a real number that cannot be written as a ratio of integers. A classic example is the square root of two, whose discovery is associated with Hippasus in later tradition.

    • square root of 3 — The square root of 3 is the irrational number that appears when finding a cube’s space diagonal relative to its edge and in the distance formula for certain coordinate geometry problems. It also shows up in the area formula for an equilateral triangle, where the area equals one quarter of the side squared times this constant.

    • square root of 5 — The square root of 5 is the irrational number often written as radical 5, and it appears in geometry and algebraic identities. One common clue is that the golden ratio equals one plus this number, divided by two.

    • square root of two — The square root of two is the irrational number whose square is 2 and whose value is the diagonal of a unit square. It appears in approximations such as 99/70, in the silver ratio, and in the 45-degree trigonometric values for sine and cosine.

  • Real numbers (ℝ) — all rationals and irrationals; form a complete ordered field and correspond to points on the number line.

  • Complex numbers (ℂ) — numbers of the form a + bi where i = √(−1); extend ℝ to the complex plane.

  • Algebraic vs transcendental — algebraic numbers are roots of polynomials with integer coefficients (includes all rationals, √2); transcendental numbers (e.g., π and e) are not. π and e were both proved transcendental in the 19th century (Lindemann 1882 for π; Hermite 1873 for e).

  • Sets of numbers
    • 1 and 5 — The number pair 1 and 5 is the answer to both a trolley-problem prompt and a rational-function domain question in the packet.
  • Ordered fields
    • Archimedean property — This number-theoretic property says that no positive element is infinitely small relative to another, and it characterizes the real numbers as an ordered field. It is named for Archimedes of Syracuse.
  • transcendence theory

    • Gelfond-Schneider theorem — The Gelfond-Schneider theorem resolves Hilbert’s seventh problem by showing that a^b is transcendental when a is algebraic and neither 0 nor 1, and b is algebraic but irrational. It is also called Gelfond’s theorem, and proves the transcendence of numbers such as 2^(sqrt(2)) and e^pi.

    • Schanuel’s conjecture — Schanuel’s conjecture is an unproven statement in transcendence theory about the transcendence degree of fields generated by linearly independent complex numbers and their exponentials. It would imply major results such as the Gelfond–Schneider theorem if established.

• Inequality symbols
  • not equals — In BASIC, the operator written as less than followed by greater than means not equal. It is the inequality symbol used to compare values that are different.
• Number Representation and Large Numbers
  • decimals
    • 0.4 — The value 0.4 is a common cutoff for deciding when a covalent bond is nonpolar based on electronegativity difference. It also appears in the range notation for the third side of an isosceles triangle with legs of length 2.
  • Number systems
    • base-2 numeral systems
      • binary numeral system — The binary numeral system is a base-2 number system that uses only the digits 0 and 1. Gray code is a related variant in which consecutive numbers differ by one bit.

    • Hypercomplex numbers — Hypercomplex numbers are a general family of number systems that extend the real and complex numbers. Quaternions, biquaternions, octonions, and related constructions such as exterior algebras belong to this broad class.

    • mantissa — The mantissa is the fractional or significant part of a number, whether in a logarithm or scientific notation. In floating-point arithmetic, it is the part multiplied by the exponent to form the final value.

    • Numerals — Numerals are symbols or words used to represent numbers, from simple counting words like “two” and “three” to written systems such as Roman I, V, X, C, D, and M. They appear in a wide range of numeral systems, including vigesimal traditions and Mayan bar-dot-shell notation.

    • surreal numbers — Surreal numbers, developed by John Conway, form the largest ordered field and include the real numbers as well as infinitesimals and infinite values. They are built by recursive left-and-right set forms and are tied to birthday and transfinite constructions in set theory.
  • numbers — Numbers are mathematical or linguistic expressions of quantity, such as cardinal and ordinal forms. In philosophy of mathematics, they are the standard example of abstract objects whose existence is defended by Platonists. Hartry Field’s fictionalism argues for a kind of science without such objects, while figures like Tarski and Gödel are associated with work on them in logic. The clues here range from philosophy of arithmetic to numeral words in different languages, and one set of hints is really about the abstract objects themselves rather than a specific numeral.

    • 0 — 0 is the additive identity and the only integer that is neither positive nor negative. It is the units digit of 16!, the value by convention at which sinc is defined, and it can be the result of integrals such as a cosine integral. It also names absolute zero in thermodynamics and appears in many null or empty mathematical cases.

    • 200 men — This is the number of men at a school that is 60 percent female and has 100 more women than men. The answer is 200 men.

    • 26 — 26 is the number of Mozart’s Coronation Concerto, written for Leopold II’s accession as Holy Roman Emperor. The same number also gives the standard gematric value of the Hebrew Tetragrammaton.

    • 33 — 33 is the number that appears in a computation about an ACT composite score and in a number theory clue about the largest integer not expressible as the sum of triangular numbers. It is also the decimal value whose base-16 form is 21.

    • 36 — 36 is 6 squared and the cube root of 46,656, and it also matches the number of sides in a regular polygon with 170-degree interior angles. It is a common arithmetic answer in basic computation clues.

    • 39 — The number 39 appears in quizbowl as the length of a traditional sestina and as the title of The 39 Clues series. It is also the number behind the phrase “39 Kids on the Block.”

    • 7 — Seven is a number with many mathematical and cultural clues, including the heptagon, the Fano plane, and the octonions. It also appears in the title of The Seventh Seal and in the Roman Catholic count of seven sacraments.

    • Baker’s dozen — A baker’s dozen is thirteen, an old expression that comes from the practice of adding an extra loaf to avoid penalties for short weight.

    • complex — Complex numbers are numbers of the form a + bi, with a real part a and an imaginary part bi. They are algebraically closed and underlie complex analysis, holomorphic functions, Argand diagrams, the complex plane, and the fundamental theorem of algebra. They also appear in roots of unity, de Moivre’s theorem, and models of optical response and other systems with complex-valued quantities.

      • -8 + 6i — Squaring 1 + 3i gives -8 + 6i, while squaring 1 - 3i gives -8 - 6i. These are straightforward complex-number expansions.

      • 2i and -2i — The solutions of x^2 + 4 = 0 are the purely imaginary numbers 2i and -2i.

      • 7+5i or 7-5i — The complex numbers 7+5i and 7-5i have sum 14 and product 74 with their conjugates.

      • Argand diagram — An Argand diagram represents complex numbers as points in the Cartesian plane, pairing the real and imaginary parts as coordinates. The diagram is named for Jean-Robert Argand and is another way to picture the complex plane.

      • argument — In complex analysis, an argument is the angle of a complex number, written with phi in polar form and used in the complex logarithm. It is also the title of Robert Herrick’s opening poem in Hesperides, which begins by praising brooks, blossoms, birds, and bowers.

      • Complex arithmetic
        • -7 + 2i — Dividing -5 + 9i by 1 - i gives -7 + 2i after rationalizing the denominator. The result is a standard complex-number simplification.

      • complex conjugate — The complex conjugate of a complex number changes the sign of its imaginary part, sending a plus bi to a minus bi. It is denoted by a bar or sometimes an asterisk, and it underlies Hermitian adjoints and many standard quantum-mechanical formulas.

      • complex conjugates — Complex conjugates are numbers or expressions with opposite imaginary parts, such as a+bi and a-bi. In transmission lines and impedance matching, a load and source maximize power transfer when they are complex conjugates.

      • complex conjugation — Complex conjugation flips the sign of a complex number’s imaginary part and reflects it across the real axis. It sends roots of real-coefficient polynomials to other roots and turns a unitary matrix into its inverse.

      • complex number — A complex number has a real part and an imaginary part, often written in the form a + bi. They are the natural setting for holomorphic functions, Fourier kernels, and Argand diagrams, and roots of quadratic equations with negative discriminant lie in this set. Complex conjugation changes the sign of the imaginary component, and Gaussian integers are examples of these numbers.

      • four, thirty degrees — A complex power written as four at an angle of thirty degrees has magnitude four and phase pi over six radians. This is the polar form corresponding to the given real and reactive power components.

      • Gaussian integers — Gaussian integers are the complex numbers a+bi with a and b ordinary integers, forming the lattice points of the complex plane. They appear in quartic reciprocity and related number theory, and their fraction field is the fourth cyclotomic field.
        • 2 − i — This Gaussian integer is obtained by dividing 3 + i by 1 + i. In simplified form, the quotient is 2 minus i.

      • i — The imaginary unit, often denoted i, is the principal square root of negative one and the basis for complex numbers. It appears in Euler’s formula and de Moivre’s theorem, and the symbol i is also used in standard notation for quantities such as electric current and the van ’t Hoff factor.

      • imaginary number — An imaginary number is a non-real number built from the square root of negative one, usually written i. Imaginary numbers are central to complex numbers and appear when equations such as square roots of negative values are solved.

      • imaginary numbers — Imaginary numbers are non-real numbers built from multiples of i, the square root of negative one. They are used in complex numbers and are introduced so equations like x squared equals negative one have roots.
    • decimals

      • $1.00 — 1.00 is the perfectly scored result in gymnastics and similar judged sports. It also answers simple money-computation questions, where it can be represented as one dollar or as a perfect score on a scoreboard.

      • 1.2 — An index of refraction of 1.2 means the medium slows light to five-sixths of its vacuum speed. This is equivalent to one and one-fifth, or sixth-fifth.

    • Digit — Digits are the symbols used to write numbers, and the term also refers to fingers and toes. In mathematics, it can also mean the individual numerals in a decimal expansion.

    • Eight — Eight is the integer 8, the number of bits in a byte, and the basis of the octet rule because a filled valence shell has eight electrons. It appears in chemistry references to octane, propane, and ethane; in historical references to the eighth century, regnal number VIII, and the eight banners; and in cultural references such as the octet in music, the Noble Eightfold Path, the Beatitudes, the Daoist Eight Immortals, the number of books in some game franchises, and 8-bit video game style.

    • eleventh — Eleventh is the ordinal for the number 11. It can name a century, an inning in baseball, or the Eleventh Amendment to the U.S. Constitution.

    • Fifty — Fifty is the number obtained from ten times twelve minus ten times seven. In Islamic tradition, Muhammad negotiated with Allah to reduce the required daily prayers from fifty to five.

    • Large numbers
      • googol — A googol is the number 10 to the 100th power, famously named by Milton Sirotta, Edward Kasner’s young nephew. It is often used to illustrate a quantity far larger than everyday physical counts and is roughly comparable to 70 factorial.
    • natural numbers — The natural numbers are the counting numbers, usually 1, 2, 3, and so on, though some conventions include 0. They are the domain of the Peano axioms and appear in constructions tied to induction, coding, and the Archimedean property.

      • 12 — Twelve is the number of pitches in the chromatic scale and the number of months in a year, hours on a clock face, and zodiac signs. It is also the number of members in a jury or many famous titles such as Twelve Angry Men and 12 Years a Slave.

      • Forty-two — Forty-two is the number famously identified in The Hitchhiker’s Guide to the Galaxy as the answer to life, the universe, and everything. It is also the product of seven and six.

      • one — The multiplicative identity and the smallest positive integer. It is the number of performers in a solo, the number of independent voices in Gregorian chant, and the number of sharps in G major. It is also the number of edges on a Möbius strip, the eccentricity of a parabola and a parabolic orbit, and a comparison value in simple geometry and physics, such as the coefficient needed to keep a car from sliding on a 45-degree incline. In number theory, 1 is the unique integer whose totient is itself and one of the standard values of the Möbius function; it is also called unity.

      • one hundred — One hundred is a basic numerical clue often used for the Hundred Days and for the centum-satem division of Indo-European languages.

      • Seven — The integer that follows six and precedes eight. It is the number of days in a week and appears in many cultural references, including creation narratives, the Seven Deadly Sins, and the seven circuits around the Kaaba in the hajj.

      • Seven — The answer is seven: on a clear day, Rock City’s Flag Court claims visibility of seven states from Lookout Mountain.

      • six — The natural number after five and before seven. It is a perfect number; the number of strings on a standard guitar; the number in Beethoven’s Pastoral Symphony, Mahler’s Sixth, and the French group Les Six; the number of ligands in an octahedral complex; the atomic number of carbon; the number of carbon atoms in benzene and glucose; and the number of naturally occurring noble gases. It also appears as the outer-shell count for oxygen, sulfur, and selenium, and as the maximum occupancy of the p subshell.

      • thirteen — Thirteen is a number with many classic quizbowl appearances, from the number of books in Euclid’s Elements to the number of Archimedean solids. It is also the age of bar and bat mitzvah in the standard tradition.

        • The number thirteen — Triskaidekaphobia is the fear of the number thirteen.
    • negative numbers — Negative numbers are numbers less than zero, and they show up in everything from exponents and coordinates to computer indexing and two’s-complement representation. They are also used in physics and chemistry for quantities like exothermic enthalpy changes and negative electric charge.

      • -1 (negative one) — Negative one is the additive inverse of 1, and its square equals 1. It is also the number used in inverse-function notation, in many programming conventions, and in the definition of the imaginary unit through the square root of negative one.

      • negative — Negative is the adjective for numbers below zero, for charges produced by excess electrons, and for test results indicating absence rather than presence. It also describes inverse feedback and methods such as negative staining or Gram-negative classification.

    • Nine — Nine is the number that follows eight and precedes ten in the natural-number sequence. It is the size of a nonet. It appears in the nine Muses, Odin’s nine nights on Yggdrasil, and the ninth circle of Dante’s Inferno. In music, it is associated with the “curse of the ninth” and famous ninth symphonies, including Beethoven’s Ninth Symphony, linked to Schiller’s “Ode to Joy,” as well as Schubert’s “Great” Ninth and Mahler’s Ninth.

    • quintillion — A quintillion is the American-numbering term for 10 to the eighteenth power, the value with eighteen zeros.

    • real numbers — The real numbers are the complete ordered field consisting of all rational and irrational numbers, usually represented by the number line and the symbol ℝ. They have the least-upper-bound property, can be pictured on the number line, and are the values mapped into the integers by floor and ceiling functions. They are the setting for standard Cartesian coordinates and for constructions such as Dedekind cuts and Cauchy sequences.
      • construction from rationals
        • Dedekind cuts — Dedekind cuts are partitions of the rational numbers used to construct the real numbers from the rationals. A Dedekind cut divides an ordered field into a downward-closed set with no greatest element and its complement.
          • Dedekind cut — A Dedekind cut is a partition of the rational numbers into two sets with no largest element in the lower set, used to construct the real numbers from the rationals. It is one of the standard ways to define real numbers rigorously in analysis.

      • Real — The real numbers form the standard complete ordered field and the number line, distinguished from complex numbers by the absence of imaginary parts. The term also appears in real analysis, real projective geometry, and economics in phrases like real GDP.

      • real number — A real number is any number without an imaginary component, including rationals and irrationals. The real numbers form the ordered field used in ordinary measurement and analysis, unlike the complex numbers formed by adjoining i.

    • Sixteen — Sixteen is the number of elements in the power set of a four-element set. It is also the bridge opening count referenced by the clue about a one no-trump bid.

    • ten-thousands
      • 10,000 — Ten thousand is the number often used in Chinese texts to mean a vast multitude or the manifested universe. In Daoist usage, it appears in phrases like the “ten thousand things,” and the numeral is also represented by the Chinese word wàn.

    • The number 13 — Triskaidekaphobia is fear of the number 13.

    • Transcendental number — A number that is not algebraic, meaning it is not the root of any polynomial with rational coefficients. Famous examples include pi, e, and e to the pi; the concept is central to modern number theory. By contrast, square root of two is algebraic, while e is transcendental.

    • twelve — Twelve is the number of apostles, tribes of Israel, and months in the standard year, and it appears in many religious and mathematical clue sets. It is the number of stars in the Marian crown and the number of church figures in some succession councils. In chemistry and geometry, it also shows up in atomic and polyhedral counting facts.

    • twelve years — Twelve years is the time span invoked by several chronology clues, including Sirius Black’s prison term and the release intervals of certain films. The paired questions point to the number twelve as the intended answer rather than a specific named work or person.

    • Two — Two is the smallest even prime number and the integer 2. It is the number of inputs to the Ackermann function, the number of solutions to a quadratic equation, and a common constant in formulas for area, kinetic energy, Newton’s second law, and square geometry. It also appears in binary systems, the second movement of string quartets, the pair of planets closer to the Sun than Earth, the Euler characteristic of a sphere-like connected-sum context, the charge of alkaline earth ions, lone pairs on a central halogen, and the formal charge of sulfur in sulfate.

  • 108 — The number 108 appears in Hindu and Buddhist contexts and in Chinese literature, especially the 108 outlaws or heroes of Water Margin and the Stars of Destiny.

  • square roots

    • square root of 13 — The square root of 13 is the positive number whose square is 13, and it appears in simple distance and modulus computations in the plane and complex numbers. Clues may ask for it as the distance from the origin to (2,3) or as the modulus of 2 minus 3i.

    • square root of 2 — The square root of 2 is the hypotenuse of a 1-by-1 right triangle and the factor by which a leg scales to a 45-45-90 hypotenuse. It is also the irrational number famously proved so by contradiction in the classical Pythagorean tradition.

  • large numbers

    • googolplex — A googolplex is 10 raised to the power of a googol. It is commonly described as a 1 followed by a googol zeroes.

    • Quadrillion — A quadrillion is the British name for 10 to the 30th power.

    • ten thousand — Ten thousand is the number historically called a myriad in Greek usage. It is associated with Xenophon’s Ten Thousand, the Persian Immortals, and other large military formations in classical and late antique sources.

    • octillion — An octillion is the number 1 followed by 27 zeroes.

  • number base — A number base is the generalized positional system that determines how many unique digits a numeral system uses. Decimal, binary, hexadecimal, and Knuth’s quater-imaginary system are all examples of such bases.

  • number bases
    • 13 — Thirteen is the base used by John Conway’s counterexample to the converse of the intermediate value theorem, the Conway base-13 function. It also appears in the familiar Fibonacci-style sequence clue and as the unlucky number associated with Friday the 13th.
  • numeral systems
    • base-n notation
      • Base 3 — Base 3 is the ternary numeral system, using three digits instead of ten. Converting numbers between bases often reduces to place-value arithmetic in powers of the target base.
    • Arabic numerals — Arabic numerals are the numeral system that spread from India through the Islamic world into medieval Europe. Fibonacci’s Liber Abaci helped popularize them in the West, where they replaced Roman numerals.
  • Numeration systems
    • Roman numerals — Roman numerals are the letter-based numbering system using symbols such as I, V, X, L, and D, with nulla used for zero. They appear in numbering monarchs and Super Bowls, and in music theory or string notation they can label chords or instruments.

      • IX — IX means ninth and is commonly used as a regnal or ordinal designation.

      • LXXXI (81) — This is the Roman numeral for 81. It is derived in the packet by subtracting the prime between 17 and 23 from the number of stories in The Decameron.

      • MDCCLXXVI — MDCCLXXVI is the Roman numeral form of 1776. It appears on the tablet held by the Statue of Liberty, where the date July 4, 1776 is written in Roman numerals.

  • Number representation
    • scientific notation — Scientific notation expresses a number as a value from one to ten multiplied by a power of ten. It is commonly used for very large or very small numbers such as 280 written as 2.80 × 10^2.
      • 2.5 x 1011 — This is the result of the scientific-notation computation involving powers of 5, 3, 8, and 10. The computed value is 2.5 × 10^11.

Arithmetic and Algebra Fundamentals

• Arithmetic, Proportion, and Inequality
  • arithmetic — Arithmetic is the branch of mathematics concerned with basic operations on numbers, especially addition, subtraction, multiplication, and division. It also includes arithmetic progressions and modular arithmetic, and it underlies the simplest forms of number theory.

    • 180 — 180 is the number of degrees in a straight angle and the sum of the interior angles of a triangle. It is also the number of distinct arrangements of the letters in “reaper.”

    • 2 weeks — This is the time needed for two people working together to finish a packet when one can do it in 3 weeks and the other in 6. The answer is also given as the maximum time between two flights in a separate problem.

    • 7-5i — Dividing 5+7i by i gives 7-5i in a+bi form.

    • 7.0 x 103 — Dividing 6.3 × 10^-4 by 9 × 10^-8 gives 7.0 × 10^3.

    • commutative property for addition — The commutative property for addition says that changing the order of addends does not change the sum. It is illustrated by expressions such as x plus y equaling y plus x.

    • division — Division is the inverse of multiplication, producing a quotient and sometimes a remainder when integers do not divide evenly. It is undefined when the second operand is zero, and Euclid’s algorithm, synthetic division, and the construction of the rationals from the integers all point to the same operation.
      • ÷ — ÷ is the arithmetic symbol for division, the operation of splitting a quantity into equal parts. It is also commonly called the divide sign in elementary mathematics and computation contexts.

    • division by zero — Division by zero is an invalid arithmetic operation that often causes an error or yields infinity in computer programs. It is a common example of a mathematically undefined calculation used in fake proofs and software bugs.

    • fractions — Fractions express a part of a whole using a numerator and denominator, and they can be proper, improper, or mixed. They also appear in ratios and probability, and ancient number systems from Egypt and Greece developed early forms of them.

      • 0.5 — 0.5, or one half, is the value of the definite integral of x e to the negative x from zero to infinity. It also appears in enzyme kinetics, where the reaction rate equals one-half of the maximum rate when substrate concentration equals the Michaelis constant.

      • 1/2 — The number midway between zero and one. It appears as the coefficient in the kinetic energy formula, in the quadratic term for uniformly accelerated displacement, and in standard formulas for projectile motion and rotational inertia; the corresponding negative power appears in Graham’s law of diffusion. It also occurs in the tangent half-angle substitution and as the value at which the gamma function’s square root is taken.

      • 1/3 — The asked-for values are simple numerical ratios or fractions, with 1/3 appearing in cone and pyramid volume formulas and 1:3 in the Meselson-Stahl DNA experiment. A related chemistry clue gives the oxidation state of triiodide as negative one-third per iodine atom in I3−.

      • 2/5 — Two-fifths is the common fraction answer in several arithmetic and probability settings. It also appears in the spinning game in which John’s winning chance is 2/5 when Mary spins first.

      • five-thirds — The adiabatic index of a monatomic ideal gas is five-thirds, or 5/3. The same fraction appears in the Thomas–Fermi model as the power governing the kinetic-energy density integral.

      • ONE FOURTH — If three identical fair coins are flipped, the probability that all three show the same face is one fourth. That value is also written as 1/4, 0.25, or 25 percent.

      • one-half — The fraction 1/2, equal to 0.5 and the square root exponent used in many physics formulas. It appears in kinetic energy, projectile motion, pendulum periods, and numerous other expressions.

      • one-third — One-third is the fraction equal to 4 divided by 12. It is also the probability of staying with the original door in Monty Hall, and the probability that the next marble drawn is red after one green marble has been removed from a bag containing two blue, six red, and eleven green marbles, leaving 6 red among 18 marbles. It appears in geometry and mechanics, including the volumes of cones and pyramids and the acceleration of an Atwood machine with masses m and 2m.

      • rational numbers

        • 3/5 — The reduced form of 24/40; equals 0.6. It also appears as a numerical answer in a thermal-propagation and gravitation context, and as the sine/cosine ratio in right-triangle setups.

        • 5/3 — Five-thirds, or one and two-thirds, is the slope of a line through the origin and the point (1,5). It also appears as the value of the Lorentz factor at eight-tenths the speed of light and as the x-intercept of the line 3x + y = 5.

      • two-thirds — Two-thirds is the fraction one gets by taking two parts out of three, or by subtracting one-third from one. It appears in ideal Carnot-engine efficiency and in the rule that a pope or a constitutional override may require that share of votes.
    • numeric evaluation
      • 1 plus (the quantity) root 3 over 2 — This is the value of (sin pi/6 plus cos pi/6) squared. It simplifies to one plus the square root of three over two.

    • Order of operations — The order of operations is the rule that determines the precedence of arithmetic steps. Parentheses come first, followed by multiplication and division, then addition and subtraction.

    • percentages

      • 50 percent — This answer is fifty percent, the probability in a simple carrier-cross for color blindness or the fraction occupied by pieces on a chessboard at the start of a game. It is also a convenient rounded percentage in demographic-style calculation questions.

      • ten percent — Ten percent is the threshold used in Lincoln’s reconstruction plan for readmitting Southern states to the Union. The phrase also refers to the ecological rule that only about ten percent of energy is transferred from one trophic level to the next.

    • Powers
      • third power — The third power, or cube, is the exponent that appears in Kepler’s third law and in the formula for volume of a sphere. It also shows up in cosmology, where matter density scales as the inverse cube of the scale factor, and in gravitational-radiation calculations for binary systems.
    • Reciprocal formulas
      • Inverse of sum of the inverses — The inverse of the sum of the inverses is the rule used for combining resistors in parallel, capacitors in series, and springs in series. In these cases, the total quantity is not found by simple addition but by the reciprocal-sum formula.
    • squaring — Squaring is the operation of multiplying a number by itself. It produces a nonnegative result over the reals and underlies simple inequalities such as r squared being at least zero.
  • arithmetic operations
    • addition — The basic arithmetic operation that combines quantities, numbers, or vectors to produce a sum. It is written with plus signs or sigma notation, underlies repeated summation and multiplication, and appears in series, vector sums, and many algebraic identities; in category theory it is generalized by the coproduct.
      • plus sign — The plus sign is the symbol used for addition, and in many contexts it also marks concatenation, repetition, or unary identity. It appears in programming language names such as C++, where it is doubled in the increment operator.

    • integer multiplication — Integer multiplication is the arithmetic operation of finding the product of two whole numbers. It is a classic algorithms topic, with fast methods including Karatsuba multiplication and Schönhage–Strassen-style FFT-based approaches.

    • multiplication — Multiplication is the basic arithmetic operation that produces products and can be repeated as exponentiation. It also appears in faster algorithms for large-number multiplication, including Karatsuba and Schönhage-Strassen.

      • product — The product is the basic arithmetic operation of multiplication, including repeated addition and its Cartesian, cross, and dot-product forms. In algebra and category theory, products appear in direct products, tensor constructions, and related compactness results such as Tychonoff’s theorem.

      • triple — Triple means a threefold increase or multiplication by three. It also names a type of horse-racing bet, a musical division of meter, and a baseball hit that advances the batter to third base.

  • arithmetic word problems
    • 8 hours — This answer is eight hours, the length of a standard work day and the result of a few workplace and timing word problems. It also appears in geometry-driven rate questions that convert map distance into travel time.

  • Order of operations (PEMDAS/BODMAS) — Parentheses, Exponents, Multiplication/Division (left to right), Addition/Subtraction (left to right).

  • Commutative, associative, distributive laws — commutativity: a + b = b + a; associativity: (a + b) + c = a + (b + c); distributivity: a(b + c) = ab + ac.

  • Absolute value —

    x

    = x if x ≥ 0, −x if x < 0; measures distance from zero. It is written with vertical bars, is V-shaped as a graph, and is non-differentiable at the origin. It underlies the triangle inequality and the L1 norm.

    • absolute value function — This function gives the distance of a number from zero and has a V-shaped graph. For complex numbers it is called the modulus, and its derivative is the signum function away from zero.
  • fraction

    • one-sixth — One-sixth is the fraction left when one-third and one-half are removed from a whole. It appears in probability calculations, in the ancient Athenian hektemoroi, and in a kinematics formula involving constant jerk. It is also associated with simple probability and geometry prompts, including rolling a 5 and a total of 10 on two dice, dividing a pizza, and a strain-related scientific clue.

    • two-fifths — For a uniform solid sphere, the moment of inertia about an axis through the center is two-fifths of m r squared. This same reduced fraction is the standard answer for the solid ball rotation formula.

  • ratios
    • 12-to-1 — The odds against She’s a Winner winning the race are 12-to-1. A separate calculation in the set also gives a ratio of 12 to 1.
  • Ratios and proportions

    • 1:1 — The ratio 1:1 is the simplest form of equality between two quantities. In the clues, it appears as the time signature one-one, as the sex ratio predicted by Fisher’s principle, and as a coordinate pair with equal values.

    • y equals 221 — This is the result of a ratio-based computation in which x = 7 when y = 17 and the same proportion is extended to x = 91. Because 91 is 13 times 7, the corresponding y-value is 221.

  • Averages
    • Weighted averages
      • weighted — A weighted average assigns different importance to different values rather than treating each contribution equally. The same idea appears in weighted voting and in numerical methods such as Gaussian quadrature, where a weight function controls the sum.
  • axioms of arithmetic
    • Peano axioms — The axioms are the first-order axiomatization of the natural numbers, built around zero, successor, equality, and an induction schema. They are named for Giuseppe Peano and are often identified with Peano arithmetic. They are standard in metamathematics: Gödel’s incompleteness theorem applies to them, and they are used in proofs of results such as the unprovability of Goodstein’s theorem and, via transfinite induction, consistency arguments for arithmetic.
  • Equality
    • equal — Equal means having the same value, size, or degree, and in geometry it describes lines with matching slope relationships or quantities that balance one another. It can also refer more broadly to things that are identical in level or status.
  • Proportions
    • Golden Section — The golden section is the geometric proportion defined by splitting a line so the ratio of the whole to the larger part equals the ratio of the larger part to the smaller part. It is the same proportion later called the divine proportion and can be described algebraically by the equation x^2 + x - 1 = 0.
  • word problems
    • Six hours — Six hours is the total time needed in the word problem about Alex and John writing tossups and bonuses at different rates. The answer comes from combining their work rates over the full packet.
  • Inequality — An inequality is a mathematical statement comparing quantities using less-than, greater-than, or related relations rather than equality. Examples include the triangle inequality, the AM-GM inequality, Jensen’s inequality, the Cauchy-Schwarz inequality, and other results named for Young, Hölder, and Chebyshev.

    • 1<x<3 — The solution set is the open interval from 1 to 3, since x^2-4x+3 factors as (x-1)(x-3) and is negative between its roots.

    • Arithmetic mean-geometric mean inequality — The arithmetic mean-geometric mean inequality states that for positive numbers, the arithmetic mean is at least the geometric mean; for two real numbers, their average is at least their geometric mean. It generalizes to many variables and appears in proofs and results involving Jensen’s inequality, Muirhead’s inequality, and volume maximization.

    • intervals

      • -8/3 < x < 4 — The inequality

        3x - 2

        < 10 solves to -8/3 < x < 4. This is the open interval between those endpoints.

  • Order and inequality
    • positive — Positive numbers are greater than zero. In mathematics, positivity is also the property required for quantities such as norms, inner products of nonzero vectors, and many determinants in orientation-preserving transformations. The adjective positive also appears in phrases like positive definite, positive reinforcement, and positive psychology. Its opposite is negative.
  • percentages
    • 50 — Fifty percent, or one-half, is a common threshold in virology and genetics problems. It is also the answer to basic algebra and inverse-variation examples in which one quantity is half of a whole or changes from 10 at x equals 5 to 50 at x equals 1.
  • means

    • geometric mean — The geometric mean of positive numbers is the nth root of their product, making it the multiplicative counterpart to the arithmetic mean. It appears in inequalities, in the altitude-to-hypotenuse relationship in right triangles, and in many standard math clues.

    • harmonic mean — The harmonic mean is the reciprocal of the arithmetic mean of the reciprocals, and for n values it equals n divided by the sum of their reciprocals. It is the mean named alongside a series of reciprocals, and it appears in problems where a physical system’s tension can be expressed using that same reciprocal-based function of two masses.

• factors and factorization
  • factors — Factors are numbers that divide another number evenly, and in algebra they are expressions multiplied together to make a product. In statistics, factor analysis uses latent factors to explain correlations among observed variables.
• Algebra — Algebra is the branch of mathematics that uses symbols and variables to solve equations, study polynomial roots, and investigate operations on variables and abstract structures such as groups, rings, and fields. Its common subfields include linear algebra and Boolean algebra. The term ultimately comes from al-Khwarizmi’s work on balancing equations, and the subject grew from classical work associated with Diophantus, Viète, and Descartes.
  • Abstract algebra — Abstract algebra studies algebraic structures such as groups, rings, and fields rather than numerical calculation alone. Its name reflects the study of operations and structures derived from more general rules, including subjects like linear algebra, Lie algebras, and category theory.

    • automorphism — An automorphism is an isomorphism from a mathematical object to itself. In group theory, it is an invertible map such as conjugation that preserves the structure of the group or category.

    • closure properties
      • closure under addition — Closure under addition is the property that adding any two elements of a set produces another element of the same set.
    • commutative structures
      • Abelian — Abelian means commutative, especially in algebra and group theory, where every element commutes with every other element. The term is used for abelian groups, abelian varieties, and other structures with symmetric addition or multiplication. Cyclic groups are abelian, while noncommutative systems such as the quaternions are not.
    • extensions — An extension is a larger field obtained by adjoining new elements to a field. Finite Galois extensions are governed by the correspondence between intermediate fields and subgroups of the Galois group, and splitting fields are basic examples.
      • Kronecker’s theorem — Kronecker’s theorem states that any nonconstant polynomial over a field has a root in some extension field. It is named for Leopold Kronecker, who is better known for the Kronecker delta. The theorem is often stated as a basic existence result for adjoining algebraic roots.

    • Group (mathematics) — A group is a set with an associative operation, an identity element, and inverses. Examples include the integers under addition, and major examples in geometry and algebra include fundamental groups, Lie groups, and permutation groups. Groups are central to the classification of finite simple groups, and many important theorems such as Lagrange’s and Sylow’s theorems study their structure. Abelian groups are commutative, and adding inverses to a monoid produces a group.

    • idempotence — Idempotence is the property that repeating an operation produces the same result as applying it once. Common examples include projection operators and the identity element or identity function, since x equals x under repeated application.

    • Identity elements
      • identity element — An identity element is the unique neutral element of a binary operation, and an identity map or function leaves its input unchanged. In groups it is often written as e or 1, and in matrix algebra it is the diagonal matrix with ones and zeros elsewhere.
        • additive identity — The additive identity is the number 0, because adding it to any element leaves that element unchanged.

    • isomorphism — An isomorphism is a bijective homomorphism that preserves structure, so two objects related by one are algebraically or structurally identical. The term also appears in graph theory and Gestalt psychology, where it can mean a structural correspondence between systems or experience.

    • Mappings
      • transformation — A transformation is a function or mapping that takes elements of one set to elements of another set, including the permutations used in Cayley’s theorem. In algebra, the word also appears in the study of group actions and other structure-preserving maps.

    • quasigroup — A quasigroup is a groupoid whose multiplication table forms a Latin square. It is a basic algebraic structure studied in abstract algebra and related combinatorial settings.

    • representation theory — Representation theory studies algebraic structures by expressing their elements as linear transformations or matrices. It includes results such as Maschke’s theorem, the Krull-Schmidt theorem, and the Mackey formula.

      • Group representations — A group representation is a homomorphism from a group into a general linear group, realizing an abstract group as matrices acting linearly on a vector space. Irreducible representations have no nontrivial invariant subspaces and play a central role in results such as Maschke’s theorem and Schur’s lemma. Important related notions include faithful representations.

      • representations — Representations are homomorphisms from a group to a general linear group, realizing abstract groups as linear transformations on vector spaces. They may be irreducible or faithful, and for compact Lie groups they are classified by highest weight.

      • Schur’s lemma — Schur’s lemma is a basic result in representation theory about maps that commute with an irreducible group action. Such an intertwining homomorphism is either zero or an isomorphism, and the lemma helps make the decomposition of a representation into irreducibles unique.

    • Ring theory
      • ring ideals — In ring theory, an ideal is a subset of a ring closed under addition and under multiplication by arbitrary ring elements. For example, the multiples of three form an ideal in the integers.
    • solvability — In group theory, solvability is the property of having a derived series ending in the trivial group; equivalently, a finite group can be built from a normal series with abelian quotients. Finite permutation groups with this property are built from abelian factors. The term also applies to Lie algebras whose derived series terminates. In Galois theory, solvable groups correspond to polynomials whose roots can be expressed by radicals; S5 is not solvable, which is why general quintic equations are not solvable by radicals.
  • algebraic properties
    • commutative property or commutativity — The commutative property, or commutativity, means that changing the order of operands does not change the result. It is the algebraic rule behind identities such as a + b = b + a and is not shared by subtraction or matrix multiplication.

  • associative — A binary operation is associative when changing the grouping of terms does not change the result, as in matrix multiplication or addition. The same property explains why expressions with one operation can sometimes be written without parentheses, and it also appears in set-associative cache design.

  • associative property — The associative property is the property of a binary operation that lets one change the grouping of terms, so parentheses can be moved without changing the result, as in (ab)c = a(bc). Addition and multiplication are associative; subtraction, division, and the cross product are not. It is one of the defining axioms for groups and also holds for semigroups, quaternions, and matrix multiplication, but not for octonions.

  • binary operations
    • commutativity — The property of a binary operation whose result does not depend on the order of its inputs, so in a commutative operation x times y equals y times x. Addition and multiplication are commutative, while subtraction, division, and matrix multiplication are not; matrix addition is commutative. Groups with this property are abelian.

      • commutativity postulate — The commutativity postulate is the rule that multiplication is order-independent when it applies. Quaternions violate it because multiplying two elements in opposite orders can give different results.

      • commute — To commute means to satisfy AB = BA, so the order of the operation does not matter. In quantum mechanics, position and momentum operators do not commute, while some other operators do.

    • products — Products are binary operations whose common examples include the dot product, cross product, and Cartesian product. The Cartesian product of nonempty sets appears in the axiom of choice, and product constructions preserve compactness in topology.
  • Binomial multiplication
    • 12x^2 + 16x - 3 — The product of (2x+3) and (6x-1) is 12x^2 + 16x - 3. This is a straightforward binomial multiplication result.

  • commutation — The commutation relation is the condition that two operations or operators can be swapped without changing the result; equivalently, the commutator is AB-BA. In physics it appears in canonical commutation relations and the Heisenberg picture. In quantum mechanics it underlies shared eigenbases, and in Hamiltonian dynamics conserved quantities commute with the Hamiltonian under the Poisson bracket.

  • commutator — In mathematics and physics, the commutator of two operators A and B is the binary operation AB minus BA. It measures whether operators are compatible, appears in Lie algebras, and underlies canonical relations such as the position-momentum commutator in quantum mechanics.

  • conjugation — Conjugation is the operation that sends a group element to a conjugate by multiplying on one side and then by an inverse on the other. In complex numbers, it is the reflection across the real axis that changes a+bi to a-bi, and it also names the direct DNA-transfer process in bacteria.

  • cubic — Cubic means of degree three, especially in algebra where a cubic polynomial has three roots. The same word also names the cubic crystal system and the cube-shaped Platonic solid.

  • cubic equations — Cubic equations are polynomial equations whose highest power is three. They were studied by Jaina mathematicians and later solved geometrically by Omar Khayyam before Cardano gave an algebraic solution.

  • degree — A degree is the measure of the highest exponent of a polynomial, and in graph theory it is the number of edges incident to a vertex. The same word also names the dimension of a vector space, the degree of a field extension, and several other mathematical quantities.

  • Descartes’s Rule of Signs — Descartes’s Rule of Signs estimates the number of positive roots of a polynomial by counting sign changes in its coefficients. A related version gives the number of negative roots after substituting negative x or negating odd-powered terms.

  • Difference of squares — The difference of squares is the factorization pattern a^2 - b^2 = (a - b)(a + b). It appears when multiplying a binomial by its conjugate and is a basic algebraic identity.

  • Difference of squares and related derivative result — The difference of squares x^2 - y^2 factors as (x + y)(x - y). For x^2 - y^2 = 2xy, differentiating gives dy/dx = (x - y)/(x + y).

  • Distributive law — The distributive law states that a product can be expanded over addition, as in A times the quantity B plus C plus D equals AB plus AC plus AD.
    • distributive property — The distributive property says that multiplying a sum by a number is the same as multiplying each addend separately and then combining the results. It is the algebraic rule used in expressions like 3(2x+1)=6x+3 and is the inverse of factoring. It is the axiom that lets multiplication distribute over addition, and it also appears in set theory and vector spaces.
  • Equations

    • Rational equations — This is an algebra problem about solving rational equations and finding the values of x that make the expression valid. The answers involve simple roots of a quadratic after clearing denominators.

    • y = 4 — This is the x-intercept condition for a line written in an unusual form involving 6y + x = 12x + 24. The intended value is y = 4.

  • equations and inequalities
    • Linear equations and absolute value inequalities — These prompts ask for the value of x from a linear equation and from a basic absolute-value inequality. The examples resolve to x = 8 and x = -8.

  • Exponential equations — This is an algebraic equation where a quantity is raised to the 4/3 power and then set equal to 81. The solve-and-check approach gives x = 25 in the cited examples.

  • Exponentiation — Exponentiation is the operation of raising a number to a power, written with a superscript and reversed by logarithms. It shows up in binomial expansions, De Moivre-style formulas, repeated up-arrow notation, and rules for roots and negative exponents.

    • exponent — An exponent is the raised number that tells how many times a base is multiplied by itself. The same term also appears in logarithms’ inverse functions, repeated multiplication, and higher operations such as tetration.

    • Find x cubed — This asks for the cube of a complex variable x in a set of algebraic operations.

    • inverse powers
      • negative fourth — Negative fourth is the exponent in Poiseuille’s law for the dependence of pressure drop on pipe radius. The same inverse-fourth scaling also appears in the electric field of a quadrupole.

    • second power — The second power of a quantity is its square, written with exponent 2. It appears throughout physics in formulas for gravitational force, centripetal acceleration, inverse-square gravitation, and orbital relations such as Kepler’s third law. In quantum mechanics, a wavefunction’s squared magnitude gives a probability density, and normalization sets its integral to one. Air drag or lift questions often ask for a velocity-squared dependence.

    • Square — Square is the operation of multiplying a number by itself, producing a second power. The clues range from geometry and physics to statistics, where squaring appears in variance, least-squares regression, chi-squared tests, and inverse-square laws.
  • factoring — The process of rewriting a number or polynomial as a product of simpler factors. It appears in algebra and finite fields, underlies prime factorization, and is important in cryptography, including the difficulty behind RSA and RSA-related algorithms such as Shor’s. The term also applies to matrix decompositions such as LU and QR.
    • square-free — A square-free integer or polynomial has no repeated prime or irreducible factors. For polynomials, square-free factorization is useful because a polynomial and its derivative share a factor exactly when it is not square-free.

  • Ferdinand Georg Frobenius — Ferdinand Georg Frobenius was a German mathematician whose name appears in the Frobenius theorem, Frobenius algebras, and the Frobenius endomorphism in characteristic p. He is also associated with the Frobenius series and the Frobenius-Perron style result about finite-dimensional real division algebras.

  • fields — A field is a commutative algebraic structure with addition, multiplication, and division in which every nonzero element has a multiplicative inverse. Fields appear throughout Galois theory, vector spaces, and finite algebra, including splitting fields and finite fields.
    • subfields
      • prime subfield — The prime subfield of a field is the smallest subfield it contains. It is generated by the multiplicative identity, so it is isomorphic to the rationals in characteristic zero and to a finite prime field in characteristic p.

  • integral domain — An integral domain is a commutative ring with unity that has no zero divisors. Equivalently, if a product is zero, then one of the factors must be zero, and quotients by prime ideals are examples.

  • inverses — Inverses are objects that undo one another, such as a function and its inverse or a number and its reciprocal. In linear algebra and calculus, the term covers multiplicative inverses, inverse functions, and generalized notions like pseudoinverses.

  • irreducibility — Irreducibility is the property of an algebraic object that cannot be factored or decomposed into simpler nontrivial pieces. For polynomials, Eisenstein’s criterion can prove it, and over the rationals a degree-two or degree-three polynomial is irreducible exactly when it has no root.
    • irreducible — Irreducible means not able to be factored into nontrivial parts, whether for polynomials or representations. In algebra and representation theory, the term appears in Gauss’s lemma, Schur’s lemma, and the classification of irreducible complex representations.

  • isomorphic — A pair of algebraic or graph-theoretic objects are isomorphic when there is a bijective structure-preserving map between them. An isomorphism is such a map, and objects related this way are essentially the same for the purposes of the relevant category or algebraic structure. The term applies across groups, algebras, graphs, and other structures with the same form. Finite-dimensional vector spaces are isomorphic exactly when they have the same dimension.

  • Jacobi identity — The Jacobi identity states that the cyclic sum of nested brackets, such as commutators or Poisson brackets, is zero. It is a defining structural law in Lie algebras and appears in several areas of algebra and classical mechanics.

  • Linear equations — These are one-variable linear equations that reduce to a single solution after collecting like terms. The sample prompts solve to x = 17 in one case and x = -17 in another.

    • linear equation — A linear equation is a first-degree polynomial relation, often written in slope-intercept or point-slope form. Systems of linear equations can be solved by matrix reduction or Cramer’s rule, and least squares uses them to fit data.

    • y = 3x - 2 — This is the equation of a line in slope-intercept form, specifically one with slope 3 through (1,1) or a parallel line through (0,2). The answer can be written as y = 3x - 2, and a related prompt gives the parallel line y = 3x + 2 through the point (0, 2).

  • logarithms
    • x = 9 — The equation log base 3 of x equals 2 is equivalent to x = 9.

  • module — A module is a self-contained component, whether in mathematics, engineering, electronics, spacecraft design, or computer programming. In algebra, it is a generalization of a vector space in which scalars come from a ring rather than a field.

  • multiplicative inverse — A multiplicative inverse is the number or matrix that, when multiplied by another element, yields the identity. Nonzero real numbers have reciprocals, and non-singular square matrices have matrix inverses.

  • partial fractions — Partial fractions is the method of rewriting a rational function as a sum of simpler fractions. It is commonly used in calculus and Laplace transforms to integrate quotients of polynomials.

    • integration by partial fractions — Integration by partial fractions is a method for evaluating rational functions by factoring the denominator into simpler pieces. One then writes the integrand as a sum of terms with those factors in the denominators, provided the numerator has lower degree than the denominator.

    • Integration by separation of Partial Fractions — Integration by partial fractions is the method used to integrate rational functions after decomposing them into simpler terms.

  • polynomial — A polynomial is a finite algebraic expression or sum of terms with coefficients from a ring or field and variables raised to nonnegative integer powers. The fundamental theorem of algebra says an n-th degree polynomial has n complex roots; related results include Abel-Ruffini, Eisenstein’s criterion, and the Hilbert basis theorem. Important special families include Chebyshev, Hermite, Legendre, cyclotomic, and Schur polynomials, and polynomials are used in contexts such as characteristic polynomials, eigenvalues, synthetic division, and the Stone–Weierstrass theorem.

    • cubic polynomial — A cubic polynomial is a degree-three polynomial, and its graph can have at most two stationary points. Classical formulas such as Cardano’s method solve these equations by radicals.

    • Polynomial factorization — Polynomial factorization is the process of rewriting a polynomial as a product of lower-degree expressions. It includes methods such as Kronecker’s algorithm and relies on results like the fundamental theorem of algebra.

    • quartic — A quartic is a fourth-degree polynomial. Niels Henrik Abel showed that there is no general exact formula for solving polynomials of degree five or higher, making the quartic the highest degree with a general algebraic solution.

    • symmetric polynomials — Symmetric polynomials are unchanged when their variables are permuted, and they include the elementary, power-sum, and Schur functions. They appear throughout algebraic combinatorics through Newton’s identities, Vieta’s formulas, and the Littlewood-Richardson rule.

    • Vieta’s formulas — Vieta’s formulas relate the coefficients of a polynomial to symmetric functions of its roots. For a quadratic, they connect the sum and product of the roots to the coefficients.

  • Polynomial discriminants
    • Discriminant — The discriminant is the expression used to determine how many and what kind of roots a polynomial has. For a quadratic it is b squared minus 4ac in the quadratic formula; its sign determines whether the equation has two real roots, one repeated root, or no real roots, and when it is positive the equation has two real solutions. The same term also appears in algebraic number theory and in linear discriminant analysis.
  • polynomial division
    • synthetic division — Synthetic division is a shortcut for dividing a polynomial by a binomial of the form x minus a. It reorganizes polynomial long division into a coefficient-based algorithm that produces the remainder efficiently.
  • Polynomial equations — Polynomial equations are algebraic equations in which a polynomial is set equal to zero, with familiar examples including quadratic and cubic equations. They are solved by formulas in low degrees, but Abel-Ruffini shows that general radical solutions do not exist for degree five and higher.

    • Abel-Ruffini theorem — The Abel-Ruffini theorem states that there is no general solution in radicals for polynomial equations of degree five or higher, equivalently degree greater than four. It is tied to the work of Paolo Ruffini and Niels Henrik Abel, and its proof is tied to Galois theory and the simplicity of A5, the alternating group on five elements.

    • Descartes’ rule of signs — Descartes’ rule of signs gives bounds on the number of positive and negative real roots a polynomial can have. It works by counting sign changes in the coefficients of a polynomial and of the polynomial after substituting negative x.

    • quadratic equation — A quadratic equation is a degree-two polynomial equation, whose graph is a parabola. It can be solved by methods such as factoring, completing the square, or using the quadratic formula.

    • Quintic equation — A quintic equation is any polynomial equation of degree five. Abel and Ruffini showed that there is no general solution by radicals for the quintic, though Hermite later handled the general case using elliptic functions. It is studied in connection with Bring-Jerrard reduction and the classical icosahedral and theta-function approaches to special solvable cases.

    • quintic equations — Quintic equations are fifth-degree polynomials, the famous case where general solutions by radicals fail in light of the Abel-Ruffini theorem. They also appear in classical work on Tschirnhaus transformations, Hermite’s elliptic-function solution, and related Galois-group arguments.

  • quadratic equations
    • completing the square — Completing the square is a method for solving or rewriting quadratic equations by adding a term so a trinomial becomes a perfect square. It is also used to convert quadratic expressions into forms convenient for graphing conics and solving by square roots.

  • quadratic forms — Quadratic forms are multivariate polynomials in which every term has degree two. Their arithmetic is tied to the Hasse-Minkowski theorem and to the 290 theorem for integral representations.

  • Quadratic functions
    • quadratic — Quadratic means of degree two, especially in algebraic expressions and functions. Quadratic equations produce parabolas, and the adjective also appears in results such as quadratic reciprocity.
  • quaternions — Quaternions are Hamilton’s four-dimensional extension of the complex numbers, introduced by William Rowan Hamilton in 1843. They form a noncommutative division algebra containing the reals, and are written using the units i, j, and k. Their multiplication rules include i^2 = j^2 = k^2 = ijk = -1. They are especially useful for representing rotations without gimbal lock and appear in geometry, physics, and interpolation via SLERP.
    • quaternion — A quaternion is a four-dimensional number system introduced by William Rowan Hamilton and written in the form a plus b i plus c j plus d k. Quaternions are used to represent rotations in three dimensions and are central to the Cayley-Dickson construction.
  • Radicals

    • 2√2 — Simplifying 4 divided by √2 gives 2√2.

    • radical — In algebra, the radical of an ideal consists of elements whose some power lies in that ideal, and the Jacobson radical is the intersection of all maximal ideals. In political history, the Radical Republicans were the faction associated with Reconstruction-era hardline policies.

    • square root — The square root is the operation that reverses squaring, returning the principal nonnegative root of a number and equivalently raising the input to the one-half power. It sends 25 to 5 and 9 to 3, and for negative numbers it yields the imaginary unit when considered under the real numbers. It appears in the quadratic formula, the Pythagorean theorem, geometric mean, distance formulas, the standard normal distribution, and methods such as the Babylonian algorithm for computing roots. In measurement theory, averaging independent readings improves signal-to-noise ratio by the square root of the sample size.

  • rational functions
    • rational function — A rational function is the ratio of two polynomials, with the denominator not equal to zero. These functions often have asymptotes, and synthetic division can reveal them through the polynomial remainder structure.

  • rings — Rings are algebraic structures with two binary operations, and in chemistry they are cyclic molecular structures such as benzene. The word also applies to Saturn’s planetary rings and other disc-like celestial structures. In all three contexts, clues focus on cycles, closure, and stability rather than a single specific object.

  • Rings — Rings are circular bands and, in Beowulf and other contexts, can also refer to treasures or algebraic structures, depending on the clue. The same word also appears in science fiction and chemistry clues, from planetary rings to the structure of fused ring systems.

  • roots of polynomials — Roots of polynomials are the values that make a polynomial equal to zero. They are central to algebraic theory, the quadratic formula, Galois theory, and the Abel–Ruffini theorem.

  • semigroups — A semigroup is an algebraic structure with an associative binary operation. It generalizes a magma while not requiring an identity element or inverses, and transformation semigroups arise from sets of self-maps under composition.

  • solving equations
    • y = 6 — This is the y-value that appears as the intercept or solution to a simple system of equations. The cited prompts lead to y = 6, including the point (0,6) and the system x + 3y = 7 with x + 2y = 1.

  • t squared — In the common form of Kepler’s third law, the square of the orbital period is proportional to the cube of the distance from the sun. In the free-fall equation, the displacement term uses one-half times gravity times t squared.

  • x = 5 — The answer x = 5 appears in straightforward algebra problems, including linear equations and a cube-root equation. It can also be the x-value of a vertical asymptote or the solution to an equation after isolating the variable.

  • y = 1 — This answer is the value of y in simple algebra questions about solving linear equations, finding a vertex’s y-coordinate, or identifying a graph’s y-intercept. In the cited problems, it comes from rearranging an equation, using the vertex of y = x^2 - 4x + 5, and evaluating a piecewise function at x = 0.

  • y = 2 — This is the value of y in a pair of simple algebra problems, including a system of simultaneous equations and an inverse-variation setup. One prompt asks for the shared y-value in 2x+3y=4 and x+2y=3, and the other asks for y when it varies inversely with x and equals 4 at x=5.

  • zeros and roots
    • zeros — A zero, also called a root, is an input where a function evaluates to 0; for real functions these are x-intercepts. For a polynomial of degree n, there are n zeros counting multiplicity. Polynomial roots are the values that make a polynomial equal to zero and can be found using tools such as the quadratic formula and constrained by results such as the Rational Root Theorem.

      • 2, -3 (either order) — These are the two real roots identified in problems involving a rational function domain and a quartic equation. The pair is listed in either order as 2 and -3.

      • Algebraic answers from the prompt — The equation in the prompt has solutions x = 2 and x = 5. The remaining factors are x + 2 and x - 5.

      • cube root — The cube root is the operation of taking a number to the one-third power. It appears in physics and astronomy when solving for radii, periods, and density relations, and it is the inverse of cubing.

      • finding the roots of a polynomial — Finding the roots of a polynomial means solving for the zeros where the graph crosses the x-axis. Methods mentioned include Newton’s method, Sturm sequences, and the Brent algorithm, along with classical formulas for low-degree polynomials.

      • Roots of a polynomial — The roots of a polynomial are the values that make the polynomial equal to zero. For a degree-n polynomial, there are n complex roots counting multiplicity, and they are also the x-intercepts when the roots are real.

• Expressions, Powers, and Polynomial Equations
  • algebraic expressions
    • n plus 1 — n plus 1 is the standard binomial complement to n minus 1 and appears in simple induction and combinatorial formulas. It is also the number of water molecules formed when an alkane with n carbons combusts and produces n plus 1 waters.
  • equations
    • x = 2 — This is the computation-answer style topic for x = 2, commonly appearing as the removable discontinuity or vertical asymptote of a function. Clues point to simple algebra and graph-analysis questions where solving the equation isolates x at two.

  • Quadratic formula — for ax² + bx + c = 0: x = (−b ± √(b² − 4ac)) / 2a; the discriminant b² − 4ac determines whether roots are real and distinct, real and repeated, or complex. It gives the roots of a second-degree equation in terms of the coefficients a, b, and c, and is commonly written x = (−b ± √(b² − 4ac)) / 2a.

  • Exponents and powers
    • powers of two — Powers of two are numbers of the form 2 to the n, such as 4, 8, 16, and 32. They recur in Pascal’s triangle, Mersenne prime formulas, binary notation, and many results about linear systems and superposition.
      • 256 — 256 is 2 to the eighth power, the number of distinct values a byte can hold. It also appears as the maximum palette size for GIFs and as a common power-of-two benchmark in computing.

  • Logarithm laws — log(ab) = log a + log b; log(aⁿ) = n log a; change of base: log_b(x) = ln x / ln b.

  • Binomial theorem — (a + b)ⁿ = Σ C(n,k) aⁿ⁻ᵏ bᵏ; coefficients given by Pascal’s triangle.

    • Binomial — A binomial is a two-term expression, and the binomial theorem expands powers of x+y using coefficients that form rows of Pascal’s triangle. The binomial distribution counts successes in a fixed number of Bernoulli trials, has variance np(1-p), and is approximated by a Poisson distribution when n is large and p is small.

    • binomial expansion — The binomial expansion is the expansion of (x + y) to the nth power. Its coefficients are the entries in the nth row of Pascal’s triangle.

    • The binomial theorem — The binomial theorem gives the expansion of a power of a sum, such as (a+b)^n, into a sum of terms with binomial coefficients. It is associated with Newton and with the combinatorial structure of Pascal’s triangle.

    • X&Y — This title can refer to the binomial expansion identity credited to Isaac Newton, which expresses a sum of binomial coefficients times powers of x and y. It is also the title of a Coldplay album, but the mathematical clue points to the binomial theorem expression.

    • x^3y^2 — The third term in the expansion of (x+y)^5 is x^3y^2. This comes from the binomial coefficient for choosing three x’s and two y’s in the fifth power expansion.

  • Rational root theorem — if a polynomial aₙxⁿ + … + a₀ with integer coefficients has a rational root p/q (in lowest terms), then p divides a₀ and q divides aₙ; used to find candidate rational roots before factoring.

  • Fundamental theorem of algebra — every non-constant polynomial with complex coefficients has at least one complex root; equivalently, a degree-n polynomial has exactly n roots in ℂ (counting multiplicity). Proved rigorously by Gauss (1799). It is a standard result in complex analysis and algebraic topology and underlies the fact that the complex numbers are algebraically closed.

  • coefficients — Coefficients are the numbers that multiply variables in mathematical expressions and polynomials. They appear in many contexts, from correlation measures to Vieta’s formulae and methods of undetermined coefficients in differential equations.
    • coefficient — A coefficient is a number that multiplies a variable in an algebraic expression. In polynomials, the leading coefficient identifies the term of highest degree, as in monic polynomials whose leading coefficient is 1.
  • Radicals
    • simplified radicals
      • 5 times the square root of 3 — The simplified radical form of the square root of 75 is 5 times the square root of 3. This is the standard reduction after factoring 75 as 25 times 3.
  • Radicals and roots
    • Square Root of 10 — The square root of 10 is the magnitude of a vector or hypotenuse that can arise from simple right-triangle and coordinate geometry calculations. It also appears as the peak amplitude of a sum of sine and cosine terms when the expression is combined into a single trig function.
  • quadratic equations
    • -b/a — For a quadratic ax² + bx + c = 0, the sum of the roots is -b/a by Viète’s formulas. That same ratio also gives the slope magnitude of the asymptotes of the standard hyperbola x²/a² - y²/b² = 1.
  • Exponentiation and logarithms
    • logarithm function — The logarithm function is the inverse of exponentiation and turns multiplication into addition. It appears in Stirling’s approximation, prime-counting estimates, and the analysis of algorithms and data structures.
  • logarithmic scales
    • logarithmic scale — A logarithmic scale is a non-linear scale in which equal intervals represent equal ratios. Decibels and the Richter scale are standard examples.
  • Logarithms

    • 1 × 10^-10 molar — This is the approximate hydroxide-ion concentration corresponding to a solution with pH 4.00. The answer is 1 × 10^-10 molar, or an equivalent concentration unit.

    • Change-of-base formula — The change-of-base formula rewrites logarithms in one base using logarithms in another base. It is the identity that lets you compute log base b of x from logs in a convenient base such as base a or c.

    • common logarithm — The common logarithm is the base-10 logarithm, written as log base 10. It is the inverse of exponentiation with base 10 and appears in astronomical magnitude formulas.

    • ln 0.6 — Solving 7 + 5e^x = 10 gives e^x = 3/5, so x = ln(3/5). The equivalent form ln 0.6 is also correct.

    • logarithmic — A logarithmic scale grows by multiplicative rather than additive steps. It underlies the pH scale, the Richter scale, and the average-case running time of binary search and skip-list operations.

    • natural logarithm — The natural logarithm is the inverse of the exponential function with base e. Its derivative is 1/x, and the product rule for logarithms becomes addition. It appears throughout calculus, asymptotics, the Mercator series, the Euler-Mascheroni constant, differential-equation solutions, Stirling’s approximation, and statistical mechanics, including entropy formulas, the Gibbs-Helmholtz equation, expressions involving the partition function and microstates, and the definition of free energy.

      • log n — The logarithm of n grows slowly and is the inverse of exponentiation. It appears throughout computer science and number theory, including the average distance between primes and the height bounds for balanced trees.

      • the natural logarithm of 2 — For a first-order reaction, the half-life equals the natural logarithm of 2 divided by the rate constant. This same constant appears in the low-substrate limit of enzyme kinetics and is often written as ln 2 or 0.693.

    • natural logarithm of x — The natural logarithm is the logarithm base e, the inverse of exponential growth. Its derivative is 1 over x, it is defined only for positive inputs, and its graph has a vertical asymptote at x equals zero.

    • logarithm of n — The logarithm of n grows very slowly and is the standard inverse used to describe the height of balanced trees and the running time of binary search. Computer scientists usually mean base-2 logarithms unless the base is specified otherwise.

    • natural logarithm of 2 — The natural logarithm of 2 is the value represented by ln 2, approximately 0.693. It appears in the alternating harmonic series and in half-life formulas.
  • hyperoperations
    • tetration — Tetration is iterated exponentiation, the hyperoperation sometimes called hyper-4 and written with two Knuth arrows. It forms power towers and has special analytic behavior when extended beyond integers.
• Elementary mathematics
  • zero and one — Zero and one are the inclusive bounds of probabilities and the basic digits of binary notation. They also describe the range of Boolean values and the entries of stochastic matrices.
• history of mathematics
  • Thomas Bradwardine — Thomas Bradwardine was a 14th-century English philosopher and cleric known as Doctor Profundus. He wrote on the ratios of velocities in motion and formulated the mean speed theorem.
• Geometry and algebra
  • 2/3 — Two-thirds is the slope of a line perpendicular to one with slope negative three-halves, and it is also the supermajority needed to override a presidential veto. In thermodynamics and geometry, it can appear as the Carnot efficiency from 300 K to 100 K and as the area-related answer for a line and the coordinate axes.

Mathematical Notation

• explicit forms
  • explicit — Explicit refers to a way of expressing an iterative or recursive method so it can be executed directly. In programming and mathematics, an explicit form is often contrasted with a recursive or implicit one because it is easiest to evaluate directly.
• Greek alphabet
  • theta — This Greek letter commonly denotes an angle, appears in spherical and polar coordinates, and names the Jacobi theta functions. It also appears in linguistics for theta roles and in physics for the Heaviside step function and related special functions.
• Greek letters

  • chi — Chi is the Greek letter that looks like an X and appears in the chi-squared test. It also names the mathematical mixing parameter in polymer theory and, in Igbo thought, a personal spiritual force; a related Chinese concept is qi.

  • delta — Delta is the Greek letter used for change in mathematics and science, as well as the name of the Dirac delta function and the symbol for uncertainty or displacement. It also appears in geography for river mouths and in names like Delta Air Lines and Hurricane Delta.

  • omega — Omega is the last letter of the Greek alphabet and also appears in physics, chemistry, and asymptotic notation. It can denote the density parameter in cosmology, the halting probability in computability theory, and factor-counting functions in number theory.

  • psi — Psi is a Greek letter used in mathematics, physics, chemistry, biology, and plant science. It is used to represent water potential in plant science, appears in Ramachandran plots, is associated with psionics, and serves as the wavefunction symbol in quantum mechanics.

  • rho — Rho is the lowercase Greek letter used for density, charge density, and electrical resistivity. It also appears in physics for the rho meson and in statistics for mixed-state density matrices.

  • zeta — Zeta is a Greek letter that names the Riemann zeta function, as well as the zeta potential in colloid chemistry. It also appears in mathematics, physics, and engineering to denote related functions and damping quantities.

  • sigma — Sigma is the Greek letter used for sigma bonds, sigma-algebras, and the Poisson distribution’s namesake scientist. It appears in chemistry, physics, statistics, and set theory, and its uppercase form denotes summation.

• margin — Margin is the blank space around text or illustrations, and in finance it is the practice of buying securities with borrowed money. Related terms include initial margin, maintenance margin, and a margin call.

• equals sign — The equals sign is the mathematical symbol used to indicate equality between two expressions. In programming languages it is often adapted for assignment or comparison, and doubling it usually tests whether two values are the same.

• index — An index is an ordered position label, but in mathematics and logic the term also covers concepts such as fixed-point multiplicity, coset index, and tensor index notation. The word also names database structures that speed lookups and a sign type in Peirce’s semiotics that points to its object by direct connection.

• set notation
  • curly braces — Curly braces are the bracket symbols used in mathematics to enclose the elements of a set. In regular expressions, they also indicate repetition counts for a character or pattern.

• star — A star is a celestial body that appears in religious symbolism from Judaism’s Star of David to Islam’s crescent-and-star flags and the Baha’i emblem. In a different clue set, the answer can also be the Kleene star, Hodge star, or the asterisk symbol used in mathematics and linguistics.

• Notation

  • up arrows — Knuth’s up arrows are the symbols used in his notation for very large numbers, where one arrow denotes exponentiation and more arrows define higher operations. They are the notation used to write Graham’s number in compact recursive form.

  • Vinculum — A vinculum is a binding line or tie, and in mathematics it is the bar placed over a repeating decimal or grouped expression. The term also appears in anatomy for a ligament, in logic for negation notation, and in philosophy in Leibniz’s language about monadic connectedness.

• notation systems
  • reverse Polish notation — Reverse Polish notation is a postfix system that places operators after their operands, eliminating the need for parentheses in arithmetic expressions. It was used by stack-based calculators such as the HP-35 and is closely tied to the shunting-yard algorithm.

Measurement and Units

• calendar systems
  • Metonic cycle — The Metonic cycle is the 19-year cycle that keeps lunar months aligned with the seasons by intercalating extra months. It is named for Meton and is used in calendar systems, including the Jewish calendar.
• dimensional analysis
  • dimensionless — A dimensionless quantity has no units, as in absorbance, the Reynolds number, and many scaled variables in physics and chemistry. The term also underlies nondimensionalization, where equations are rewritten in terms of unitless parameters.
• Length

  • 15 feet — Fifteen feet is the length of a side in the scale-model roof problem and also the standard free-throw line distance from the hoop. It is equivalent to 180 inches, or five yards.

  • 20 centimeters — Twenty centimeters is the repeated answer to several short math and science calculation prompts. One example is the side length of an octagon with perimeter 160 centimeters.

  • 78.4 Meters — An object tossed upward at 39.2 meters per second reaches a maximum height of 78.4 meters when air resistance is ignored.

• Measurement

  • 2 ohms — The unknown resistor in the parallel circuit has a resistance of 2 ohms. That value makes the total reciprocal resistance add up to the stated 1 ohm equivalent.

  • 4 units — The answer is 4 units, appearing in several geometry and volume calculation prompts.

  • length
    • 2L — For a particle in a box, the longest possible wavelength is twice the box length, so the quantity is 2L. The same shorthand can also denote the volume-counting answer in a separate art-related question.

  • significant digits — Significant digits are the measured digits in a number that convey precision and are used when rounding experimental results. They determine how many digits are considered reliable, so a trailing decimal can change the counted precision of a value like 5000.

  • Time
    • 7 years — This is seven years, the amount of time asked for in a growth and inequality calculation and in the title of Lukas Graham’s song “7 Years.” The song reflects on childhood, age, and family through a series of snapshots across the singer’s life.
  • unit conversion
    • 2.5 kilometers to centimeters — This is a unit conversion problem: 1 kilometer equals 100,000 centimeters, so 2.5 kilometers becomes 250,000 centimeters.
  • units

    • 2 units — Two units is a standard numeric answer in series-capacitance, distance, and geometry calculation prompts. It appears when three identical 6-unit capacitors are placed in series and in other simple spatial-measurement questions.

    • 5 units — The answer is 5 units, commonly arising as the radius of a circle or the height of a trapezoid in basic geometry. It also appears in standard coordinate geometry problems such as finding the radius from x^2+y^2=25 or from the point (3,4).

  • Units of length
    • chain — A chain is a unit of survey measurement equal to 66 feet, or 100 links. The word also names a linked series of metal loops and appears in phrases like mail chain and chain gang.
  • volume
    • 1 liter — This is the amount of water that must be added in the dilution calculation to reach the target concentration. The required added volume is one liter.
• Measurement scales
  • pH scale — The pH scale is the logarithmic scale used to measure acidity and basicity, typically from 0 to 14. Pure water is neutral at 7, while lower values are more acidic and higher values are more basic.
• Measurement units

  • 12 units — A chord subtending an angle of π/3 radians in a circle of radius 12 has length 12 units. The same value appears in another circle-radius computation.

  • 13 units — Thirteen units is a standard geometry answer, including the diagonal of a 3-4-12 rectangular box and the maximum possible third side of a triangle with sides 6 and 8. It also appears in right-triangle and constraint-based calculation problems.

  • 20 meter — This is the length of a ladder leaning against a 10-meter wall at a 30-degree angle. The answer is 20 meters.

  • 20 seconds — This is the time cited in a free-fall or police-entry timing problem. The answer is 20 seconds.

  • Peck — A peck is a dry unit of measure equal to two gallons, or eight dry quarts.

  • units of measurement — A firkin, a palm, a perch, a puncheon, a bolt, and a hogshead are all units of measurement. The list mixes older dry and liquid measures with traditional length units.

    • Cord — A cord is a dry measure of wood and a unit of volume for firewood, equal to exactly 128 cubic feet. It is commonly defined as a stack 4 feet by 4 feet by 8 feet. The word can also mean a rope, which is the sense invoked in The Duchess of Malfi.

    • yard — A yard is a unit of length equal to three feet, and the word can also mean an enclosed open area next to a house or a rail yard. It can further refer to a pasture or to a spar on a sailing ship, depending on context.

    • League — A league is an old unit of distance, roughly the distance a person could walk in an hour. It also names the anti-imperial alliance supported by Pope Alexander III that fought German influence in northern Italy.

    • Energy units
      • small calorie — A unit of heat originally defined as the energy needed to raise one gram of water by one degree Celsius. It is approximately equal to 4.186 joules and is distinct from the dietary kilocalorie.
    • length units
      • ångström — The angstrom is a unit of length equal to one ten-billionth of a meter, often used for atomic-scale measurements. It is named for Anders Jonas Ångström, who also pioneered solar spectral analysis.
    • informal units
      • smoot — A smoot is an informal unit of length associated with MIT, defined from the height of Oliver Reed Smoot. It became famous from a prank measuring the Harvard Bridge in repeated smoot-lengths, and the name now denotes roughly 170 centimeters.
• metric prefixes

  • milli- — Milli- is the metric prefix for one-thousandth, the inverse of kilo-.

  • kilo- — Kilo- is the metric prefix meaning one thousand, as in kilometer. It is the prefix associated with a factor of 10^3 and contrasts with smaller prefixes such as milli-.

• Nautical units of length
  • fathom — A fathom is a nautical unit of length equal to six feet. It is traditionally measured as the distance between the fingertips of outstretched arms.
• Paper measurements
  • ream — A ream is a unit of paper equal to 500 sheets. The term is also used for paper quantities grouped into 20 quires, with a short ream sometimes defined as 480 sheets.
• pH
  • 1 × 10^-9 — This is the molar hydrogen-ion concentration of a solution at pH 9 and 25 degrees Celsius. The concentration is 1 × 10^-9 molar.
• quantities
  • 20 units — This is the maximum possible chord length in a circle of radius 10, and also the hypotenuse in a right-triangle computation. The result is 20 units.

• Scale — Scale is a quantity describing extent or size, often measured in units of length or distance. In geography and meteorology it appears in terms like large-scale and synoptic scale, while in music it also names an ordered series of pitches.

• SI prefixes

  • Pico- — Pico- is the SI prefix for one trillionth, or 10 to the minus 12. It is smaller than nano- and is used in metric notation for extremely tiny quantities.

  • mega — Mega is the SI prefix meaning one million, or ten to the sixth power. It also appears in words such as megaproject, megastructure, and megalopolis to indicate something very large.

• Time

  • 15 minutes — Fifteen minutes is the answer to a few rate-and-change calculations, including the time to half-fill a conical tank. It also appears in a timing rule about how early pre-trade prices must move before an IPO.

  • 2.1 hours — Working together, Spencer and Rachel would paint one room in 2.1 hours, or 2 hours and 6 minutes.

  • 20 hours — This is the time needed for McCain to match Obama’s speed in a racing comparison. It is also the time required for three people mowing a one-kilometer-square lawn to finish the job.

  • 8 years — This is eight years, the time in which a younger sibling becomes half as old as an older one in a simple age-ratio problem. It also appears as an approximate mourning period in a literary question about Bernarda.

• time intervals

  • 2 hours — Two hours became famous as the barrier Eliud Kipchoge broke in the marathon under controlled conditions in 2019. The same time interval also appears in a simple meeting-time word problem involving trains moving toward one another.

  • days

    • 10 days — Nixon resigned on August 9, 1974, and the House impeachment vote had been scheduled for August 19, making the gap ten days. This is the interval between the first and last dates of the Watergate-related resignation timeline referenced in the prompt.
• Units of distance
  • Nautical mile — A nautical mile is a unit of distance equal to one sixtieth of a degree of latitude or a great-circle degree.
• Units of length

  • Furlong — A furlong is an old English unit of length equal to one eighth of a mile, or 220 yards. It survives mostly in horseracing and other traditional measurements.

  • inch — An inch is a unit of length equal to one-twelfth of a foot and one-thirty-sixth of a yard. Since 1959 it has been defined as exactly 2.54 centimeters.

  • 1 foot — This is the answer to a unit-conversion or ladder-extension calculation. It is one foot, the length a map scaling or geometric setup in the prompts resolves to.

  • 1 mile — A unit of length equal to 5,280 feet, or eight furlongs, eighty chains, and about one-third of a league. It is also the distance from school where Lance is caught in a calculation about motion and relative speed, and the length of the track event whose record holders include Coe, Ryun, Morceli, and El Guerrouj.

  • 2 inches — A regular hexagon with side length 1 has long diagonals of length 2. The same value appears in table-top wargaming as a unit-coherency spacing distance.

  • 5 centimeters — This answer is five centimeters, a common calculation result in lens and prism problems. It can appear when balancing focal lengths or minimizing an integer height in a rectangular prism with square base.

  • League — A league is an archaic unit of distance, often treated as roughly the distance a person might walk in an hour. The term also names historical alliances such as the Delian League, the Hanseatic League, and the Schmalkaldic League.

  • meter — A meter is the SI base unit of length, now defined by the speed of light rather than by the old terrestrial prototype. In poetry, meter is the rhythmic structure built from feet, as in iambic pentameter or dactylic hexameter.

  • one centimeter — One centimeter is a unit of length equal to one hundredth of a meter. It is also a convenient cuvette path length in spectrophotometry, where molar absorptivity is often expressed using the reciprocal of that length.

  • Six feet — Six feet is the distance widely used in social-distancing guidance. It is also equal to two yards or 72 inches.

• Units of mass
  • Carat — A carat is a unit of mass used for gemstones, especially gold purity and precious stones. The term ultimately comes from the carob seed, whose nearly uniform weight made it useful for weighing metals.
• Units of measure

  • barrel — A barrel is a cask-shaped container and a unit name that also appears in the term for a group of monkeys. In U.S. usage, a barrel is also the standard measure for petroleum, equal to 42 gallons.

  • Time

    • 12 minutes — Twelve minutes is the combined work time in several rate problems, such as two people finishing a job together or converting 720 seconds into minutes. These clues rely on adding work rates or converting units.
• Units of time

  • A decade — A decade is a period of ten years, or one-tenth of a century. The term can also refer to the ten-bead division of the rosary consisting of an Our Father, ten Hail Marys, and a doxology.

  • second — The second is the SI unit of time and the base unit used to define hours and larger measures. It is defined by the radiation periods of cesium-133. It also appears in the phrase “second quantization,” but the core scientific clue is the time unit itself. There are 3600 seconds in an hour.

• Units of volume
  • butt — A butt is an old unit of volume, especially for wine, equal to two hogsheads. It is also the traditional amount of sack once given annually to England’s poet laureate.

Important Constants

Begin with π, e, and the golden ratio. Use the later constants and transcendence results as references when you reach series, analysis, and number theory.

• First Constants: π, e, and the Golden Ratio
  • pi — Pi is the mathematical constant and transcendental number equal to a circle’s circumference divided by its diameter, about 3.14. It appears in geometry and trigonometry, including formulas for radians, the area of a circle, Euler’s identity, the Basel problem, and Coulomb’s law-related constants.

    • Calculating pi — Calculating pi is the process of determining the value of the mathematical constant π to greater precision. Methods include Archimedes’ polygon bounds, Buffon’s needle experiment, Machin-like formulas, the Bailey-Borwein-Plouffe formula, and the Chudnovsky algorithm; modern record computations include y-cruncher.

    • Digits of pi — These are the digits of pi, the decimal expansion whose computation has been pushed to enormous lengths over time. Archimedes first approximated them geometrically by comparing polygons, and later calculations extended the record to millions and beyond.

  • Euler’s number — Euler’s number e is the base of the natural logarithm and a fundamental transcendental constant, approximately 2.71828. It can be defined by the limit (1 + 1/n)^n as n approaches infinity and by the series 1 + 1/1! + 1/2! + 1/3! + … It appears in exponential growth, compound interest, Taylor series, and Euler’s identity, e^(iπ) + 1 = 0.

  • the Golden Ratio or Divine Proportion — The golden ratio is the irrational proportion often written as phi, defined by the positive solution to x squared minus x minus 1 equals zero. It is famous in geometry and aesthetics and is sometimes associated, rightly or wrongly, with pyramids and other natural patterns.
• Further Constants, Series, and Transcendence

  • Apéry’s constant — ζ(3) = Σ 1/n³ ≈ 1.20206…; proved irrational by Roger Apéry (1979) in a result that shocked the mathematical community; whether ζ(3)/π³ is irrational remains open.

  • Transcendence of π — proved by Ferdinand von Lindemann (1882) using Hermite’s method; immediately settled the ancient problem of squaring the circle: it is impossible with compass and straightedge.

  • Hilbert’s seventh problem / Gelfond–Schneider theorem — if a is algebraic with a ≠ 0, 1 and b is algebraic and irrational, every value of aᵇ is transcendental. Aleksandr Gelfond and Theodor Schneider independently proved the theorem in 1934.¹

  • Chaitin’s constant — Chaitin’s constant, usually written omega, is the halting probability for a random program. It is noncomputable and transcendental, and its digits cannot be fully calculated.

  • Euler-Mascheroni constant — The Euler-Mascheroni constant, usually denoted gamma, is approximately 0.57721 to 0.577216. It is defined as the limit of the harmonic numbers minus the natural logarithm, and is also described by an integral involving e^{-x} and log x. It appears in analytic number theory, asymptotic estimates involving primes and harmonic sums, and other asymptotic formulas. Its irrationality remains unknown.

• special numbers
  • Bernoulli numbers — Bernoulli numbers are the rational sequence B_n that begins 1, -1/2, 1/12, with every odd term after the first equal to zero. They appear in power series for tangent and hyperbolic tangent functions and in formulas for sums of powers. Related variants of the same family include numbers defined by similar series with alternating signs and geometric factors.
• Mathematical constants

  • four pi — Four pi is the numerical factor equal to approximately 12.566, written exactly as 4π. It appears in electromagnetic formulas such as the relationship between the vacuum permeability and Coulomb’s constant.

  • pi squared over six — Pi squared over six is the value of zeta of 2, which also solves the Basel problem. It appears in the asymptotic probability that an integer has no repeated prime factors.

  • 4pi — The arc length corresponding to an 80-degree central angle in a radius-9 circle is 4pi. In physics, the same number appears in the uncertainty principle, where Planck’s constant is divided by 4pi in one common form.

Functions, Coordinates, and Graphs

Build on algebra to read functions and coordinate graphs before trigonometry and calculus.

• One-to-one function (injective function) — a function f: A → B in which distinct inputs map to distinct outputs: f(x₁) = f(x₂) ⟹ x₁ = x₂; equivalently, no two elements of the domain share the same image; the horizontal line test detects whether a function’s graph is one-to-one; a function that is both injective (one-to-one) and surjective (onto) is bijective, meaning it has a well-defined inverse function; important in cryptography (injective encryption functions) and formal logic; contrasted with a many-to-one function (like f(x) = x²) which is not injective.

• Cartesian coordinates — Descartes’ analytic geometry (17th century) assigned numerical coordinates to geometric points, bridging algebra and geometry.

• Distance formula — d = √((x₂ − x₁)² + (y₂ − y₁)²) in the Euclidean plane.
  • 2√13 — The distance between the points (3,4) and (7,-2) is 2√13. The same value also appears as the hypotenuse of a right triangle with legs 4 and 6.
• Polar coordinates — alternative 2D coordinate system using distance r from the origin and angle θ from the positive x-axis; x = r cos θ, y = r sin θ; simplifies equations of circles, spirals, and roses. It is also the two-dimensional system behind complex numbers in trigonometric form and the basis for cylindrical coordinates. Cartesian coordinates are converted with r = sqrt(x^2 + y^2) and θ from arctan(y/x).

  • circular polar coordinates — Circular polar coordinates are a two-dimensional coordinate system using a radius r and an angle theta. They relate to Cartesian coordinates by x = r cosine theta and y = r sine theta.

  • radial — Radial refers to the direction along the radius, the non-angular coordinate in polar coordinates. The term also describes radial nodes in orbitals and the radial part of the hydrogen atom wavefunction.

• functions — In mathematics, functions are relations that assign each input exactly one output, a property tested by the vertical line test. They map inputs to outputs and in calculus may be described by properties such as continuity and differentiability. In computer science, a function can also mean a procedure or subroutine; functions may be recursive, higher-order, or anonymous, and are central to functional programming.
  • bijections

    • bijection — A bijection is a function that is both one-to-one and onto, so every element of the codomain is paired with exactly one element of the domain. It is also called an invertible function or one-to-one correspondence.

    • bijective — A bijective function is both injective and surjective, so each element of the domain pairs with exactly one element of the codomain. Such a function has an inverse and, in set theory, gives a one-to-one correspondence between sets.

  • Domain — A function’s domain is the set of allowed input values. In algebra and analysis, the word also appears in more specialized senses, such as an integral domain or a connected open set.
    • Domain of a rational function — This is a rational function domain question asking which x-values make the denominator zero. The denominator factors to exclude x = -1 and x = 7.

  • domains — A domain is the set of inputs for a function, and in ferromagnetism it can also mean a region where atomic spins align parallel. The same word also names higher taxonomic ranks in biology, above kingdom and below empire.

  • even function — An even function is one whose values satisfy f(x) = f(-x). Its graph is symmetric about the y-axis.

  • exponential — Exponential describes functions, growth, or decay of the form b to the x, including radioactive decay and the inverse relationship to logarithms. The same term names the exponential distribution and appears in models of bacterial growth, Poisson processes, and differential equations of the form dx/dt = kx.

  • exponential function — The exponential function is the standard function written as e^x or exp(x), whose derivative is itself and whose inverse is the natural logarithm. It is built from the base e raised to a variable power, has the power series ∑ x^n/n!, and models compound growth. It also appears in differential equations and Laplace transforms.
    • exponential function or distribution or map — The exponential function is the standard function that equals its own derivative and inversely relates to the natural logarithm. It also names a memoryless probability distribution and a Lie-group map built from exponentiating algebra elements.
  • exponential functions — Exponential functions are of the form b^x or e^x, and they are inverses of logarithmic functions. Their derivatives are proportional to the original function, and they model growth and decay such as population change and radioactivity.

    • (natural) exponential function — The natural exponential function is the function commonly written with base e raised to x. It is the only nonzero function equal to its own derivative, and Euler’s formula connects it to cis theta.

    • exponential decay — Exponential decay is a decrease in which a quantity falls by a constant proportion over equal time intervals. It also describes the form of a tunneling wavefunction outside a finite square well and the time dependence of many first-order reactions.

    • y = e^(2x) — This is the inverse of y = one-half times the natural logarithm of x. Taking the inverse of that logarithmic function gives y = e^(2x).

  • function — A function is a relation or mapping that assigns each input exactly one output, and functions can be composed, inverted when bijective, and studied in settings from analysis to programming. Examples include holomorphic, entire, and real-valued functions, as well as subroutines in computer science.

  • function composition — Composition is the operation of applying one function to the result of another, written f after g or g ∘ f. It is central to the chain rule and to the structure of transformation monoids and functional powers.
    • 8x2 - 17 — This answer is eight x squared minus seventeen, the result of composing f(x)=4x+3 with g(x)=2x squared minus 5. It is a routine function-composition calculation.

  • identity function — The identity function sends each input to itself and is the neutral map for composition; in algebra it is the value preserved by expressions like x + 0 = x. In the plane, it is represented by the line y = x, which has slope 1, output equal to input, and reflects points by swapping their x- and y-coordinates.

  • injective — A function is injective, or one-to-one, when distinct inputs always map to distinct outputs. This is the property tested by the horizontal line test and is equivalent to having a trivial kernel in many algebraic settings. In category and module theory, injectivity also appears in Baer’s criterion and in exact-sequence language. A bijection is both injective and surjective.

  • Injective functions
    • injectivity — Injectivity is the property of a function that maps distinct inputs to distinct outputs. A function is injective when f(a)=f(b) implies a=b, equivalently if f(x1)=f(x2), then x1=x2. In linear algebra this is equivalent to having a zero kernel, and in algebra and category theory the term is used for one-to-one maps. Such functions pass the horizontal line test and, together with surjectivity, give a bijection.

  • inverse function — An inverse function undoes another function by sending outputs back to their original inputs. It is often written with a superscript minus one and, when composed with the original function, gives the identity.

  • linear function — A linear function grows in direct proportion to its input, so algorithms that scan an array or linked list one element at a time run in linear time. This runtime also appears as the best case for bubble sort and the worst case for searching an unbalanced binary search tree.

  • parametric — Parametric describes a family of methods or formulas defined by one or more parameters rather than directly by ordinary variables. In physics and optics, the word appears in processes such as parametric down-conversion and parametric amplification.

  • parity

    • even functions — Even functions satisfy f(x)=f(-x), so their graphs are symmetric about the y-axis. Examples include the cosine function, the Gaussian function, and other expressions unchanged by replacing x with negative x.

    • Odd functions — Odd functions are functions satisfying f(-x) = -f(x), so their graphs are symmetric about the origin. Over any interval symmetric about 0, their contributions cancel, which is why the definite integral from -a to a is zero. Examples include x sin x, sin 2x, and tan x.

  • periodic functions
    • periodic — A periodic function repeats after a fixed interval, so its values recur at regular spacing in time or space. The same idea appears in periodic orbits, limit cycles, and in crystals described by Bloch’s theorem.
  • ranges
    • y is less than or equal to -4 — This is the range of the downward-opening parabola y = -x^2 + 2x - 5. Its maximum occurs at the vertex, giving y less than or equal to -4.
  • Reciprocal functions
    • Reciprocal function — The reciprocal function sends a nonzero number x to 1/x, its multiplicative inverse. Its graph is a hyperbola with asymptotes on the coordinate axes. It is the basic example behind the harmonic series, appears in harmonic means, and is used in calculus and asymptotics, including the derivative of the natural logarithm and rate-law formulas. It is also written as x to the negative one, and cosecant is the reciprocal of sine.

  • support — In mathematics, the support of a function is the set where it is nonzero, and for a vector it is the set of coordinates that are nonzero. The support of a bump function is compact, and the L0 pseudonorm counts the size of this set.

  • surjective — A function is surjective when every element of the codomain is hit by at least one element of the domain; equivalently, it maps onto its codomain. The term is used throughout algebra and topology, including in discussions of coverings, epimorphisms, and smooth maps.
• Mathematical functions
  • monotonicity — Monotonicity is the property of always moving in one direction, with functions that are either nondecreasing or nonincreasing. In econometrics and causal inference, it is one of the assumptions used to identify local average treatment effects by ruling out defiers.

    • monotone — A monotone or monotonic function preserves order, as in a function that is entirely nondecreasing or nonincreasing. The same adjective also appears in economics and probability when describing preferences, comparative statics, and sequences that converge nicely under Dini’s theorem.

    • increasing — Increasing describes a function or sequence whose values rise as the input grows, so larger x-values correspond to larger y-values. The term also appears in monotonicity tests and in basic calculus examples such as y = x and y = x cubed.

  • sigmoid functions
    • logistic function — The logistic function is the familiar S-shaped curve used for population growth, with standard form 1 over 1 plus e to the minus x. It also appears as a common activation function in neural networks and in logistic regression through the log-odds transform.
      • the logistic function — The logistic function is the S-shaped curve given by 1 over 1 plus e to the negative t. It appears in models of population growth and approaches two horizontal asymptotes.
• homogeneous functions
  • homogeneous — Homogeneous means the same throughout, whether applied to a mixture, a material, or a mathematical object. In physics and cosmology, it can describe a uniform universe or reactants and catalysts in the same phase. In mathematics, homogeneous functions scale in a predictable way when their inputs are multiplied by a constant, and homogeneous deformation means the deformation gradient does not vary with position.

• Midpoint of a line segment — The midpoint of the segment joining (3, 7) and (8, 12) is (11/2, 19/2), or equivalently (5.5, 9.5).

• distance — Distance is the quantity measuring how far apart two points or objects are. In astronomy it appears in parsecs, light-years, parallax, and the distance modulus; in mathematics it is defined by norms and metrics such as Euclidean and taxicab distance. It also underlies Hubble’s law and many methods on the cosmic distance ladder.
  • 60 feet — This answer is sixty feet, a measurement that appears in several basic geometry and real-world distance questions. It can refer to the length from the foul line to the head pin in bowling or the distance between bases on a little league diamond.
• Analytic geometry
  • coordinates
    • 5/8 — The point (5,8) is the coordinate pair reached in the arithmetic clues here, and it is also the vertex found from a parabola with focus (3,8) and directrix x = 7. The other clue asks for the two roots of x^2 - 3x - 40, but the shared answer family is the ordered pair five, eight.
• Coordinate geometry

  • abscissa — An abscissa is the x-coordinate of a point in the Cartesian plane. It is paired with the ordinate, the y-coordinate.

  • Bottom left — The bottom left of a graph or table is the direction associated with white dwarfs on the H-R diagram and with increasing atomic radius on the periodic table. Both clues point to the lower-left corner as the relevant answer.

  • cylindrical — Cylindrical geometry is the shape associated with coordinates using r, theta, and z. It also describes a solenoid and the surface formed by extending a curve along a straight line.

  • Cartesian coordinate system — The familiar x-y coordinate system used to locate points in a plane. It is the two-dimensional coordinate plane of analytic geometry, named for René Descartes, whose work introduced coordinates into geometry. In computational chemistry, it is often replaced by a Z-matrix for molecular geometry.
    • quadrants — Quadrants are the four regions of the Cartesian plane formed by the signs of x and y coordinates. The four sections are defined by whether coordinates are positive or negative.

      • first and third quadrants — The first and third quadrants are the regions where sine of two x is positive. This follows from the sign pattern of sine across the coordinate plane.

      • first quadrant
        • first quadrant only — A graph restricted to the first quadrant lies entirely where both coordinates are positive. Quadrant I is the only quadrant in that region of the Cartesian plane.
      • Quadrant II — Angle theta lies in quadrant II when cotangent is negative and cosecant is positive.
  • Intercepts
    • y-intercept — The y-intercept is the point where a graph crosses the vertical axis, or where x equals 0 in a linear equation. In slope-intercept form y = mx + b, the parameter b gives the y-intercept. It is the vertical-axis analogue of the x-intercept.

  • origin — The origin is the point on the Cartesian plane where the x-axis and y-axis intersect, at coordinates (0,0). The sine function passes through this point when x = 0.

  • y-axis
    • x = 0 — The singular point here is x = 0, the place where an equation has been manipulated in a way that can create an extraneous solution. It is also the axis of symmetry for the parabola x^2 - 4y.
• Coordinates
  • Ordinate — The ordinate is the y-coordinate of a point in the Cartesian plane. It is paired with the abscissa, the x-coordinate.
• Graphs and curves
  • asymptotes — Asymptotes are lines that a graph approaches without intersecting, such as the vertical asymptote of 1/x or the horizontal asymptotes of logistic curves. Hyperbolas commonly have two asymptotes, and slant asymptotes occur when rational functions have a larger numerator degree than denominator degree.

    • asymptote — An asymptote is a line that a function or curve approaches arbitrarily closely without reaching. They can be vertical, horizontal, or oblique, and they appear in topics from rational functions to perturbation theory and hyperbolas.

    • horizontal asymptote — A horizontal asymptote is the line a graph approaches as x goes to positive or negative infinity while the function approaches a finite y-value. Exponential functions commonly have a horizontal asymptote.

    • horizontal asymptotes

      • y = 3/2 — This is the horizontal asymptote of rational functions such as 3x^2/(2x^2 + x + 1) and (3x - 1)/(2x + 5). It is found by comparing leading terms or degrees, and in both cited examples the end behavior approaches a constant ratio.

      • y equals 6 — This is the horizontal asymptote of the rational expression x = y/(y - 6). The asymptote occurs where y approaches 6.

    • vertical asymptote — A vertical asymptote is a line that a function approaches without reaching, often appearing where the function blows up near a point outside its domain. Functions like one over x have this feature along the y-axis, which signals failure of uniform continuity in the relevant examples.

    • Vertical asymptote at x = 0, horizontal asymptote at y = 0 — This rational function has a vertical asymptote at x = 0 and a horizontal asymptote at y = 0. Those asymptotes come from the denominator’s higher power of x and the fact that the denominator grows faster than the numerator at large x.
• Inverse variation
  • 0.25 — If x varies inversely as y squared and x equals 4 when y equals 5, then x equals 1/4 when y equals 20. The setup is a straightforward inverse-variation computation.

Sets, Logic, and Proof

Learn sets, logical statements, and proof methods before the later mathematical subjects.

Set Theory and Logic

• Propositional logic — connectives AND (∧), OR (∨), NOT (¬), implication (→), biconditional (↔); truth tables determine validity.

• First-order logic — adds quantifiers ∀ (for all) and ∃ (there exists) to propositional logic. It is also called predicate logic. In this basic form, predicates and functions are not quantified, and modal logic can be studied as a fragment of it; it is often associated with Gödel’s completeness theorem and ZF set theory.

• set theory — The branch of mathematics devoted to sets, unordered collections of distinct elements usually written with curly braces. It studies their structure, size, and relationships, including union, intersection, cardinality, and Venn diagrams, and underlies modern axiomatic systems such as the Zermelo-Fraenkel system with the axiom of choice (ZFC), including extensionality and regularity. It is associated with Russell’s paradox, Cantor’s work on infinite cardinalities, Zorn’s lemma, and forcing.

  • absoluteness — Absoluteness is the property of a statement or formula having the same truth value across relevant models or extensions. It underlies results in set theory such as Shoenfield absoluteness and helps explain why countability can depend on the model.

  • Axiom of regularity — The axiom of regularity, also called the axiom of foundation, is a ZF axiom that prevents a set from containing itself and rules out infinite descending membership chains. It says every nonempty set has an element disjoint from the set, and alternative set theories sometimes replace it with anti-regularity statements.

  • axiomatic set theory
    • Ernst Friedrich Ferdinand Zermelo — Ernst Zermelo was a German mathematician associated with the Axiom of Choice and the Well-Ordering Theorem. He also helped found set theory axiomatics with a seven-axiom system later extended by Fraenkel, and his name appears in the Zermelo-Fraenkel framework.
  • cardinal numbers — Cardinal numbers are the values used to measure the size of a set, from finite counts to aleph-zero and beyond. They are contrasted with ordinal numbers, and clues often mention Cantor, countable infinity, and the continuum hypothesis.

    • aleph null — Aleph null is the cardinality of the natural numbers and the smallest transfinite number. It is the size shared by any countably infinite set, such as the integers or rationals.

    • Aleph numbers — Aleph numbers are the cardinals used to measure the sizes of infinite sets. The smallest of them, aleph-null, is the cardinality of the natural numbers.

  • Cartesian products
    • Cartesian product — The Cartesian product is the set of all ordered pairs formed from two sets, and it underlies product spaces in topology. It is central to Tychonoff’s theorem and can be contrasted with the box topology or the graph-theoretic product.
  • choice principles
    • axiom of choice — The axiom of choice is the set-theoretic principle that for any collection of nonempty sets, one can choose an element from each set. It is equivalent to Zorn’s lemma and the well-ordering principle/theorem, and it underlies vector-basis arguments as well as results such as the Banach-Tarski paradox and the Hairy Ball Theorem. It is independent of ZF plus the continuum hypothesis.
  • continua
    • continuum — A continuum is a set or range in which between any two elements there is another element. The term also appears in set theory in the continuum hypothesis and the cardinality of the reals.
  • countable sets
    • countability — Countability is the property of a set that can be put in bijection with the natural numbers. The integers and rationals are countable, while the reals are not, a fact shown by Cantor’s diagonal argument and used in discussions of aleph-null.
      • countable — A set is countable, or denumerable, if its elements can be put into one-to-one correspondence with the natural numbers, so its elements can be listed by an enumeration. It is countably infinite when it has cardinality aleph-null. The integers and rational numbers are countable; the real numbers are not, as shown by Cantor’s diagonal argument. The computable numbers are also countable.

  • diagonal method — Cantor’s diagonal method is a proof technique used to show that the real numbers are uncountable. It works by constructing a new object that differs from each listed object in at least one diagonal position.

  • empty set — The empty set, also called the null set, is the set with no elements. It is symbolized by the circle with a slash or by the null set notation. It is the intersection of any two disjoint sets, is a subset of every set, and the product of anything with it is itself. It is a measure-zero set and a basic object in operations such as union and intersection.

  • equivalence relations — Equivalence relations are binary relations that are reflexive, symmetric, and transitive. They correspond to partitions of a set, with the elements grouped into equivalence classes.
    • equivalence classes
      • equivalence class of y — The equivalence class of y under an equivalence relation is the set of all elements related to y. It partitions a set into classes whose members are mutually related by a reflexive, symmetric, and transitive relation.
    • equivalence relation — An equivalence relation is a binary relation that is reflexive, symmetric, and transitive. Its equivalence classes partition the underlying set, and standard examples include congruence modulo n and geometric similarity.

  • Ernst Zermelo — Ernst Zermelo was the mathematician who gave the first axiomatic description of set theory. The Zermelo–Fraenkel system of set theory is named for him and Adolf Fraenkel.

  • finite sets
    • finiteness — Finiteness is the property of having cardinality equal to some natural number. In set theory it is contrasted with infiniteness, and finite sets play a central role in notions such as hereditarily finite sets and Dedekind finiteness.

  • forcing — Forcing is Paul Cohen’s method for constructing new set-theoretic models by adjoining generic filters to partial orders. It is used to prove independence results such as the failure of the continuum hypothesis, and comes in forms like Easton forcing and Laver forcing.

  • Georg Ferdinand Ludwig Phillip Cantor — Georg Ferdinand Ludwig Philipp Cantor was a German-born mathematician best known for founding set theory and for proving that the real numbers are uncountable. His name appears in results about diagonal arguments, cardinalities, the continuum hypothesis, and the Cantor set.

  • George Cantor — George Cantor, better known as Georg Cantor, founded set theory and transformed mathematics with transfinite numbers. His work includes the theorem showing that a power set has greater cardinality than its parent set. He is also associated with the Cantor set, a fractal-like object that appears in topology and analysis. Questions often mention his struggles with depression and the famous remark by Poincaré that his ideas were a disease mathematics would later recover from.

  • infinite sets — Infinite sets are sets with unlimited size, including both countable and uncountable collections. In set theory, the axiom of infinity guarantees that such a set exists.

  • intersection — The intersection of two sets is the set of elements they share, usually symbolized by an upside-down U. In topology and algebraic geometry, the same idea appears in subspaces, closed sets, and Chow rings, where it underlies terms like intersection theory.

  • large cardinals
    • Large cardinal axioms — Large cardinal axioms are strong set-theoretic assumptions asserting the existence of very large infinite cardinals beyond what ZFC can prove. They form a hierarchy that includes measurable, inaccessible, and other increasingly powerful kinds of cardinals.
  • ordinal — Ordinals are numbers that describe position or order rather than quantity, and in set theory they are the order types of well-ordered sets. They extend the natural numbers through the least infinite ordinal omega and beyond, and can also be defined as transitive sets well-ordered by the epsilon relation. Ordinal arithmetic can behave counterintuitively, for example omega plus one is different from one plus omega. Cardinals are a related notion, but ordinals retain information about order as well as size.
    • 9th — Ninth is a recurring ordinal answer in questions about standings, constitutional amendments, symphonies, and Dante’s Inferno. It points to the Ninth Amendment, the Ninth Symphony, and the Ninth Circle of Hell.
  • ordinals and cardinals
    • transfinite — Transfinite describes constructions and sequences indexed by ordinal numbers beyond the finite, such as those used in set theory and in proofs like Zorn’s lemma. The term also appears in the definition of transfinite numbers such as aleph-null and epsilon numbers.
  • Paradoxes
    • Russell paradox — Russell paradox is the set-theoretic contradiction that arises from considering the set of all sets that are not members of themselves. It shows that the collection cannot consistently be treated as either a member of itself or not a member of itself.

  • power set — The power set of a set is the set of all its subsets, including the empty set and the set itself. If a set has n elements, its power set has 2^n elements.

  • power sets
    • power set of A — The power set of a set A is the set of all subsets of A. If A has n elements, its power set has 2 to the n elements and is central in questions about cardinality and the generalized continuum hypothesis.

  • relation — A relation is a subset of the Cartesian product of a set with itself. Relations may have properties such as reflexivity and transitivity.

  • set operations
    • set intersection — The intersection of two sets is the set of elements common to both. In a Venn diagram it is the overlapping region, and by De Morgan’s laws it corresponds to the complement of a union of complements.

  • symmetric difference — The symmetric difference of two sets consists of the elements that are in exactly one of the sets, not both. It is often denoted by a triangle or circled plus and is the operation that gives the union when the sets are disjoint.

  • transfinite numbers — Transfinite numbers are Cantor’s orders of infinity, extending finite counting into a hierarchy of larger cardinal and ordinal notions. Examples include the aleph numbers and the ordinal omega, which represents the order type of the nonnegative integers.
    • transfinite number — A transfinite number is a size of infinity larger than the integers, and Cantor showed that the real numbers define such a higher infinity. This term is also used for noncountable cardinalities.

  • union — In U.S. political history, union refers to the national Union defended by Webster and Calhoun and invoked by the Constitution’s goal of forming a more perfect union. In set theory, a union is the operation that combines sets to include every element found in either set, often written with a cup symbol.

  • Venn diagrams — Venn diagrams are overlapping-circle graphics used to show relationships among sets. They are named for John Venn and are commonly used in logic, syllogisms, and basic set comparison.
    • Venn diagram — A Venn diagram is a set diagram that uses overlapping circles to show intersections and differences among sets. Non-overlapping circles represent disjoint sets. These diagrams are named for John Venn and are often used as simple visual organizers for set relations.

  • Zermelo-Fraenkel set theory — Zermelo-Fraenkel set theory is the standard axiomatic foundation of set theory, usually formulated in first-order logic. It is often paired with the axiom of choice, yielding ZFC. Its axioms include union, pairing, power set, replacement, and regularity, and it is the framework in which the continuum hypothesis is independent.

  • Zorn’s lemma — Zorn’s lemma states that if every chain in a partially ordered set has an upper bound, then the set has a maximal element. It is equivalent to the axiom of choice and is often used to prove the existence of nonprincipal ultrafilters.
• Set theory paradoxes
  • Cantor paradox — The Cantor paradox is the apparent contradiction that the set of all sets would have to be both a set and larger than its own power set. It highlights the inconsistency behind naive reasoning about the size of the universe of sets.
• set operations
  • set union — Set union is the operation that combines all elements belonging to either of two sets. It includes elements in the overlap as well, and adjoining a set with its complement yields the universal set.
• De Morgan’s laws — negating an AND gives an OR of the negations: ¬(P ∧ Q) ≡ ¬P ∨ ¬Q. Negating an OR gives an AND: ¬(P ∨ Q) ≡ ¬P ∧ ¬Q. For sets, the corresponding identities are (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ and (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ.² These identities are fundamental in logic, Boolean algebra, and circuit simplification.
  • De Morgan’s theorem — This Boolean algebra theorem gives the rules for negating conjunctions and disjunctions: not (A and B) becomes not A or not B, and not (A or B) becomes not A and not B. It is widely used in circuit design and in expressing circuits with only NAND or NOR gates.

• Cantor’s set theory — Georg Cantor (1874 onward) formalized infinite sets and showed that not all infinities are equal in size.

• Cardinality —

  ℕ

  = ℵ₀ (countably infinite); Cantor’s diagonal argument proves

  ℝ

  >

  ℕ

  ; the real numbers are uncountably infinite. A cardinal number measures the size of a set, and two sets have the same cardinality exactly when there is a bijection between them. Infinite cardinals are written with aleph numbers.

  • Schroeder-Bernstein — The Schroeder-Bernstein theorem says that if each of two sets injects into the other, then the two sets are in bijection and therefore have the same cardinality.

  • Schroeder-Bernstein theorem — The Schroeder-Bernstein theorem says that if each of two sets injects into the other, then the two sets are in bijection, so they have the same cardinality. It is a basic set-theoretic result for comparing infinite cardinalities and can be proved without the axiom of choice.

• Cantor’s theorem — for any set S, the power set P(S) has strictly greater cardinality; there is no largest infinity.

• Zermelo-Fraenkel axioms (ZFC) — standard axiomatic foundation for set theory, including the axiom of choice (C); the axiom of choice is equivalent to the well-ordering theorem and Zorn’s lemma.

• Continuum hypothesis — the assertion that there is no infinite cardinality between ℵ₀ and

  ℝ

  ; shown to be independent of ZFC set theory (Gödel 1940, Cohen 1963). It was proposed by Cantor and is often formulated as asking whether there is any set of real numbers with cardinality strictly between the integers and the continuum.

  • the continuum hypothesis — The continuum hypothesis states that there is no set whose cardinality lies strictly between that of the integers and that of the real numbers. It is the first of Hilbert’s problems and a classic question of set theory associated with Cantor.

• Russell’s paradox — naive set theory is inconsistent: the set of all sets that do not contain themselves leads to a contradiction; motivated formal axiomatization (Bertrand Russell, 1901). It is also associated with Bertrand Russell’s 1901 formulation and is a classic impetus for formal axiomatization of set theory, including later axiomatic foundations such as Zermelo-Fraenkel set theory and type theory.

• Gödel’s completeness theorem — (1929, Gödel’s dissertation) every valid first-order sentence (true in all models) has a formal proof; distinct from and opposite to the incompleteness theorems, which address specific axiom systems for arithmetic.

• Gödel’s incompleteness theorems — (1931) First theorem: any consistent formal system strong enough to express basic arithmetic contains true statements that cannot be proved within the system. Second theorem: such a system cannot prove its own consistency. Also called the first and second incompleteness theorems.

• Cardinal and ordinal numbers — cardinals measure set size; ordinals encode order type. Cantor showed infinite cardinals themselves form a hierarchy (ℵ₀ < ℵ₁ < …).

• complementarity
  • complementary — Complementary things complete or fit together, such as angles that add to 90 degrees or sets related by set complement and De Morgan’s laws. In genetics, complementarity also describes the recovery of wild-type phenotype when different mutants are crossed.
• order theory

  • ordered — An ordered set is one in which elements can be compared by a relation such as less than or equal to, and it may be total, partial, or well-ordered. In set theory, ordinals and well-orders are built from this kind of structure. The surreal numbers form a universal totally ordered field, while posets are partially ordered sets.

  • bounds and extrema
    • supremum — The supremum of a set is its least upper bound, the bound that is contrasted with the infimum. This notion appears in real analysis, lattice theory, and the definition of the essential versions of extrema in Lp spaces.
  • maximal elements
    • maximal — In ring theory and order theory, maximal objects are those that cannot be properly extended within a given structure. The adjective also appears in the maximal clique problem and in the Hausdorff maximal principle, an equivalent formulation of the axiom of choice.

  • Poset — A set equipped with a partial order, meaning a relation that is reflexive, antisymmetric, and transitive, so some elements may be incomparable. Standard examples include inclusion on a power set and divisibility on the natural numbers. Posets are often represented by Hasse diagrams.

  • Well-ordered set
    • well-ordered — A well-ordered set is one in which every nonempty subset has a least element. Well-ordering is closely tied to the axiom of choice and can be represented with Hasse diagrams when discussing partial orders.
  • well-orderings
    • well-ordering — A well-ordering is a total ordering in which every nonempty subset has a least element. Any set can be given a well-ordering assuming the axiom of choice, and each well-ordered set is isomorphic to an ordinal.
      • well-ordering principle — The well-ordering principle, also called the well-ordering theorem, says every nonempty subset of the natural numbers has a least element. It is closely tied to induction and infinite descent, is a standard tool for proofs by infinite descent, and underlies many proofs about the integers. One record also says it is equivalent to the existence of injections between any two sets.
• uncountability — Uncountability is the property of a set too large to be put into one-to-one correspondence with the natural numbers. Cantor’s diagonal argument is the standard proof that the real numbers have this property.
  • uncountable — A set is uncountable if it cannot be put into a one-to-one correspondence with the natural numbers. Cantor’s diagonal argument shows that the real numbers are uncountable, and the same property appears in complete metric spaces with no isolated points.
• foundations of mathematics
  • Type theory
    • Theory of types — Russell’s theory of types is a logical hierarchy designed to block vicious-circle paradoxes in the foundations of mathematics. It classifies propositions and properties by level and order, and is commonly associated with Principia Mathematica.
• Boolean algebra
  • Logic minimization
    • Karnaugh map — A Gray-code arrangement used to simplify Boolean expressions and reduce logic circuits by making minimization easier. It turns a truth table into a diagram that helps identify adjacent true values and prime implicants, and is a standard tool in switching theory and logic design.
  • Logical conjunction
    • AND — AND is the Boolean conjunction true only when all inputs are true, and it corresponds to multiplication in propositional logic. It appears in logic gates, half adders, and short-circuit programming operators, and is often symbolized by an ampersand. The same word also names the two countries in the Russo-Japanese War clue set, especially Russia and Japan.
  • simplification
    • prime implicants — In Boolean algebra, prime implicants are the irreducible product terms or sum terms that cover a function without any removable literals. They are found in simplification methods such as Quine-McCluskey and Petrick’s method.
• Boolean logic
  • truth values
    • 1 and 0 — These are the two values used in standard Boolean logic. They represent truth and falsehood: 1 and 0.
• Formal systems
  • formal — Formal refers to things defined by structure, rule, or form rather than material content. It appears in logic and mathematics in phrases such as formalism and formal language.
• foundations
  • Postulate — A postulate is a statement accepted as true without proof for the sake of argument or scientific inquiry. In geometry, it is a basic assumption rather than a theorem.
• logic

  • Begriffsschrift — Begriffsschrift is Gottlob Frege’s 1879 work whose title means “concept-script.” It introduced a formal logical notation intended to show that arithmetic could be derived from logical axioms.

  • disjunction — Disjunction is the logical operator often written as a wedge, as logical or, or in programming as double vertical bars. It is true when at least one input is true and false only when both parts are false; the programming form short-circuits when the first operand is already true. It appears in first-order logic, philosophical paradoxes, and free-choice inferences.

  • if Q, then P — The converse of “if P then Q” is “if Q then P.” It swaps the hypothesis and conclusion without using negation, unlike the contrapositive.

  • vacuous truth — Vacuous truth is the kind of truth assigned to a conditional statement when its antecedent can never be satisfied. Because the triggering case is impossible, statements like ‘if Tokyo is in France, then the Eiffel Tower is in Bolivia’ count as true. The idea is often contrasted with broader theories of truth and with tautologies.
    • vacuously true — A statement is vacuously true when its antecedent is false, as in the case of a conditional involving the empty set. The phrase is used in logic to describe truths that follow from an impossible or empty condition.
  • fuzzy logic
    • Fuzzy — Fuzzy logic is the logical framework in which truth values can range continuously between 0 and 1. The same adjective also describes approximate string searching methods such as fuzzy string searching.
  • biconditional
    • if and only if — “If and only if” is the biconditional connective used to state a necessary and sufficient condition. In logic, it means each statement implies the other and is often abbreviated iff.

  • Boolean operators — Boolean operators are the logical connectives AND, OR, and NOT used in search and symbolic logic. They link terms in queries and Boolean algebra expressions.

  • classical logic
    • law of the excluded middle — The law of the excluded middle states that for any proposition, either it or its negation must be true. It is a basic principle of classical logic but is rejected by intuitionistic and fuzzy logics.
  • Conditional statements
    • the contrapositive — The contrapositive of a conditional statement is formed by negating both terms and reversing their order. It is logically equivalent to the original conditional, and the rule of modus tollens relies on this equivalence.
  • consistency — In logic, consistency is the property of a formal system or theory having no contradictions. The term also appears in discussions of Gödel’s incompleteness theorems and in material science as a measure of thickness or flow behavior.
    • consistent — In logic and mathematics, a system is consistent if it does not lead to a contradiction. In AI search, a heuristic with this property helps ensure A* behaves optimally and that estimated path costs do not decrease along a path.
  • contrapositive — In logic, the contrapositive of a conditional or implication “if P then Q” is “if not Q then not P,” formed by swapping the antecedent and consequent and negating both parts. It is logically equivalent to the original statement and is often used in indirect proofs.
    • If not Q, then not P — The contrapositive of “if P, then Q” is “if not Q, then not P.”
  • logicians
    • John Venn — John Venn was the logician remembered for Venn diagrams, the overlapping-circle visual shorthand for set relations. His work later became associated with British pragmatism and the development of analytical philosophy.

  • modus tollendo ponens — Modus tollendo ponens is the disjunctive syllogism that infers q from p or q together with not-p. It is a standard rule of inference used in formal logic.

  • negation — Negation is the logical or grammatical operation that turns a statement or expression into its opposite. In logic, it is the unary Boolean operator that flips true to false and false to true, commonly represented by symbols such as a tilde, an apostrophe, an exclamation point in some languages, a barred proposition, or the word not. It underlies De Morgan’s laws and NAND. In language, it is often marked by not or n’t, and its study includes Jespersen’s cycle, negative concord, and double negatives in English and other languages.

  • nonclassical logic
    • intuitionistic logic — Intuitionistic logic is a nonclassical logic associated with Brouwer, constructive mathematics, and the BHK interpretation. It rejects excluded middle and double negation elimination and can be modeled with Heyting algebras or Kripke semantics.
  • Paradoxes
    • Berry paradox — The Berry paradox is the self-referential puzzle behind phrases like “the smallest positive integer not definable in fewer than twelve words.” It is named for a junior librarian associated with Russell and is often used in discussions of definability and Kolmogorov complexity.
  • predicate functions
    • predicate function — In Russell’s theory of types, a predicate function is a function that can take arguments and be used as a variable at higher orders. Its type is determined by the number and kind of arguments it accepts.
  • proof techniques
    • proof by contradiction — Proof by contradiction is an indirect proof technique that starts by assuming the negation of the statement to be proved and then derives an impossibility or contradiction, forcing the original assumption to be false. It is closely associated with reductio ad absurdum and with the classical use of double negation; a common application is proving the irrationality of the square root of 2.
  • proofs — Proofs are logical arguments that establish a proposition or statement from axioms, accepted rules of inference, or other starting assumptions. They are used in mathematics, logic, cryptography, and complexity theory, including interactive proofs and probabilistically checkable proofs. Geometry classes often present them in two-column form. Proofs also title a David Auburn play about a young mathematician, and in Tom Stoppard’s Arcadia Thomasina Coverly is urged to create one for Fermat’s Last Theorem. Pythagoras is sometimes said to have written the first proof, though no evidence survives.

    • proof-writing — Proof-writing is the mathematical task of establishing that a statement is true by logical argument. It includes formal proofs, computer-assisted proofs, and standard methods such as contradiction, induction, and exhaustion.

    • proving a theorem — Proving a theorem is the process of establishing that a mathematical statement is true, often by deriving lemmas and ending with QED. Common methods include indirect proof via the contrapositive, and famous computer-assisted examples include the four-color theorem.

  • quantification — Quantification is the logical operation that binds variables with existential or universal force over a domain of discourse. It is central to first-order logic, Montague semantics, and modal logic when worlds are treated as the range of quantification.

  • Rules of inference
    • modus ponens — Modus ponens is the rule of inference that says if P implies Q and P is true, then Q must be true. Lewis Carroll’s “What the Tortoise Said to Achilles” presents it as a classic problem of infinite regress in formal logic.
  • syllogistic fallacies
    • four-term fallacy — The four-term fallacy is the syllogistic error that occurs when the middle term changes meaning between premises. In the classic example, “wolves” is used in two different senses, so the conclusion does not follow.

  • tautology — A tautology is a statement that is necessarily true, such as a claim that repeats itself without adding information. In logic it is true under every assignment, and in rhetoric it overlaps with circular reasoning or begging the question.

  • validity — Validity is the property of an argument whose premises cannot all be true while the conclusion is false. In propositional logic, even false premises can still leave an argument valid if the conclusion follows necessarily.
• logic and proofs
  • lemma — A lemma is a proved intermediate result used in the course of proving a larger theorem. The term is often applied to supporting statements such as the Yoneda lemma.
• Mathematical logic
  • axioms — Axioms are basic assumptions taken to be true without proof and used as starting points in mathematics and logic. Examples include Euclid’s postulates, the parallel postulate, and foundational statements such as those in ZFC set theory.

    • axiom — An axiom, or postulate, is a basic assumption taken as a starting point for further reasoning. Mathematics often builds systems from axioms, such as Euclidean geometry’s foundational postulates or the axiom of choice.

    • Zermelo’s axiom of choice — Zermelo’s axiom of choice states that from any family of nonempty sets one can select exactly one element from each set. It is independent of Zermelo-Fraenkel set theory and is equivalent to the well-ordering principle and Zorn’s lemma.

  • completeness theorems
    • Completeness theorem — Gödel’s completeness theorem says that in first-order logic, every semantically valid consequence of a consistent set of sentences is provable. Equivalently, every consistent set of first-order formulas is satisfiable.
  • incompleteness theorems

    • Gödel’s incompleteness theorem — Shows that any sufficiently strong consistent axiomatic system for arithmetic contains true statements that cannot be proved within the system; more broadly, no such system can be both consistent and complete. Gödel’s classic paper on formally undecidable propositions gave the result, and the proof uses arithmetization and diagonalization to construct a self-referential undecidable sentence. It undercut Hilbert’s dream of a complete formal foundation for arithmetic and is often discussed in connection with the limits of mathematics, computation, and mechanized proof, including arguments by Penrose and Lucas.

    • Gödel’s second incompleteness theorem — Gödel’s second incompleteness theorem says that a sufficiently strong consistent formal system cannot prove its own consistency. It became famous through the Lucas–Penrose argument and later philosophical discussions about mathematics and mind.

  • model theory — Model theory is the branch of mathematical logic that studies structures through formal languages and theories. Its standard clues include the compactness theorem, the Löwenheim-Skolem theorems, and Gödel’s completeness theorem.
    • compactness theorem — The compactness theorem says that a set of first-order sentences is satisfiable if every finite subset is satisfiable. It is a standard result in logic, often proved from completeness, and is used in model theory and set-based arguments such as Erdős-style compactness applications.
  • nonstandard analysis — A branch of mathematics that rigorously develops infinitesimal calculus using Abraham Robinson’s framework, with tools such as ultrafilters, hyperreals, and the transfer principle. It recasts continuity and other calculus notions in terms of quantities that are infinitely close, and also uses infinitesimal and infinite numbers.
    • hyperreal numbers — The hyperreal numbers extend the real numbers to include infinitesimals and infinite quantities. They are central to nonstandard analysis, where the transfer principle and standard part function let one compare limited hyperreals with ordinary real numbers. Their equivalence classes are organized into monads and shadows.

  • proof — A proof is a demonstration that a mathematical statement is true, often using induction, contradiction, or computer-assisted arguments. Proof is also the title of David Auburn’s play about a mathematician’s daughter and his notebooks, adapted into a film with Gwyneth Paltrow.

  • second-order logic — Second-order logic allows quantification over predicates and relations rather than only over individual objects. Because of that expressive power, results like the Löwenheim-Skolem theorem do not generally apply in the same way as they do to first-order logic.

  • undecidability theorem
    • Gödel’s undecidability theorem — Gödel’s undecidability theorem shows that in sufficiently powerful formal systems there are statements that cannot be proved or disproved within the system. It became famous through its connection to Hilbert’s tenth problem and related work in mathematical logic.
  • quantifiers — Quantifiers are logical expressions such as “for all” and “there exists,” including the universal and existential forms written with the upside-down A and backward E symbols. They bind variables over a domain of discourse, and bind free variables in a formula. They are central to first-order logic and Skolemization, and are also important in debates about ontology and reference. In Montague semantics, noun phrases can be treated as generalized quantifiers, extending the familiar first-order logical operators.

    • existential quantifier — This logical quantifier means “for some” or “there is at least one,” and its negation becomes the universal quantifier applied to the negated proposition. In Davidson-style analyses, it can also bind events.

    • Uniqueness quantifier — The uniqueness quantifier is a first-order logic symbol used to say that exactly one object satisfies a condition. It is often written as an existential quantifier with an exclamation point.

  • Skolemization — Skolemization is the first-order logic process of eliminating existential quantifiers by replacing them with functions or constants tied to earlier universal variables. The result is not always logically equivalent to the original statement, but it is equisatisfiable and is used to form Skolem normal form.
• variables — Variables are symbols or quantities whose values can change, unlike constants in elementary algebra. They are often used to represent unknown or changing quantities in equations, such as x and y. In research, variables may be dependent, independent, moderator, mediator, or confounding variables, and they must be operationalized for measurement. In experiments and statistics, confounding or lurking variables are outside factors that can distort a relationship.

  • individual variables or propositional variables — In Russell’s logical calculus, individual variables and propositional variables are the two basic kinds of variables.

  • X — X is the letter used for Malcolm X, the unknown in algebra, and the namesake of X-chromosome disorders and X-rated films. It also appears in clues for the X file and in names such as Malcolm X, while the letter itself stands for an unknown or variable.

• Alfred North Whitehead and Bertrand Russell
  • Principia Mathematica — A three-volume work by Alfred North Whitehead and Bertrand Russell that sought to derive mathematics from a small set of axioms and to ground mathematics in symbolic logic. It became a foundational text for symbolic logic and early analytic philosophy, helped define modern logical notation, and advanced the view that numbers can be treated as classes.
• Logicians

  • Thoralf Skolem — Thoralf Albert Skolem was a Norwegian logician and mathematician known for the Löwenheim–Skolem theorem, Skolemization, and the Skolem normal form in first-order logic. He also worked on the foundations of set theory, models, ring automorphisms, and p-adic methods for solving Diophantine equations.

  • Kurt Friedrich Gödel — Kurt Gödel was an Austrian-American logician famous for the incompleteness theorems. He also gave a modal-logic version of the ontological argument, and his name appears in the title Godel, Escher, Bach.

• Relations

  • reflexive property — In mathematics, the reflexive property is the condition that each element stands in a relation to itself, i.e. every element equals itself. It is one of the defining properties of equivalence relations, along with symmetry and transitivity. In sociology, reflexivity is associated with thinkers such as Garfinkel, Giddens, Beck, and Bourdieu.

  • transitivity — A relation is transitive if, whenever a is related to b and b is related to c, a is related to c. The same idea applies to equality and ordered relations such as greater-than: if a = b and b = c, then a = c, and if seven is greater than five and five is greater than three, then seven is greater than three. Transitivity is a basic requirement for equivalence relations and appears in partial orders, transitive closures, order theory, logic, tournament comparisons, group actions, and other ordered or homogeneous structures.

• intervals
  • interval — An interval is a subset of the real numbers containing every number between any two of its elements. In relativity, the invariant interval combines changes in space and time and can be timelike, spacelike, or lightlike.

• Principia Mathematica — This title belongs to Bertrand Russell and Alfred North Whitehead’s massive work on symbolic logic and the foundations of mathematics, famous for its ramified theory of types and its laborious proof that 1+1=2. It is also shared with Newton’s foundational physics treatise, often rendered in the Latin form Philosophiae Naturalis Principia Mathematica.

• Transfinite induction — Transfinite induction generalizes ordinary induction to well-ordered sets such as the ordinals. Its proof typically checks a successor case and a limit case, and related constructions can use transfinite recursion.

• Infinity — Infinity is the concept of limitless magnitude or boundlessness. In mathematics it is used for cardinalities, limits, and idealized values such as the size of Hilbert’s Grand Hotel; it can also denote division by zero, zero as a limit, or an unbounded cardinality, with aleph-null naming the smallest infinite cardinal. It also appears in poetry and literature, including references to Leopardi and Millay to describe vastness beyond measure.
  • Hilbert’s Grand Hotel — Hilbert’s Grand Hotel is the classic thought experiment used to illustrate infinity, especially countably infinite sets such as the whole numbers and the smallest infinity aleph-null. It imagines a fully occupied hotel that can still admit new guests by shifting occupants, making it a standard way to explain paradoxes of infinite size.
• proof techniques

  • constructive proof — A constructive proof establishes that something exists by explicitly finding it or giving a method to build it. The idea is central in intuitionist mathematics, which rejects nonconstructive existence proofs such as many proofs by contradiction.

  • mathematical induction — Proof technique for proving an infinite sequence of statements by establishing a base case and then showing the truth of n implies the truth of n+1. It is especially common for formulas over the natural numbers, including sums and recursively or iteratively defined sequences such as the sum of the first n odd numbers. Related variants include strong induction, transfinite induction, and Noetherian induction.

  • mathematical proof — A mathematical proof is a deductive argument showing a statement is true, often using induction, contradiction, or the two-column style in geometry. Andrew Wiles famously produced such a proof for Fermat’s Last Theorem.
    • Computer-assisted proof — A computer-assisted proof uses computation as an essential part of establishing a mathematical theorem. Famous examples include the four-color theorem and the disproof of Euler’s sum-of-powers conjecture.
  • proof by infinite descent — Proof by infinite descent argues that if a positive-integer solution exists, then a smaller one can always be found. The resulting contradiction makes it a classic method in number theory and an important special case of proof by contradiction.
• induction
  • strong induction — Strong induction proves a statement by assuming it holds for all earlier natural numbers up through n, not just for n itself. It is especially useful when a proof needs the cases below n, such as n minus 1 and earlier.
• intuitionism
  • Luitzen Egbertus Jan Brouwer — Dutch mathematician and philosopher who founded intuitionism, rejecting the law of excluded middle. He made major contributions to topology, including the fixed-point theorem and the plane translation theorem, and later turned against some of his earlier mathematical work.

Geometry and Trigonometry

Connect geometric objects, measurement, and trigonometric relationships.

Geometry

• geometry — Geometry is the branch of mathematics concerned with shapes, sizes, angles, and space. It appears in Euclid’s Elements, as well as later work in Euclidean, non-Euclidean, and algebraic geometry.

  • 118 degrees — The supplement of a 62-degree angle is 118 degrees. This follows from supplements summing to 180 degrees.

  • 2 ½ — This is the diameter of the larger of two concentric circles when the smaller has diameter 1 5/8 inches and the gap between them is 7/16 inch. It comes from a straightforward geometry computation with the answer 2 1/2.

  • 2-spheres — A 2-sphere is the surface of a three-dimensional ball, with area 4 pi r squared and volume-related geometry often discussed via spherical coordinates. It appears in the Banach-Tarski paradox and in packing problems such as the Kepler conjecture.

  • 24 units — Twenty-four units is the answer to several geometry calculations involving right triangles, centroids, and side lengths. It can be obtained from a right triangle with hypotenuse 10 and longest leg 8, or from the centroid’s distance from a vertex when a median is 36.

  • 2π/3 radians — The supplement of a 60-degree angle is 120 degrees, which equals 2π/3 radians.

  • 3 pi — Three pi is the arc length or related angular answer that appears in several basic circle and trig calculations. It can be obtained from a 30-unit radius circle with an 18-degree central angle, or from dividing a circle into six equal parts.

  • 30 degrees — For a Mach number of 2, the opening angle of the Mach cone is 30 degrees, or π/6.

  • 3√3 units — The apothem of a regular hexagon with side length 6 is 3√3 units.

  • 44 square centimeters — This is the area of an isosceles trapezoid with bases 8 and 14 centimeters and equal legs of 5 centimeters. The setup gives a height of 4 centimeters, so the area is 44 square centimeters.

  • 5 inches — A circle inscribed in a square with side 10 inches has radius 5 inches, and the same value is the maximum diameter of the smaller circle in the nested-circle setup. These are straightforward geometry results from inscribed figures.

  • 8 meters — This is an 8-meter perimeter, the result of a geometry problem about an isosceles trapezoid. In another version, it is the length of the midsegment connecting the midpoints of the nonparallel sides of a trapezoid with bases six and ten.

  • A RAY — A ray is a geometric half-line with one endpoint and no fixed length. In elementary geometry, it is one of the basic kinds of line figures alongside lines and segments.

  • Acute angle — An acute angle is any angle measuring less than 90 degrees. In a right triangle, the sine of an acute angle is the ratio of the opposite side to the hypotenuse.

  • Affine geometry — Affine geometry is the form of geometry that keeps the parallel postulate while dropping axioms about circles and angle measurements. It is the geometry used in the four-dimensional setting that appears in relativity.

    • Hyperplanes — Hyperplanes are affine subspaces of codimension one, such as lines in the plane or decision boundaries used by linear classifiers. They can also be described as the solution sets of linear equations of the form p-transpose x equals a.

    • linear manifold — A linear manifold is an affine subspace formed by adding a fixed vector to a fixed directing subspace. Lines and planes are common examples, and higher-dimensional analogues are called hyperplanes.

  • algebraic geometry — Algebraic geometry studies the geometric properties of polynomial equations and the varieties they define. It is closely associated with Grothendieck, Zariski topology, Cartier divisors, and results such as Hilbert’s Nullstellensatz.

    • algebraic varieties — Algebraic varieties are the basic objects of algebraic geometry, defined as solution sets to polynomial equations. They may be affine or projective, can have singularities, and are generalized by schemes. The Zariski topology and Hilbert’s Nullstellensatz are standard clues for them.

    • elliptic curve — An elliptic curve is a nonsingular algebraic curve that can be written in the form y squared equals x cubed plus ax plus b. These curves support a group law, appear in modern cryptography, and are tied to modular forms and Fermat’s Last Theorem.

    • Hodge Conjecture — The Hodge Conjecture asks whether certain cohomology classes on projective algebraic varieties are rational combinations of algebraic cycles. It is one of the Millennium Prize Problems and is closely tied to the geometry of algebraic varieties and homology classes.

    • Nullstellensatz — Hilbert’s Nullstellensatz is the theorem connecting radical ideals with the ideals of the affine varieties they define. The word also appears in combinatorial nullstellensatz, a tool in additive combinatorics.

    • Variety — Variety was an entertainment magazine that could run eye-catching headlines about the stock market as well as the film business. In algebraic geometry, a variety is the set of common zeros of polynomial equations, studied with the Zariski topology.

    • Zariski topology — The Zariski topology is the topology used in algebraic geometry, where closed sets are algebraic varieties. It also appears on prime spectra of rings via Hilbert’s Nullstellensatz, making it a standard way to study affine varieties.

  • angle bisectors — Angle bisectors are the lines in a triangle that cut the angles in half. Their three pairwise intersections meet at the incenter, the center of the inscribed circle.
    • angle bisector — A ray or line segment from an angle’s vertex that divides the angle into two equal parts. In a triangle, the internal angle bisectors meet at the incenter, and the Steiner–Lehmus theorem concerns triangles with equal bisectors.
  • angle measure

    • 55 degrees — The supplement of a 125-degree angle is 55 degrees. The same value appears when solving simple linear-pair angle problems.

    • Degrees — Degrees are the common unit for measuring plane angles, with a full circle divided into 360 degrees. They convert to radians by multiplying by pi over 180, and they are subdivided into minutes and seconds.

    • radians — Radians are the SI unit for measuring angles, defined by arc length divided by radius and equal to about 57.3 degrees. They are used for arguments in complex polar form and in formulas such as angular velocity, with 2π radians in a full circle.

      • π/2 — π/2 is the radian measure of a right angle, since 90 degrees converts to one-half of pi. It can also appear as the derivative value in calculus problems involving trigonometric functions.
  • angle trisection
    • Trisecting the angle — Trisecting the angle is the ancient geometric problem of dividing an angle into three equal parts. Pierre Wantzel proved that the general construction is impossible with straightedge and compass.
  • angles — An angle is a geometric or physical quantity measured in degrees or radians, and it also appears in mechanics, optics, and inverse kinematics. Related clues mention bond angles, launch angles, goniometers, and the small-angle approximation.

    • 110 degrees — The angle measure is 110 degrees, matching several basic geometry problems about polygons and triangles.

    • 124 degrees — A quadrilateral with three angles measuring 78, 106, and 52 degrees has a fourth angle of 124 degrees. This uses the fact that a quadrilateral’s interior angles sum to 360 degrees.

    • 180 degrees — An angle of 180 degrees describes a straight line in geometry and the anti conformation in chemistry. It is also the bond angle of linear molecules such as carbon dioxide and is the angle formed by the opposite angles of a cyclic quadrilateral.

    • 36 degrees — Thirty-six degrees is the angle measure repeatedly asked for in triangle and polygon calculation problems. It is the smallest angle in an isosceles triangle with angles in a 1:2:2 ratio and the angle at each point of a regular five-pointed star.

    • 5 Pi / 6 — The angle in the interval from 0 to pi with cotangent equal to negative square root of 3 is 5pi/6. It is the second-quadrant solution to a simple trigonometric equation.

    • 50 degrees — This answer is fifty degrees, the measure of an angle in several geometry and trigonometry problems. It can be found from triangle angle sums, isosceles triangle base angles, or by comparing sine and cosine values.

    • 70 degrees — Seventy degrees is a common angle answer in geometry and clock problems. It can be the angle between clock hands at 6:20 or the missing angle in a polygon calculation.

    • 720 degrees — Seven hundred twenty degrees is the sum of the interior angles of a hexagon and the rotation needed to return a spin vector to its original orientation. It also appears in a skateboarding game title that alludes to two full turns.

    • 84 degrees — This is 84 degrees, the smallest angle in a pentagon whose angles form an arithmetic progression with common difference 12 degrees. The same value appears in a simpler triangle angle-sum calculation.

    • 90 degrees — Ninety degrees is a right angle, one quarter of a full rotation, and the angle complementary to the other acute angle in a right triangle. It is also the angle formed by perpendicular lines and the condition for maximal magnetic flux through a surface.

    • Acute — Acute describes an angle smaller than 90 degrees. The word also applies to severe, sharp illnesses or pain and to acute triangles in geometry.

    • Angle — An angle is the geometric or chemical quantity measured in degrees, radians, or related units, such as bond angles, torsion angles, and specific rotation. In chemistry and physics it appears in conformations, Snell’s law, and the law of reflection.

    • complementary angles — Complementary angles are two angles whose measures add to 90 degrees. In a right triangle, the two non-right angles are complementary.

    • coterminal angles — Coterminal angles are angles that differ by whole rotations but have the same terminal side. Examples like pi over 2 and five pi over 2 illustrate the idea.

    • minutes — Minutes are units of angular measure equal to one sixtieth of a degree. The term also refers to sixty-second subdivisions of time, but here it is the angle unit that is meant.

    • Oblique — Oblique describes something that is slanted or not perpendicular, such as an oblique angle or oblique coordinate system. The term also appears in geometry and physics for diagonal asymptotes, lines, and shocks.

    • obtuse angles
      • 135 degrees — An angle measure of 135 degrees, equal to 3π/4 radians. It is the interior angle of a regular octagon and can also appear as an obtuse angle formed by intersecting lines.
    • right angles — Right angles are angles measuring 90 degrees, the congruent angles named in Euclid’s fourth postulate. They occur in familiar geometric settings such as rectangles, Thales’ theorem, and the special triangles used in Pythagorean geometry.
      • right angle — A right angle measures 90 degrees and is formed by perpendicular or orthogonal lines. It is the angle used in Thales’ theorem, the Pythagorean theorem, the dot product, and polarization discussions.
        • pi/2 — The angle equal to pi divided by 2, i.e. 90°, is a standard trigonometric value. It is the smallest positive angle at which tangent has a vertical asymptote, and for any x between 0 and 1, arcsin(x) + arccos(x) = pi/2.
    • supplementary — Supplementary angles are two angles whose measures add up to 180 degrees. The relationship appears for adjacent interior angles formed by a transversal across parallel lines and for adjacent angles in a parallelogram.
  • area — Area is the measure of the space enclosed by a plane figure, often computed by multiplying base and height or by using formulas such as Heron’s or Brahmagupta’s. In physics and astronomy it appears in pressure, drag, cross sections, and Kepler’s second law, where equal areas are swept out in equal times.

    • 120 square cubits — Using pi as 3, the surface area to be painted on the cylinder comes out to 120 square cubits for two coats. The cylinder is 3 cubits high and has radius 2 cubits.

    • 72 square inches — A square inscribed in a circle of radius 6 has area 72 square inches.

    • 735 square feet — A triangle with base 42 feet and height 35 feet has area 735 square feet.

    • 784 square meters — A square with an inscribed circle of circumference 28π meters has area 784 square meters.

    • twelve pi — The area of the ellipse x^2/9 + y^2/16 = 1 is twelve pi. This follows from the standard formula piab for an ellipse with semiaxes 3 and 4.

  • area and diagonal calculations
    • 2√15 feet — A triangle with sides 5, 12, and 13 has area 30, so an equal-area square has diagonal 2√15 feet.
  • Area and integration
    • quadrature — Quadrature is a term for computing area, especially the classical problem of squaring the circle. In geometry and physics it can also refer to bodies being at right angles, and it names several numerical integration methods.
      • Gaussian quadrature — Gaussian quadrature is a numerical integration method that chooses evaluation points to maximize accuracy on a given interval. Its nodes are the roots of an orthogonal polynomial, and unlike Newton-Cotes methods, both the weights and points are allowed to vary.

  • area of a triangle — The answer is the fraction one-half, the number that gives square roots when used as an exponent and appears in the triangle area formula as one-half base times height. Packet clues also connect it to the gamma function, the Riemann zeta function, and the decimal 0.5.

  • art gallery problems
    • Art Gallery Problem — The Art Gallery Problem asks how many guards are needed to watch every point of a polygonal gallery. Chvátal’s theorem gives the classic floor of n over 3 bound, and later work extended the idea to variants such as the fortress problem.
  • axioms and postulates
    • Postulates — Postulates are statements accepted without proof and used as the starting points of a mathematical system. Euclid’s Elements famously presents five of them, including the claim that a straight line can be drawn between any two points and that all right angles are equal.
  • centers
    • center — In geometry and algebra, the center is the point equidistant from a circle’s edge, while in group theory the center is the set of elements commuting with everything else. The word also appears in graph theory, where it names the vertices of minimal eccentricity.
  • Circle — A circle is the set of all points in a plane equidistant from a center. Its radius is the distance from the center to any point on the circumference, and its circumference-to-diameter ratio is pi; the unit circle is used for trigonometric parametrization. The area is πr² and the circumference is 2πr. A circle is also a conic section formed when a plane slices a cone perpendicular to its axis, and it is the most symmetric of the standard conic sections. In analytic geometry, an equation of the form √(x²+y²)=constant describes a circle centered at the origin. Related notions include concentric circles and the annulus they bound, cyclic quadrilaterals, the nine-point circle, and classical compass-and-straightedge constructions; circles also appear in the perpendicular bisector construction, roots of unity on the complex plane, the power of a point, and Descartes’ theorem.

    • 8 pi — This is 8π, the area of the circle circumscribing a square of side 4. It also equals the area of the largest circle that can be drawn around that square.

    • a circle — A circle is the plane shape consisting of all points at a fixed distance from a center. Its area is πr², and it generates familiar solids such as the sphere by rotation and the torus by revolution around an axis.

    • arcs — In geometry, an arc is a portion of a circle’s circumference. In geology, the same word can refer to volcanic island, continental, or volcanic arcs formed near subduction zones.
      • Arc — An arc is a portion of a circle’s circumference, measured by its length or by the central angle it subtends. Arc is also the name of an activity-regulated cytoskeleton-associated protein involved in synaptic plasticity.

    • circumcircle — A circumcircle, or circumscribed circle, is the unique circle through all three vertices of a triangle. Its center is the intersection of the triangle’s perpendicular bisectors.

    • circumference — Circumference is the distance around a circle, equal to two pi times the radius or pi times the diameter. It is the circle’s perimeter and is a basic quantity in elementary geometry.

    • concentric — Concentric describes circles or other shapes that share the same center. In castle design, concentric fortifications have nested walls with an outer wall lower than the inner defenses.

    • concentric circles — Concentric circles are circles that share the same center but have different radii. The term also appears in urban geography for models that picture a city as rings radiating outward from a central business district.

    • unit circle — The unit circle is the set of points in the plane at distance one from the origin, often written x squared plus y squared equals one. It underlies trigonometric coordinates, the circle group, and the simplest 1-sphere in topology.
  • Circle and cylinder measurements
    • 20 pi — This is the surface area of a cylinder with diameter 4 and height 3, or the circumference of a circle with area 100 pi. The value is 20 pi.
  • circle and sphere calculations
    • 16 pi — Sixteen pi can be the answer to circle and sphere calculation prompts. It may arise from circumference-based work or from finding the surface area of a sphere with radius 2.
  • circle geometry
    • diameter — The diameter of a circle is a chord through the center, equal to twice the radius. It is the measurement used in the law of sines and in formulas for circumference, and Thales’ theorem makes a triangle with a diameter as one side a right triangle.
  • Circle squaring
    • Tarski’s Circle-Squaring Problem — Tarski’s Circle-Squaring Problem asks whether a circle can be cut into finitely many pieces and rearranged by translations into a square, a challenge later solved by Miklós Laczkovich.
  • collinearity
    • collinear — Collinear describes points that lie on the same straight line. The term also applies to vectors that are scalar multiples of one another, and it is the condition ruled out in general position for points in the plane.
  • compass and straightedge construction
    • squaring the circle — Squaring the circle is the ancient classical construction problem of making a square equal in area to a given circle using only compass and straightedge. Its impossibility was established after Lindemann proved pi transcendental, showing the exact construction cannot be done with constructible numbers and ending a long line of attempted constructions and approximations.
  • Compass and straightedge constructions

    • constructible — A constructible object can be made with compass and straightedge, and the constructible numbers form a field closed under arithmetic and square roots. Gauss proved the regular 17-gon is constructible, while Wantzel showed that some classical problems, like angle trisection and cube duplication, are impossible in this sense. This notion also underlies the impossibility of squaring the circle and the study of which cosine values can be realized by geometric construction.

    • unmarked compass — This is an unmarked compass used with a straightedge in classical geometric construction. Its movable hinge sets the radius so it can draw a circle without measuring marks.

  • concurrency
    • concurrent — Concurrent lines or cevians meet at a single point, and the same adjective can describe multiple processes occurring simultaneously. In geometry, Ceva’s theorem and related results use this term for lines intersecting at one point.
  • congruence — Congruence is the relation between figures with the same shape and size, so that corresponding sides and angles are equal. In geometry it is shown by tests such as SSS, SAS, and CPCTC, and it is stronger than similarity.
    • congruent — Congruent describes figures or numbers that are equal in measure or equivalent under a given relation. In geometry it characterizes matching angles, and in modular arithmetic it is the relation usually written with a triple bar.
  • Constructibility problems
    • doubling the cube — Doubling the cube is the classical Greek geometric problem of constructing a cube with twice the volume of a given cube, equivalently constructing the cube root of two. It is impossible by compass and straightedge alone and is one of the three famous impossible problems of Greek geometry, along with squaring the circle and trisecting the angle.
  • constructions
    • Trisection — Trisection is the operation of dividing an angle or segment into three equal parts. It is one of the classical construction problems that cannot be done with an unmarked straightedge and compass alone.
  • convexity — Convexity is the property of sets and functions whose line segments or secant lines stay on the proper side of the graph. In geometry it describes polygons with all interior angles under 180 degrees, and in analysis it underlies Jensen’s inequality and positive second derivative behavior.
    • convex — A convex set contains every line segment between any two of its points, and a convex function lies below its chords. Convexity appears in results such as Jensen’s inequality, the Hahn-Banach theorem, and the Brunn–Minkowski theorem. The convex hull is the smallest convex superset of a given set, and convex polygons have no interior angle greater than 180 degrees.
  • coordinate systems — Coordinate systems assign positions by using a chosen set of axes or parameters, as in Cartesian, polar, or spherical coordinates. In physics and geometry, canonical coordinate systems are those adapted to structures such as the Poisson bracket or local manifold charts.

    • cylindrical coordinates — Cylindrical coordinates extend polar coordinates by adding a height variable, giving rho, phi, and z. They use a radial coordinate, an azimuthal angle, and the z-axis, and are used in solids of revolution, Steinmetz solids, Bessel-function solutions to Laplace’s equation, and solutions such as von Kármán swirling flow.

    • spherical coordinates — Spherical coordinates describe points in three dimensions by a radius and two angles, making them natural for radially symmetric problems. Mathematicians and physicists use different conventions for the polar and azimuthal angles, often labeled theta and phi. They are used in settings like Laplace’s equation, solid-angle integrals, and graphing surfaces with spherical symmetry.

    • X and Y — X and Y are the sex chromosomes associated with male biology. They also name the horizontal and vertical axes in Cartesian coordinates.

    • x-axis — The x-axis is the horizontal axis in the Cartesian plane, where the ordinate is measured from the y-axis. It is also called the line y = 0, and function roots lie on it when their graphs cross the horizontal axis. In complex diagrams it represents the real axis.

  • cube diagonals
    • 2 times the square root of 3 units — This value is the length of the space diagonal of a cube with side length 2. It also appears as the height in a square pyramid problem with base area 16 and surface area 48.

  • cubes — A cube is a regular hexahedron with six square faces, eight vertices, and twelve edges. The shape appears in art history through Cubism, which takes its name from it, and in works by artists such as David Smith, Tony Rosenthal, Isamu Noguchi, Picasso, and Braque.

  • curves — Curves are geometric objects traced by a moving point, with line integrals and arc length defined along them. In the plane, simple closed curves are governed by the Jordan curve theorem, and more generally curves may be parametrized as continuous images of intervals.

    • arc length — Arc length is the distance traveled along a curve, denoted by s in many formulas. It appears in the Frenet–Serret equations and in the integral formula for rectifiable curves.

    • cardioid — A cardioid is a heart-shaped polar curve and a special case of the limaçon; equivalently, it is a one-loop epicycloid. It can be described by equations such as r = a(1 - cos θ), r = a - a sin θ, or r = a - a cos θ. The same shape appears as a prominent region in the Mandelbrot set.

    • catenary — A catenary is the curve traced by a hanging chain or rope under its own weight, with graph given by a hyperbolic cosine function. Its inversion gives the ideal arch shape, and it is used in mathematics and engineering to describe arches and certain rolling-parabola constructions.

    • Conchoid — A conchoid is a shell-shaped curve studied by Nicomedes in connection with the duplication of the cube. Its Cartesian form has a vertical asymptote at x = b, and the shape was used in some ancient column constructions.

    • cycloid — A cycloid is the curve traced by a point on a circle rolling along a straight line. Its arch-shaped cusp makes it the solution to the tautochrone problem and it is also the brachistochrone.

    • involute of a circle — The involute of a circle is the curve traced by the end of a taut string as it unwinds from a circle. Its parametric form can be written as x = a(cos t + t sin t) and y = a(sin t - t cos t).

    • Lemniscate — A lemniscate is a figure-eight shaped plane curve, often described by the polar equation r squared equals a squared cosine of two theta. The lemniscate of Bernoulli is the classic example named for Jakob Bernoulli.

    • lemniscate of Bernoulli — The lemniscate of Bernoulli is the figure-eight curve whose polar equation can be written with r squared proportional to cosine two theta. It is a Cassini oval and can also be described as the locus where the product of distances to two fixed points stays constant.

    • lemniscates — Lemniscates are figure-eight-like curves, with Bernoulli’s lemniscate and related quartic examples such as the lemniscates of Gerono and Booth. They arise as special cases of Cassini ovals and appear in polar graphing.

    • limaçon — A limaçon is a family of polar curves given by equations of the form r = a + b sine theta or r = a + b cosine theta. When a equals b, the curve becomes a cardioid.

    • Lissajous curves — The looping figures traced by combining perpendicular sinusoidal motions, often displayed on an oscilloscope. They are named for the French physicist Jules Antoine Lissajous, and special cases can be described by rational frequency ratios or by the motion of a pendulum. Depending on the frequency and phase relationships, they can form lines, ellipses, circles, or more complex patterns.

    • Nephroid — A nephroid is the two-cusped curve whose name means kidney-like. It can be described as an epicycloid formed by a circle rolling around another circle of twice the radius.

    • sigmoidal — A sigmoidal curve is S-shaped, unlike the hyperbolic curve of simple Michaelis-Menten behavior. It appears in cooperative binding and in many strong acid-strong base titrations, where the change becomes steep between flatter regions.

    • space-filling curves — Space-filling curves are continuous mappings that pass through every point of a region such as the unit square, with famous examples including the Hilbert and Peano curves. They are often discussed as unusual fractal-like constructions, and the Hilbert example is a standard non-differentiable instance with Hausdorff dimension 2.

      • Peano curve — The Peano curve is the first known space-filling curve, a fractal that maps a line densely onto the unit square. It is named for Giuseppe Peano and appears in discussions of the surprising relationship between one-dimensional intervals and two-dimensional areas.

      • space-filling curve — A space-filling curve is a continuous curve whose image covers a whole region such as the unit square. The first example was found by Giuseppe Peano, and later fractal variants were studied by mathematicians interested in dimension and coastlines.

    • Spirals — A spiral is a curve or shape that winds around a center while moving outward. Common forms include Archimedean, logarithmic, Fermat, and Fibonacci spirals; it is often described in polar form by equations such as r = θ. Spirals appear in astronomy, fluid dynamics, geometry, and other settings, including spiral galaxies and other paths traced by rotating points or rotating systems.
      • Archimedean spiral — The curve is a spiral whose radius grows linearly with angle; in polar coordinates it is commonly written r = aθ or in generalized form r = a + bθ. It is the locus traced by a point moving away from a fixed center at constant speed while a line rotates at constant angular velocity. It is named for Archimedes, who used it in classical geometric problems such as angle trisection and circle squaring.
    • Witch of Agnesi — The witch of Agnesi is the cubic curve named for Maria Gaetana Agnesi, with asymptote on the x-axis and equation y equals 8a cubed over x squared plus 4a squared. Its name comes from a mistranslation of the Italian versiera, and it is one of the classic curves of calculus.

  • Cyclic quadrilateral — A cyclic quadrilateral is a four-sided figure whose vertices all lie on one circle. Its opposite angles are supplementary, and it is the setting for results such as Ptolemy’s theorem.

  • cycloid — A cycloid is the curve traced by a point on the rim of a circle rolling along a line. It solves the brachistochrone and tautochrone problems and appears in classical work by Galileo, Huygens, and others. Its parametric form and relation to pendulum clocks make it a standard calculus and geometry clue.

  • Cylinders
    • cylinder — A cylinder is a three-dimensional solid with two circular bases joined by a curved surface; equivalently, it is a surface formed by translating a circle along an axis. Its volume is base area times height, or pi r squared h, and its unrolled lateral surface is a rectangle. Cylinders give rise to cylindrical coordinates and appear in solids of revolution, alpha-helix models, and Steinmetz solids.

  • Dehn invariant — The Dehn invariant is a geometric quantity used to classify polyhedra up to equidecomposition. It was introduced to answer Hilbert’s third problem in the negative and is constant under solid dissection.

  • dihedral angle — A dihedral angle is the angle between two intersecting planes, often measured around a bond in molecular geometry. It is central to conformational analysis, including Newman projections, the Karplus equation, and Ramachandran plots.

  • Dirichlet domain — A Dirichlet domain is the region of points in a lattice closest to a chosen lattice point. These regions appear in geometry and tiling problems and are closely related to Voronoi cells.

  • ellipse — A conic section defined as the set of points whose sum of distances from two foci is constant. Its eccentricity lies between 0 and 1, with semimajor and semiminor axes; it can be drawn with a string and two pins, and a circle is the special case when the foci coincide. In Kepler’s first law, planetary orbits are ellipses, so this shape describes the simplified paths of most planets.

  • Euclidean geometry — Euclidean geometry is the classical geometry of flat space described in The Elements by Euclid. It is built from the parallel postulate and contrasts with non-Euclidean systems such as hyperbolic geometry.

    • Playfair’s axiom — Playfair’s axiom is the version of the parallel postulate stating that through a point not on a line, at most one parallel can be drawn. It is named for the Scottish mathematician John Playfair and is often used as an equivalent formulation of Euclidean parallelism.

    • pons asinorum — Pons asinorum is Euclid’s first difficult theorem, the proposition that if two sides of a triangle are equal, then the opposite angles are equal. The Latin name means “bridge of asses” and refers to the theorem’s reputation as a first major hurdle in classical geometry.

    • transversal — A transversal is a line that intersects two other lines at distinct points, often parallel ones. It creates corresponding and alternate angle pairs that are congruent.

  • Euclidean space — Euclidean space is the familiar setting of n-tuples of real numbers, where the dot product gives the standard inner product and the Pythagorean theorem defines distance. It is the basic metric backdrop for results like the Lebesgue measure, rigid motions, and theorems such as Bolzano-Weierstrass and Heine-Borel.

  • Hyperboloid of one sheet — A hyperboloid of one sheet is a ruled quadric surface with a characteristic saddle-like shape, often written by the equation x² + y² - z² = 1. It appears in architectural designs such as Niemeyer’s Cathedral of Brasília and Shukhov’s tower.

  • Hypercube — A hypercube is the n-dimensional analogue of a cube, with the four-dimensional example commonly called a tesseract. Clues usually emphasize orthogonal edges, equal-length axes, and the projection of the four-dimensional figure into three dimensions.

  • Hypercubes
    • Tesseract — A tesseract is a four-dimensional hypercube, the 4D analogue of a cube in the same way a cube is the 3D analogue of a square. The term is also used in A Wrinkle in Time for the sort of space-time shortcut that lets Meg and her companions travel through the fifth dimension.

  • Isometries — Isometries are distance-preserving transformations, such as rotation and reflection in Euclidean geometry. They also describe the symmetries of the hyperbolic plane through fractional linear transformations.

  • length
    • 11/4 centimeters — A circle with circumference 1.5π has diameter 1.5, and a circle with area 25/64π has diameter 1.25. Their diameters sum to 11/4 centimeters, or 2¾ centimeters.
  • Line segments

    • line segment — A line segment is a finite portion of a line with two endpoints. It appears in basic Euclidean geometry, convexity, bisection, and experiments on visual judgment such as the Müller-Lyer illusion and Asch’s conformity study.

    • midpoints — A midpoint is the point halfway between two endpoints of a line segment. In triangle geometry, midpoints help define the medial triangle, and the centroid is formed by joining each vertex to the midpoint of the opposite side.

  • lines — Lines are one-dimensional geometric objects that extend infinitely in both directions. The clues point to secants, tangents, skew lines, and to artistic or architectural uses of the line in works by Kandinsky, De Maria, Baldessari, and Le Corbusier.

    • a line — A line is the geometric figure formed by points and extending indefinitely in opposite directions. Economists also use the line in Hotelling’s location model and in the intuition behind the Median Voter Theorem.

    • Line — A line is a one-dimensional geometric figure extending infinitely in both directions. In linear algebra and regression, lines appear as the graph of y = mx + b and as the shape described by linear equations. It is a basic geometric object that can be tested with the horizontal and vertical line tests in graphing. In geometry and art, lines are the in-between element between points and planes, and two intersecting lines can define a plane.
      • straight lines — Straight lines are the geometric features Antoni Gaudí famously avoided in Casa Milà, arguing that they do not occur in nature. They also appear in urban-location models such as Hotelling’s line-city competition setup.
    • parallel lines — Parallel lines are lines in the same plane that never meet and are central to Euclid’s fifth postulate and Playfair’s axiom. They also underlie affine geometry, projective geometry, and geometric descriptions of inconsistent systems of equations.
      • parallel — Parallel describes lines or vectors that never meet and have the same direction or slope. In chemistry and music, the same word can also refer to parallel circuits, parallel keys, and related transformations.
    • straight line — A straight line is the simplest geometric representation of a linear function and appears as a line on a log-log plot when a power law is scale invariant. In Euclidean geometry, it is the shortest path between two points and can be extended infinitely in both directions.

  • locus — A locus is a point or set of points satisfying a stated condition in geometry. In genetics, it is the fixed position of a gene on a chromosome, central to gene mapping and linkage analysis.

  • non-Euclidean geometry — Non-Euclidean geometry studies spaces in which Euclid’s parallel postulate fails, including hyperbolic and elliptic geometries. It became a foundation of modern geometry through work by Beltrami, Bolyai, Lobachevsky, and others.

    • elliptic geometry — Elliptic geometry is a non-Euclidean geometry in which the parallel postulate is replaced so that no line through a point remains parallel to a given line. It can be viewed as a special case of spherical geometry. In this geometry, triangles have angle sums greater than 180 degrees.

    • Nikolay Ivanovich Lobachevsky — Nikolay Ivanovich Lobachevsky was a Russian mathematician who applied critical analysis to Euclidean geometry. He is known for developing early non-Euclidean methods and for describing triangles with two right angles.

    • non-Euclidean geometries — Non-Euclidean geometries are geometries that do not satisfy Euclid’s parallel postulate, including hyperbolic and elliptic forms. They are used in models of curved space, with hyperbolic geometry allowing infinitely many parallels and elliptic geometry making all lines intersect.

    • parallel postulate — Euclid’s fifth postulate, the axiom that through a point not on a given line there is exactly one parallel line. Its equivalence to Playfair’s axiom and its failure leading to non-Euclidean geometry, including hyperbolic and spherical geometry, made it central to the work of Lobachevsky and Gauss.

  • Obtuse angle — An obtuse angle is any angle greater than 90 degrees but less than 180 degrees. It is the counterpart to an acute angle and is larger than a right angle.

  • Pappus’s theorem
    • Theorem of Pappus — Pappus’s theorem gives a way to compute a solid of revolution’s volume or surface area from the path traced by a centroid. It is named for Pappus of Alexandria, a late antique mathematician.
  • pentagons — Pentagons are five-sided polygons whose interior angles sum to 540 degrees. They are also the regular polygons that do not tile the plane by themselves, and they appear in problems about tessellations and the famous construction of the regular pentagon.
    • Pentagon — A pentagon is a five-sided polygon whose interior angles sum to 540 degrees, and regular pentagons have 108-degree interior angles. It also appears in tiling problems, with Marjorie Rice finding many pentagon tilings and Euler-style arguments showing certain polyhedra must have exactly twelve pentagonal faces. The Pentagon is the U.S. military headquarters in Arlington, Virginia, and it was the target of the 1967 antiwar “levitation” protest by Abbie Hoffman and Jerry Rubin. The shape’s name also shows up in work on the Robbins pentagon and in the study of pericyclic reactions only as a separate clue, not as the same topic.

  • perpendicular bisector — A perpendicular bisector is a line that cuts a segment at its midpoint and at right angles. In triangle geometry, the three perpendicular bisectors meet at the circumcenter, the point equidistant from all three vertices.

  • perpendicular bisectors — Perpendicular bisectors are the lines that cut segments in half at right angles. In a triangle, their three intersection point is the circumcenter, the center of the circumscribed circle.

  • perpendicular lines
    • perpendicular — Perpendicular lines meet at a right angle, and in vector language the relationship is often called orthogonal. The dot product of perpendicular vectors is zero, the cross product is perpendicular to both inputs, and Gram-Schmidt produces orthonormal sets. This relation also describes the orientation of a normal vector to a surface and the direction of the magnetic field in the Hall effect. A line’s slope is the negative reciprocal of another’s when the two are perpendicular.

  • plane — A plane is an infinite, flat, two-dimensional surface. In geometry, it can be defined by three non-collinear points, or by two intersecting lines, two parallel lines, or a point and a normal vector. In graph theory, planarity asks whether a graph can be drawn on a plane without crossings; a hyperplane has dimension one less than its ambient space.

  • planes — A plane is a flat two-dimensional surface that extends infinitely in every direction and can be specified by a point and a normal vector. In geometry and combinatorics, planes appear in the ham sandwich theorem, in hyperplane language, and in constructions such as finite projective planes.

  • points — A point is a basic geometric object with no size, and a line contains infinitely many of them. The same word also names a unit used in graphic design and typesetting.
    • Point — A point is a zero-dimensional geometric object, often represented by coordinates or a dot on the plane. In typography, it is a unit equal to one-twelfth of a pica. The word also appears in specialized mathematical uses such as fixed points, accumulation points, stationary points, and critical points, and in terms such as pointillism, vanishing points, and counterpoint.
  • polygons

    • hexagon — A hexagon is a six-sided polygon, with interior angles totaling 720 degrees and a regular form that tiles the plane. It also appears in geometric results such as Pappus’s theorem and in the packing description of close-packed spheres. Hexagons show up in crystallography, astronomy, and combinatorics, including the north polar jetstream on Saturn. The term is a standard geometry answer for a six-sided figure.

    • octagon — An octagon is an eight-sided polygon, a shape used for buildings and decorative forms in works such as the Florence Baptistery and the Dome of the Rock. It also appears in Byzantine and Renaissance architecture as a base for domes and chapels.

    • Polygon — A polygon is a closed two-dimensional shape made of straight line segments. Regular polygons have equal sides and equal angles, and the interior angles of an n-gon can be computed by a standard formula. Polygons are the planar shapes built from connected line segments that underlie many computer-graphics meshes and triangulations; they can be decomposed by ear clipping, Delaunay subdivision, and related algorithms used in rendering and geometry.

      • nonagon — A nonagon is a polygon with nine sides. For a regular nonagon, each interior angle measures 140 degrees.
  • Polyhedron — A polyhedron is a three-dimensional solid with flat polygonal faces, straight edges, and vertices. Its two-dimensional analogue is a polygon. Examples include the Platonic solids, Archimedean solids, and other regular solids of classical geometry. For convex polyhedra, Euler’s formula gives a vertex-edge-face relationship and the Euler characteristic is two.

    • dodecahedron — A dodecahedron is a Platonic solid with twelve pentagonal faces, and its geometry also shows up in puzzles like the icosian game and in classifications of its closed straight paths. It is the solid named in chemistry for C20H20, while Kepler’s work also led to the rhombic dodecahedron, a related form.

    • icosahedron — An icosahedron is a regular polyhedron with twenty triangular faces, twelve vertices, and thirty edges. It also appears in virus capsids and in Caspar-Klug triangulation theory. Its geometry is often introduced through the familiar volume formula involving the side length cubed and the factor five-twelfths times three plus the square root of five. The shape is used to describe rhinovirus and herpesvirus capsids.

    • octahedron — An octahedron is a geometric solid with eight plane faces; in the Platonic solid case it has eight triangular faces, six vertices, and twelve edges. It is the dual of the cube and the three-dimensional analogue suggested by the relation between an eight-sided polygon and a solid with eight faces. It also describes the geometry of AX6 molecules such as sulfur hexafluoride.

    • parallelepiped — A parallelepiped is a three-dimensional solid whose six faces are parallelograms. Its volume can be expressed with the scalar triple product, and special cases include rectangular prisms and cubes.

    • pyramid — A pyramid is a solid with a polygonal base and triangular faces meeting at an apex, famous in ancient Egyptian tombs and Mesoamerican monuments. The clue set points to shapes such as the Great Pyramid of Giza and the stepped and bent pyramids of early Egypt.

    • stellation — Stellation is the process of extending the faces or edges of a polyhedron until they meet to form a new star-like solid. It is famously used to generate many distinct polyhedra from the icosahedron, though not from a tetrahedron or cube.

    • truncated icosahedron — A truncated icosahedron is the Archimedean solid with twelve pentagons and twenty hexagons. It is the shape associated with buckminsterfullerene and the classic soccer ball pattern.

    • Truncated octahedron — The truncated octahedron is a semiregular solid with 14 faces. Its faces consist of squares and hexagons.

  • polytope — Polytopes are the generalizations of polygons and polyhedra to higher dimensions. They can be convex or concave, and examples include the simplex and the tesseract.

  • Ptolemy’s Theorem — Ptolemy’s theorem states that in a cyclic quadrilateral, the product of the diagonals equals the sum of the products of the two pairs of opposite sides. In the special case of a rectangle, it reduces to the Pythagorean theorem.

  • Pythagorean theorem
    • proving the Pythagorean theorem — This task is proving the Pythagorean theorem, the classic goal of establishing that the squares on the legs of a right triangle add to the square on the hypotenuse. Solutions can use rearranging triangles into a square or trigonometric arguments such as the law of sines, and the topic has attracted many different proofs over time.
  • rectangles — A rectangle is a quadrilateral with four right angles, and its diagonals are congruent and bisect one another. It is also the shape used for many Riemann-sum approximations and appears in classic geometry clues about area and the British Flag Theorem.
    • rectangle — A rectangle is a quadrilateral with four right angles, and a square is a special case with equal sides as well. The shape also appears in musical notation and in references to simple album art or logos. The clues may emphasize opposite angles, diagonals, or other properties distinguishing rectangles from other quadrilaterals.
  • regular hexagon area
    • 3√3/2 — A regular hexagon inscribed in a circle of area π has area 3√3/2.

  • regular hexagons — Regular hexagons are six-sided regular polygons that can tessellate the plane with triangles and squares. They appear in structures such as fullerene molecules, graphene, benzene, and hexagonal close packing.

  • regular octagons
    • regular octagon — A regular octagon is an eight-sided polygon with interior angles of 135 degrees and exterior angles of 45 degrees. It is the stop-sign shape and can be formed by cutting four isosceles right triangles from a square.

  • Rotational symmetry — Rotational symmetry is symmetry under rotation about an axis, as in regular polygons with one or more rotational axes. A square has fourfold rotational symmetry, while a rectangle has only twofold rotational symmetry.

  • rotations — Rotations are transformations that move an object around an axis while preserving lengths in spaces such as spacetime or Euclidean geometry. They are often represented with Euler angles or quaternions, and they can be described by clockwise or counterclockwise orientation.
    • clockwise rotation by 90 degrees — This linear transformation of the plane is a quarter-turn clockwise about the origin.

  • secant line — A secant line intersects a curve at two or more points, unlike a tangent line which touches at one point.

  • sectors
    • 3π square units — A sector of a circle with radius 6 and central angle 30 degrees has area 3π square units.

  • semiperimeter — The semiperimeter of a polygon or triangle is half its total side length. It appears in Heron’s formula for triangle area and in Brahmagupta’s formula for cyclic quadrilaterals.

  • Shapes

    • shape — Shape is the basic geometry or outline used to classify objects, from bacterial forms to similarity in mathematics. In music, shape-note notation changes the form of noteheads to make singing easier for the musically illiterate.

    • circular — A circular object or work has a round shape, as in a tondo or a cylindrical pipe. Parmigianino’s Self-Portrait in a Convex Mirror is a famous example of a circular tondo.

  • similarity
    • similar — Similar describes figures with the same shape up to scaling, and matrices with the same Jordan form or eigenvalues up to similarity. In geometry, it is the relation shared by objects whose dimensions are proportionally scaled.

  • simplex — A simplex is the simplest polytope in a given dimension, with n plus one vertices in n-dimensional space. Its geometry underlies linear programming, and the simplex method is named for it.

  • skew — Skew describes two lines that are noncoplanar and therefore neither parallel nor intersecting. In statistics, skew also refers to asymmetry in a distribution.

  • skew lines — Skew lines are lines in three-dimensional space that do not intersect and are not parallel. They often appear as opposite edges of a tetrahedron.

  • slope — Slope is the measure of a line’s steepness, usually written as m and computed as rise over run or delta y over delta x. It is also the derivative of a function at a point when the line is tangent to the graph.
    • rise over run — Slope is the measure of a line’s steepness, often written as rise over run or as delta y divided by delta x. It also describes the derivative of a function at a point and is the same for parallel lines.
  • solid angle
    • steradian — A steradian is the SI unit used for measuring solid angle. It is dimensionless, and it appears in expressions for radiance and spherical-cap geometry.
  • special rectangles
    • Golden Rectangle — A golden rectangle is a rectangle whose side lengths are in the golden ratio, about 1.62 to 1. It is often cited in art, architecture, and natural forms, including discussions of the Parthenon and Le Corbusier.
  • specific angles
    • 45 degrees — Forty-five degrees, or pi over four, is the angle associated with maximal projectile range, equal acute angles in an isosceles right triangle, and several standard geometry and physics situations. It also shows up as the critical angle in total internal reflection and in reflection and rotation problems.
  • sphere — A sphere is the set of all points in Euclidean space at a fixed distance from a center. The 0-sphere consists of two points, and the 2-sphere is the usual surface enclosing a ball. In higher dimensions it is written as the n-sphere or S^n, with the 3-sphere a common special case; related forms include the horned sphere. The Riemann sphere identifies the complex plane with a point at infinity and is also called the extended complex plane. Spheres appear in the Poincaré conjecture, the Hopf fibration, sphere-packing problems, and the Banach–Tarski paradox.
    • 144 pi — The surface area of a sphere with radius 6 is 144 pi. Related prompts include the volume of a hemisphere and other sphere-and-circle calculations.
  • sphere volume
    • 2/3*pi*r^3 — This is the value of the triple integral over the sphere of radius r. The result is two-thirds pi r cubed.
  • spheres — Spheres are three-dimensional geometric objects defined as the set of points at a fixed distance from a center. Their surface area is 4πr² and their volume is 4/3πr³. A ball is the solid interior of a sphere, not the surface figure itself. Spheres appear in geometry, topology, analysis, and physics, with examples including stereographic projection, spherical coordinates, the Riemann sphere, the hairy ball theorem, the Poincaré conjecture, and the Kepler conjecture on sphere packing; they are also used as idealized molecular shapes in chemistry and materials science and in crystal drawings.

    • 2-sphere — The 2-sphere is the three-dimensional analog of a circle: the set of points equidistant from a center in ordinary space. Its geometry features great circles, spherical coordinates, and the volume formula four-thirds pi r cubed.

    • ball — Ball is the surname shared by the basketball family headed by LaVar Ball and including Lonzo, LiAngelo, and LaMelo. The name also appears in the phrase “ball” for a three-dimensional solid sphere, as in the Banach-Tarski paradox.

    • n-sphere — An n-sphere is the set of points in Euclidean space at a fixed distance from a center. It is the n-dimensional generalization of a sphere and the boundary of a ball in n-dimensional geometry; the circle is the two-dimensional case and the ordinary sphere the three-dimensional case. Examples include circles and ordinary spheres, and it appears in homology, homotopy theory, spherical coordinates, stereographic projection, kissing-number problems, packing problems, and other geometric constructions.

    • Volume of a sphere — The volume of a sphere is the mathematical quantity given by four-thirds pi r cubed. Its derivative with respect to radius is the sphere’s surface area, 4 pi r squared.

  • spherical — Spherical describes a shape with perfect radial symmetry, like a ball or isolated equipotential surface. The term appears in physics and chemistry in topics such as spherical harmonics, spherical coordinates, and spherical mirrors.

  • spheroid — A spheroid is a three-dimensional figure shaped like a stretched or flattened sphere, with two equal semimajor axes. The term is also used for irregular round stone tools that may have served as hammers, missiles, or food pounders.

  • spheroids
    • oblate spheroid — An oblate spheroid is the shape of a sphere flattened at the poles and bulging at the equator. It can be generated by rotating an ellipse about its minor axis, and Earth is a common example.

  • spiral — A spiral is a curve that winds around a center, and in dynamical systems it can describe a trajectory that both rotates and moves toward or away from a fixed point. The shape appears in art and science, from logarithmic spirals and Robert Smithson’s Spiral Jetty to spiral galaxies.

  • squares — Squares are the four-sided geometric figures that anchor works by Malevich, Albers, Kelly, and Agnes Martin. Malevich’s Black Square and White on White are classic Suprematist examples, while Josef Albers’s Homage to the Square explored nested color interaction. The shape is also a regular polygon with equal sides and angles.
    • perfect squares — Perfect squares are integers of the form n×n, such as 0, 1, 4, 9, 16, and 25. They can be generated by adding the first n odd numbers and appear on the diagonal of a multiplication table. They have an odd number of divisors, and they occur in results such as the Pythagorean theorem, Lagrange’s four-square theorem, Fermat’s sum-of-two-squares theorem, and the Basel problem, as well as in relationships with triangular numbers, rational roots, and Pythagorean triples.
      • 49 — Forty-nine is the square of seven. It is also the maximum value of the quadratic 33 + 16x - 4x² when x = 2.
  • straightedge and compass constructions

    • Trisecting an angle — Trisecting an angle is the classical straightedge-and-compass problem of dividing an angle into three equal parts. The general problem is impossible in Euclidean construction, even though it inspired many historical attempts and crank proofs.

    • Trisection of an angle — The trisection of an angle is the classical problem of dividing an angle into three equal parts. It is impossible with only an unmarked compass and straightedge, though Archimedes gave a marked-straightedge construction.

  • surface area — Surface area is the total exposed area of a solid or region, measured in square units. It appears in formulas for spheres, cones, and parametrized surfaces, and in biology and chemistry it is important in topics like microvilli, cristae, and solvent-accessible surfaces.

    • lateral (surface) area — Lateral surface area is the area around the sides of a three-dimensional figure, excluding the bases. It is the quantity used when wrapping or painting the non-base faces of a solid.

    • surface area of a cube — The surface area of a cube equals six times the square of its side length.

  • tangent lines — A tangent line touches a curve at a point and gives its best linear approximation there. The slope of a tangent line is the derivative, and Newton’s method uses tangents to approximate roots.
    • tangent line — A tangent line touches a curve at one point and has slope equal to the derivative there. It is perpendicular to the radius of a circle and underlies linear approximation and Rolle’s theorem.
  • tilings

    • aperiodic — Aperiodic describes a pattern or tiling that lacks translational periodicity. Penrose tilings and certain quasicrystals have this property, and recent work on a single-tile “ein Stein” example targets it.

    • tiling the plane — Tiling the plane is the process of covering a surface with shapes without gaps or overlaps. It includes regular tilings by triangles, squares, and hexagons, as well as aperiodic examples such as Penrose tiles.

  • triangle — A triangle is a three-sided polygon with three vertices. Special cases include equilateral, isosceles, scalene, and right triangles. Its geometry is governed by results such as Heron’s formula, the law of cosines, Ceva’s theorem, and Thales’s theorem, and classical triangle centers include the orthocenter, centroid, circumcenter, and Euler-line properties; Morley’s theorem is another famous triangle result.
    • altitudes — An altitude is the perpendicular segment from a triangle’s vertex to the opposite side. All three altitudes of a triangle meet at the orthocenter, and one can be used in a proof of the Pythagorean theorem.
      • altitude — An altitude in geometry is a line segment drawn from a vertex perpendicular to the opposite side.

    • circumradius — The circumradius is the radius of a triangle’s circumcircle, the unique circle through all three vertices. For a right triangle, it equals half the hypotenuse, and the law of sines gives it through side-angle ratios.

    • equilateral triangles — Equilateral triangles are triangles with three equal sides and three equal angles, so each angle measures 60 degrees. They appear in results such as Napoleon’s theorem and in fractals like the Koch snowflake and Sierpinski triangle.

      • equilateral — An equilateral triangle has three equal sides and three 60-degree angles, making it the regular triangle with the greatest area-to-perimeter ratio. The faces of the octahedron and icosahedron are equilateral triangles.

      • equilateral triangle — An equilateral triangle is a triangle with three equal sides and three equal angles. It shows up in dot diagrams for triangular numbers, and its regular symmetry makes it central to figures like the Koch snowflake and Sierpiński triangle.

    • hypotenuse — The hypotenuse is the longest side of a right triangle, opposite the right angle. Its length is the one found from the Pythagorean theorem, and it contrasts with the two legs of the triangle.

    • incircle — The incircle is the largest circle that fits inside a triangle, tangent to all three sides. Its center is the intersection of the triangle’s angle bisectors, and its radius equals the triangle’s area divided by its semiperimeter.

    • isosceles — An isosceles figure has two equal sides and two equal angles. In geometry, an isosceles triangle is the standard case of this property, and a trapezoid with equal base angles is also called isosceles.

    • Isosceles triangle — An isosceles triangle has two equal sides and two congruent base angles, with a line of symmetry through a median and angle bisector. A right isosceles triangle has 45-degree angles; the familiar 45-45-90 triangle is a special case, as is the 1-1-square root of 2 triangle. In an isosceles triangle, angle bisectors and the incenter behave symmetrically.

    • obtuse triangle — An obtuse triangle has one angle greater than 90 degrees. Its circumcenter lies outside the triangle, and the Pythagorean relationship no longer holds in the right-triangle form.

    • Right triangle — A triangle with one 90-degree angle. The Pythagorean theorem relates the square of its hypotenuse to the sum of the squares of the other two sides. Its area is often computed as one-half the product of the legs, and it is the standard shape used in ladder and trigonometry problems.
      • 70 feet — The ant is 70 feet from the top of the tree in the right-triangle setup.
    • right triangles — Right triangles are the three-sided figures with one 90-degree angle, so the Pythagorean theorem applies to their two legs and hypotenuse. They also appear in facts about Thales’ theorem, the circumcenter lying on the midpoint of the longest side, and the angle-side-side congruence case that works for them.

      • 30 degrees and 60 degrees — A right triangle with side lengths 2, 2√3, and 4 has non-right angles of 30 degrees and 60 degrees.

      • 68 units — 68 units is the length of the hypotenuse of a right triangle with legs 60 and 32.

      • Pythagorean theorem — A right triangle with a 5-unit leg and a 13-unit hypotenuse has a second leg of 12. This follows from the Pythagorean theorem.

    • scalene — A scalene triangle is one with no equal sides, and by extension no equal angles. The word comes from Greek for uneven, and it is the standard geometry term for a triangle whose three sides are all different.

    • scalene triangle — A scalene triangle is a triangle with all three sides and all three angles unequal. It is one of the basic special triangle types contrasted with isosceles and equilateral triangles.
  • triangle geometry
    • Cevian — A cevian is a segment in a triangle that runs from a vertex to the opposite side or its extension. Medians and angle bisectors are special kinds of cevians.
  • triangle theorems
    • Stewart’s theorem — Stewart’s theorem gives the length of a cevian in a triangle in terms of the side lengths and the two segments it creates on the opposite side. It is commonly remembered by the mnemonic about “a man and his dad,” and it is derived from the law of cosines.
  • Triangles and quadrilaterals
    • Isoceles — An isosceles triangle has two equal sides and two equal base angles, and an isosceles trapezoid has congruent nonparallel sides. The term also applies more generally to geometric figures with a built-in symmetry of equal lengths.

  • two dimensions — A plane or other surface is a two-dimensional manifold, locally homeomorphic to the Euclidean plane. Complex numbers, polar coordinates, and ordinary polygons are all naturally treated in two dimensions.

  • vertical angles — Vertical angles are the opposite angles formed when two lines intersect. They come in equal pairs, so the two angles across from each other have the same measure.

  • vertical lines
    • vertical — Vertical lines are the standard geometry clue behind the vertical line test, and the term also appears in vertical asymptotes and vertical integration. In mathematics and economics alike, it marks a straight-up-and-down direction or arrangement.
  • volumes

    • 2√3 cubic units — The volume of a triangular prism with all edges equal to 2 is 2√3 cubic units.

    • 36 pi cubic feet — Thirty-six pi cubic feet is the volume of a sphere that fits inside a cube of volume 216 cubic feet. The same value also matches the volume of a sphere with diameter 6 feet.

  • π/4 — The ratio π/4 gives the volume of a cylinder relative to the enclosing rectangular prism in the standard comparison of those shapes. It is a simple geometric ratio that often appears in volume arguments.

Euclidean Foundations

• Euclid’s Elements — ~300 BCE; 13 books systematizing geometry from five postulates. The fifth postulate (parallel postulate) is the one that distinguishes Euclidean from non-Euclidean geometry. Its thirteen books also cover plane geometry, proportions, number theory, irrational numbers, and the Platonic solids, and it includes classic results such as the Pythagorean theorem and the infinitude of primes. The work became the standard classical mathematics textbook for centuries and is known for its axiomatic, deductive style.

• Congruence criteria — triangles are congruent by SSS, SAS, ASA, AAS; not by SSA (ambiguous case).

• Similar triangles — corresponding angles equal, sides proportional; AA is sufficient for similarity.

• Angle sum of a triangle — 180° in Euclidean geometry; less than 180° in hyperbolic, more than 180° on a sphere.

• Thales’ theorem — an angle inscribed in a semicircle is a right angle.

• Area formulas — triangle: ½bh or Heron’s formula √(s(s−a)(s−b)(s−c)); circle: πr²; sector: ½r²θ.

• Triangle centers — the centroid (intersection of medians; center of mass) is always inside the triangle; the orthocenter (intersection of altitudes) can be outside for obtuse triangles; the incenter (intersection of angle bisectors) is equidistant from all three sides; the circumcenter (intersection of perpendicular bisectors) is equidistant from all three vertices. For a nonequilateral triangle, the centroid, orthocenter, circumcenter, and nine-point center lie on the Euler line; the incenter generally does not. In an equilateral triangle these centers coincide, so they do not determine a unique Euler line.³

  • centroid — The centroid is the geometric center of a triangle, found at the intersection of its medians and serving as the triangle’s balance point. More generally, it is the center of mass of a figure and the point that minimizes the sum of squared distances in a finite set.

  • circumcenter — The circumcenter of a triangle is the intersection of its perpendicular bisectors and is equidistant from all three vertices. It is also the center of the triangle’s circumscribed circle, and for a right triangle it lies at the midpoint of the hypotenuse.

  • incenter — The incenter is the triangle center where the internal angle bisectors meet. It is equidistant from the sides of the triangle and is used in the area formula involving the semiperimeter.

  • inradius — The inradius is the radius of a triangle’s incircle, measured from the incenter to each side. It appears in the area formula area equals semiperimeter times inradius.

  • nine-point center — The nine-point center is the center of a triangle’s nine-point circle. It lies on the Euler line and is equidistant from the midpoints of the sides and the feet of the altitudes.

  • nine-point circle — The nine-point circle is the circle of a triangle that passes through the midpoints of the sides and the feet of the altitudes. It is also called Euler’s circle and is related to Feuerbach’s theorem and the Euler line.

  • orthocenter — The orthocenter is the point where the three altitudes of a triangle meet. It is the isogonal conjugate of the circumcenter and lies outside an obtuse triangle.

• Angle congruence
  • Congruent or equal — Congruent or equal angles have the same measure. In geometry, alternate interior angles and corresponding angles formed by a transversal are congruent when lines are parallel.
• triangle geometry

  • Ceva’s Theorem — Ceva’s theorem gives the concurrency condition for cevians drawn from the vertices of a triangle to the opposite sides. Its trig form and dual relation to Menelaus’s theorem make it useful for proving the existence of points such as the centroid and incenter.

  • Euler line — In a triangle, the Euler line passes through the circumcenter, centroid, and orthocenter. The center of the nine-point circle also lies on this line, and the circumcenter is the orthocenter’s isogonal conjugate.

  • Euler’s line — Euler’s line is the line in a triangle on which the centroid, circumcenter, and orthocenter all lie. It is a standard configuration in triangle geometry.

• Circle theorems
  • power of a point — The power of a point is the product of the distances from a point to the two intersections of any secant through that point with a circle. Its theorem says this product is independent of the chosen secant line, with tangent segments as a special case.
• Parallel lines and transversals
  • corresponding angles — Corresponding angles are the matching angles formed when a transversal cuts parallel lines, and they are congruent with the alternate interior angles. They occupy the same relative position at each intersection.

• Brahmagupta’s formula — Brahmagupta’s formula gives the area of a cyclic quadrilateral from its side lengths, generalizing Heron’s formula for triangles. It is a special case of Bretschneider’s formula and is named for the Indian mathematician Brahmagupta.

• geometric constructions
  • compass and straightedge — Compass and straightedge are the classic instruments of Euclidean construction geometry. They appear in problems such as angle trisection, doubling the cube, and squaring the circle, and are tied to results by Wantzel, Gauss, and the Mohr-Mascheroni theorem.
• triangle area
  • One-eighth root 3 — The area of a thirty-sixty-ninety triangle with hypotenuse 1 is one-eighth root 3. This is the exact area obtained by taking half the product of the short legs, which have lengths 1/2 and root 3 over 2.
• line segments
  • midpoint — A midpoint is the point exactly halfway between two endpoints on a line segment. It can be found by averaging coordinates in the plane, and related constructions include perpendicular bisectors and Varignon quadrilaterals.
• Heron’s formula — Heron’s formula gives the area of a triangle from its three side lengths using the semiperimeter s, often written A = √(s(s-a)(s-b)(s-c)), where a, b, and c are the side lengths. It is attributed to Heron of Alexandria and is a standard result in Euclidean geometry; the formula can be derived from the Law of Cosines.

Polygons and Polyhedra

• Quadrilateral — a polygon with four sides and four vertices; the sum of interior angles is always 360°; types include parallelogram (two pairs of parallel sides; opposite sides equal), rectangle (parallelogram with right angles), rhombus (parallelogram with equal sides), square (rectangle and rhombus), trapezoid (exactly one pair of parallel sides in US usage; called trapezium in UK), and kite (two pairs of adjacent equal sides); any quadrilateral can be divided into two triangles, giving the 360° angle sum; a cyclic quadrilateral has all four vertices on a circle, and opposite angles sum to 180°. For a cyclic quadrilateral, Brahmagupta’s and Ptolemy’s formulas apply.

• Perimeter — the total length of the boundary of a two-dimensional figure; for a polygon, it is the sum of all side lengths; for a circle, the perimeter is the circumference C = 2πr = πd; for a rectangle, P = 2(l + w); for an equilateral triangle with side s, P = 3s; distinct from area (which measures the enclosed region, not the boundary); in optimization, the isoperimetric inequality states that among all plane figures with a given perimeter, the circle has the maximum enclosed area (equivalently, among shapes of a given area, the circle has the minimum perimeter): 4πA ≤ L², where A is area and L is perimeter, with equality only for circles. It is often denoted P or L.

• Regular polygons — equal sides and angles; interior angle sum = (n − 2) × 180°; each interior angle = (n − 2) × 180° / n.

  • 8 plus 8 times the square root of 2 — This is the area of a regular octagon with side length 2, namely 8 plus 8 square roots of 2. It is a standard exact-form geometry answer for a regular polygon.

  • regular hexagon — A regular hexagon is a six-sided polygon whose angles sum to 720 degrees and whose regular form tiles the plane. It appears in formulas for area, apothem, and sphere packing, and in the faces of the truncated icosahedron.

• Platonic solids — exactly 5: tetrahedron (4 faces), cube/hexahedron (6), octahedron (8), dodecahedron (12), icosahedron (20). All faces are congruent regular polygons with the same number meeting at each vertex. They are the five regular convex polyhedra and are classically associated with Euclid and Plato.

  • (regular) dodecahedron — A regular dodecahedron is a Platonic solid with twelve pentagonal faces and thirty edges, dual to the icosahedron. It appears in the Kepler-Poinsot solids and the icosian game, and it is the regular convex polyhedron with the smallest edge length for a fixed volume.

  • cube — A regular solid with six square faces, twelve edges, and eight vertices; the three-dimensional analogue of a square. It is a Platonic solid with dihedral angles of 90 degrees, Schläfli symbol {4,3}, dual to the octahedron, and the only Platonic solid that tiles space. Related uses include the film Cube, the tesseract as a higher-dimensional analogue, and inverse-cube or cubic-power relations in physics and mathematics.

  • platonic solid screen — A platonic solid is a three-dimensional figure whose faces are all congruent regular polygons. The phrase is also used in basketball for a pick-and-roll screen.

  • regular icosahedron — A regular icosahedron is a Platonic solid with 20 equilateral triangular faces and 12 vertices. It is the dual of the dodecahedron and a common cluster shape in boron chemistry, where it appears in closo-boranes and related compounds.

  • Regular tetrahedron — A regular tetrahedron is the simplest Platonic solid, made of four equilateral triangular faces and four mutually equidistant vertices. It is self-dual, has 12 rotational symmetries, and also appears as the 3-simplex or triangular pyramid.

  • tetrahedron — A tetrahedron is the regular polyhedron with four triangular faces, six edges, and four vertices, also called the 3-simplex or three-dimensional simplex. It is the simplest Platonic solid and the only one that is self-dual. Its volume can be computed with a scalar triple product. Tetrahedra are triangular pyramids with four triangular faces and appear in chemistry and crystallography, including the geometry of methane and the local arrangement of carbon atoms in diamond.

• Euler’s polyhedron formula — V − E + F = 2 for any convex polyhedron (V vertices, E edges, F faces).
  • Euler’s formula (polyhedra) — V − E + F = 2; already in the Geometry section as “Euler’s polyhedron formula.”
• Archimedean solids — 13 semi-regular convex polyhedra with two or more types of regular polygon faces.
  • cuboctahedron — A cuboctahedron is one of the Archimedean solids. It has 14 faces, made up of six squares and eight triangles.
• polygons
  • hexagons — Hexagons are six-sided polygons, and the regular hexagon is the largest regular polygon that can tessellate the plane. They also appear in honeycombs, graphene, and many geometry problems about conics and cross-sections. A regular hexagon has interior angles of 120 degrees, and its area and symmetry often make it a standard polygon in math and games. The shape appears in Rocket League’s Dropshot and in Super Hexagon.
    • hex — Hex is a word for a six-sided figure, but in games it also names the board-game family pioneered by John Nash on a hexagonal grid. The same word appears in hex signs and hexadecimal notation, which uses base 16.
  • quadrilaterals — Quadrilaterals are polygons with four sides, including rectangles, trapezoids, kites, and parallelograms. Special cases such as cyclic quadrilaterals are tied to results like Ptolemy’s theorem and Brahmagupta’s formula.

    • a trapezoid — A trapezoid is a quadrilateral with exactly one pair of parallel opposite sides. It is a standard geometry term distinguished from parallelograms by having only one such pair.

    • cyclic quadrilaterals — A cyclic quadrilateral has all four vertices on one circle. Its opposite angles are supplementary, and Ptolemy’s theorem relates its sides and diagonals.

    • Isosceles trapezoid — An isosceles trapezoid has one pair of parallel sides and congruent nonparallel legs. Its base angles and diagonals are also congruent.

    • kite — A kite is a quadrilateral with two pairs of adjacent congruent sides, and the same word names the flying toy central to Khaled Hosseini’s The Kite Runner. In Athol Fugard’s Master Harold…and the Boys, the toy becomes a memory of Sam and Hally’s friendship, since Hally is stuck on a Whites Only bench.

    • Parallelogram — A parallelogram is a quadrilateral with both pairs of opposite sides parallel. Its opposite sides and opposite angles are congruent, and its diagonals bisect each other. Rectangles and rhombuses are special cases, and it appears in vector addition, Varignon’s theorem, and several standard geometry theorems.

    • Rhombus — A rhombus is a quadrilateral with four congruent sides. Its diagonals bisect each other at right angles, are perpendicular bisectors of one another, and bisect the angles. A square is a special case of the same shape.

    • square — A square is a quadrilateral with four equal sides and four right angles. It is also a rhombus that is simultaneously a rectangle, with diagonals that partition it into four isosceles right triangles.

    • trapezoid — A trapezoid is a quadrilateral with one pair of parallel sides, called the bases, and its area is the height times the average of the bases. It also gives its name to the trapezoidal rule in numerical integration.

  • regular pentagon — A regular pentagon is a five-sided polygon with interior angles of 108 degrees and central angles of 72 degrees. Its diagonals are all the same length, and the side-to-diagonal ratio involves the golden ratio. It appears as a face of the dodecahedron and the truncated icosahedron.

  • apothem — The apothem is the segment from the center of a regular polygon to the midpoint of one side. For a regular polygon, it determines the area through one-half the perimeter times the apothem.

  • diagonals — A diagonal is a segment joining nonadjacent vertices of a polygon, and its count in a convex n-gon is n(n-3)/2. In cyclic quadrilaterals, Ptolemy’s theorem relates products of diagonals and opposite sides, and in parallelograms the diagonals bisect each other.
• dissection puzzles
  • tangrams — Tangrams are the seven-piece dissection puzzles from Chinese recreational mathematics. Their set includes two large triangles, one medium triangle, two small triangles, a square, and a parallelogram or trapezoid, and they are used to form many convex shapes.

Related Concepts and Applications

• Shapes
  • crescent — A crescent is a curved, sickle-like shape, most familiarly seen in the Moon’s phase when less than half illuminated. The term also appears in architecture, as in Bath’s Royal Crescent, a row of houses arranged in a sweeping arc.
• Solid geometry
  • solids of revolution
    • Gabriel’s horn — Gabriel’s horn is the solid formed by revolving the curve y = 1/x for x greater than 1 about the x-axis. It is famous for having finite volume but infinite surface area. The figure is also called Torricelli’s trumpet.
• Solids

  • right circular cylinder — A right circular cylinder is formed by rotating a rectangle around one side, and its volume is πr²h. It is the three-dimensional shape underlying cylindrical coordinates and the shell method in integral calculus.

  • cones — Cones are three-dimensional solids with circular bases, and slicing a double cone produces the conic sections. They also describe geometric light cones in relativity and the acceptance cones of optical fibers.
    • right circular cone — A right circular cone is a solid with a circular base and a single vertex, often studied through slices and conic sections. Its volume is one-third the product of base area and height, and truncating it produces a frustum. The shape appears in classical geometry through Apollonius’s work on conic sections.
  • Frustum — A frustum is the solid formed when the top of a cone or pyramid is cut off by a plane parallel to the base. Its volume and surface-area formulas are standard geometry results for truncated solids; the volume is often expressed in terms of the height and the areas or side lengths of the two parallel faces.
• tilings
  • aperiodic tilings
    • Penrose tiling — Penrose tiling is a nonperiodic tiling of the plane built from shapes such as kites and darts. It is famous for lacking translational symmetry and for its 1970s discovery.

  • tessellation — A tessellation is a tiling of a plane or higher-dimensional space by repeated shapes without gaps or overlaps. It can use congruent tiles that exactly fit the space, including regular examples made from triangles, squares, or hexagons, as well as Penrose tilings and other aperiodic arrangements such as the interlocking patterns associated with Escher; tessellations also appear in mosaics.

  • Penrose tiles — Penrose tiles are aperiodic tilings built from rhombi that obey matching rules and never repeat in a regular lattice. Their nonrepeating symmetry also appears in certain quasicrystals and is associated with Roger Penrose.

Trigonometry

• Trigonometry — Trigonometry is the branch of mathematics concerned with the relationships among the angles and side lengths of geometric figures, especially triangles. Its standard functions include sine, cosine, secant, and tangent; it is often taught with the mnemonic SOHCAHTOA and studied with radian measure and the unit circle. Its development traces back to work associated with Hipparchus.

  • 2sin(x)cos(x) — The double-angle identity for sine is sin(2x) = 2sin(x)cos(x).

  • 2π — The real number equal to 2π, the ratio of a circle’s circumference to its radius. It is the period of the sine and cosine functions, the angle measure around a full circle, and the factor converting ordinary frequency to angular frequency. It appears in formulas for waves, Coulomb’s law, Kepler’s third law, and the Gauss-Bonnet theorem.

  • ambiguous case — The ambiguous case is the trigonometric situation in which solving a triangle with the Law of Sines can produce two possible answers. It occurs when two sides and a non-included angle are given, unlike the Law of Cosines, which avoids that ambiguity.

  • angle measure
    • 2π radians — A complete revolution contains 2π radians. This is the standard conversion between one full turn and radians in rotational physics.
      • Radian — A radian is the standard unit of angular measure defined by the ratio of arc length to radius in a circle. Because a full turn is about 6.28 radians, one radian is roughly 57.3 degrees.
  • angle-related constants
    • π/4 — The value pi over 4 appears in standard trigonometric and geometry calculations, such as solving sin(theta)cos(theta)=1/2 or comparing the area of a circle to a square. It also arises when comparing the volumes of a cone and a square pyramid with matching dimensions. It is also described as the value of the alternating series of reciprocals of the odd positive integers, and it is used as a trigonometric spacing answer and as the distance in radians between consecutive asymptotes for secant graphs with coefficient four.

  • cosine squared — This is the squared cosine of the angle between two polarization axes, the factor that gives Malus’s law for light passing through ideal polarizers. It also explains why unpolarized light loses half its intensity after an ideal polarizer, since the average of the function is one-half.

  • exact values
    • Root 3 Over 3 — Root 3 over 3 is the exact value of tan 30 degrees, and equivalently cot 60 degrees. It is approximately 0.577 and is also written as 1 divided by the square root of 3.
  • identities

    • cos(3x) — cos(3x) is the triple-angle cosine expression, equal to 4cos^3(x) - 3cos(x). It is one of the standard trigonometric identities used to rewrite powers of cosine in terms of a single angle.

    • secant squared of x — The square of the secant function, written sec^2 x, is the derivative of tan x and is equal to 1 + tan^2 x by the Pythagorean trigonometric identity.

  • Pythagorean identity
    • 1 (sine squared x plus cosine squared x) — This determinant comes from the 2×2 rotation matrix with cosine and sine entries. Its value simplifies to 1 because the cosine-squared and sine-squared terms cancel in the expansion.

  • small angle approximation — The small angle approximation replaces sine and tangent of a tiny angle with the angle itself. It is a standard simplification in pendulum problems and other calculations involving nearly linear motion.

  • tangent function — The tangent function equals sine divided by cosine in trigonometry. It has period pi, derivative secant squared, and value 1 at 45 degrees.

  • tangent of theta — For a frictionless banked curve, the required speed depends on the tangent of the banking angle. The same trigonometric ratio gives the slope of a line in polar coordinates and appears in inclined-plane friction problems.

  • tangent of x — The tangent function is the ratio of sine to cosine, and for acute angles it gives opposite over adjacent. It has the derivative secant squared and an antiderivative involving the natural log of the absolute value of secant.

  • trigonometric functions

    • cosecant — Cosecant is the reciprocal trigonometric function that appears in Rutherford-style scattering formulas and in the ideal mechanical advantage of an inclined plane. It is usually written csc and should not be confused with secant.

    • secant function — The secant function is the reciprocal of cosine. Its range excludes values between -1 and 1, and its derivative is secant times tangent. It also satisfies the identity sec²x = 1 + tan²x.

    • sine and cosine — Sine and cosine are the two basic trigonometric functions that describe periodic motion and appear in Fourier series. They also underlie complex exponentials and many standard transforms used in physics and signal processing.

  • Trigonometric identities

    • cosine squared x — Cosine squared x is the Pythagorean identity obtained from one minus sine squared x. It is the squared cosine term that appears when rewriting trig expressions using standard identities.

    • secant squared of theta — Secant squared of theta, written sec^2 theta, is the reciprocal of cosine squared. It is the standard identity equal to tangent squared theta plus one.

• Six functions — sin, cos, tan, csc (1/sin), sec (1/cos), cot (1/tan); defined for right triangles via opposite/hypotenuse, adjacent/hypotenuse, opposite/adjacent; extended to all angles via the unit circle.

• Pythagorean identities — sin²θ + cos²θ = 1; 1 + tan²θ = sec²θ; 1 + cot²θ = csc²θ.
  • tangent squared x — Secant squared x minus 1 simplifies to tangent squared x by a standard trigonometric identity. This follows from the Pythagorean relation between sine, cosine, secant, and tangent.

• Angle addition formulas — sin(A ± B) = sin A cos B ± cos A sin B; cos(A ± B) = cos A cos B ∓ sin A sin B.

• Law of sines — a/sin A = b/sin B = c/sin C = 2R (R = circumradius). It states that in any triangle, each side is proportional to the sine of its opposite angle, and is especially useful for solving triangles when two angles and a side are known.

• Law of cosines — c² = a² + b² − 2ab cos C; generalizes the Pythagorean theorem. It is used to solve oblique triangles when two sides and the included angle are known, or when all three sides are known.

• Radian measure — one radian is the angle subtending an arc equal to the radius; 2π radians = 360°.

• Key values — sin 30° = ½; sin 45° = √2/2; sin 60° = √3/2; cos 0° = 1; tan 45° = 1.

• Euler’s formula — e^(iθ) = cos θ + i sin θ; at θ = π gives Euler’s identity: e^(iπ) + 1 = 0.
  • Euler’s identity — Euler’s identity is the equation e to the i pi plus 1 equals 0, relating e, i, pi, 1, and 0 in a single expression. It is a celebrated identity in mathematics and a special case of Euler’s formula, which relates complex exponentials and trigonometric functions.

• De Moivre’s theorem — (cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ); enables computation of powers and roots of complex numbers and derivation of multiple-angle identities. It is a standard consequence of Euler’s formula and is used in complex-number computations.

• Roots of unity — for a positive integer n, the solutions of zⁿ = 1 are zₖ = exp(2πik/n), with k = 0, …, n−1. They form n equally spaced points on the complex unit circle; for n = 4 these are 1, i, −1, and −i. Under multiplication they form a cyclic group. A primitive nth root generates all n roots by repeated multiplication.⁴ They also generate cyclotomic polynomials and cyclotomic extensions.

• Hyperbolic functions — sinh x = (eˣ − e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ)/2, tanh x = sinh x / cosh x; satisfy cosh²x − sinh²x = 1; appear in solutions to wave and heat equations and in catenary curves.

  • e^x sinh(e^x) — The expression e^x sinh(e^x) is a standard hyperbolic-function form built from the exponential function and the hyperbolic sine. It is typically identified by direct algebraic or calculus manipulation rather than by a special name.

  • hyperbolic cosine — The hyperbolic cosine is the even hyperbolic function defined by (e^x + e^-x)/2. For real inputs it is at least 1 and grows without bound as x increases. Its graph appears in the catenary curve, and it is used in hyperbolic versions of the Pythagorean theorem.

  • hyperbolic secant — The hyperbolic secant, or sech, is the reciprocal of the hyperbolic cosine. It appears in solutions to differential equations and in pulse shapes, including the profile squared in some laser descriptions. It also shows up in the one-soliton solutions connected to Pöschl-Teller potentials.

  • Hyperbolic sine — The hyperbolic sine function is defined by (e^x - e^-x)/2. It is odd, with derivative and antiderivative equal to itself up to constants. Its inverse is a logarithm involving x plus a square root, and in complex analysis it is periodic with period 2πi.

• Trigonometric functions
  • sine — The sine function is a basic trigonometric function equal to the length of the side opposite an angle divided by the hypotenuse in a right triangle. It is also the y-coordinate on the unit circle. Its derivative is cosine, and it appears in small-angle approximations, Fourier expansions of odd functions, and the formula for the magnitude of a cross product. It gives its name to sinusoidal waves and the topologist’s sine curve.

    • sine of x — The sine function of x is commonly written sin(x) and appears in standard derivative and trigonometric identities. It is related to the identity sin(π - x) = sin x and to the usual power-series expansion for sine.

    • sine theta — Sine theta is the trigonometric function often approximated by theta for small angles in physics and optics. It appears in diffraction patterns and pendulum approximations, where the small-angle limit simplifies many calculations.

  • sine function — The sine function gives the vertical coordinate of a point on the unit circle and is the reciprocal partner of cosecant. It appears in trigonometry, De Moivre’s formula, and many physical approximations and series expansions.

  • composite trigonometric expressions
    • sin(cos 2x) — sin(cos 2x) is a composite trigonometric expression that can appear in basic differentiation problems. Its derivative requires the chain rule applied twice, first to the sine and then to the cosine of 2x.
  • Cosine — Cosine is the trigonometric function equal to adjacent over hypotenuse in a right triangle and the x-coordinate on the unit circle. It appears in the law of cosines, vector dot products, rotation matrices, Fourier analysis, and Malus’ law, and is used in spherical harmonics. Its graph is even with value 1 at 0, its derivative is negative sine, and its inverse cosine has principal values from 0 to pi; the hyperbolic analogue is hyperbolic cosine.
    • cosine x — The derivative of cosine x is negative sine x. Cosine x also appears in the Maclaurin series for the cosine function.

  • cosine and secant — In trigonometry, cosine and secant are positive in the fourth quadrant. These two even trigonometric functions have graphs symmetric about the y-axis.

  • cosine function — The cosine function is an even trigonometric function that gives adjacent over hypotenuse in a right triangle and equals 1 at 0. It is the cofunction of sine, the reciprocal of secant, and the function whose Taylor series begins 1 minus x squared over 2 plus x to the fourth over 24. Its name also appears in the law of cosines, and its hyperbolic analogue is used in describing a catenary.

  • cotangent — The cotangent is the reciprocal of tangent, equal in a right triangle to adjacent over opposite. It has a derivative of minus cosecant squared and appears in classical trigonometric constructions and tables.

  • inverse trigonometric functions
    • inverse tangent — The inverse tangent function, also called arctangent, is the inverse of the tangent function. It is used to recover an angle from a slope or ratio, appears in polar coordinates and friction problems on inclined planes, and is an antiderivative of 1/(x^2 + 1) in calculus and trigonometric integration. It also appears in optics through the Brewster angle relation.
  • range
    • -9 and -1 — The graph of y = 4 cos x - 5 is bounded between y = -9 and y = -1. Those values come from the cosine range after scaling by four and shifting downward by five.

  • sine x — The standard trigonometric function sin(x), one of the basic functions in calculus and wave mechanics. It is the antiderivative of cos x, since the integral of cos t from 0 to x equals sin x. Its Taylor series is x - x^3/3! + x^5/5! - …, and its derivative is cos x; correspondingly, d/dx(cos x) = -sin x.

  • tangent — Tangent is the trigonometric function equal to sine divided by cosine, and in a right triangle it is the ratio of the opposite side to the adjacent side. It appears in trigonometric identities, half-angle substitutions, and the Weierstrass substitution. Its graph has vertical asymptotes at odd multiples of pi over 2, its derivative is secant squared, and it satisfies secant squared = 1 + tangent squared.
• trigonometric identities

  • Cosecant squared x — Cosecant squared x is the trigonometric identity equal to one plus cotangent squared x. It appears in calculus and simplification problems as csc^2 x.

  • double-angle formula

    • plus or minus 4 times the square root of 5, over 9 — If sine theta equals 2 over 3, then sine of 2 theta is plus or minus 4 square root 5 over 9.
• Trigonometric ratios
  • 1 over square root of 10 — This is the cosine of the angle a line with slope negative three makes with the x-axis. In simplest form, it is one over the square root of ten.
• trigonometric values
  • -1/2 — The sine of negative 30 degrees is -1/2, and the cosine of 120 degrees is also -1/2. By contrast, the sine of 150 degrees is +1/2.
• Inverse operations
  • inverse — An inverse is the object or function that undoes another one, whether for matrices, functions, or operations. Clues can refer to multiplicative inverses, inverse functions, and inverse relationships such as y proportional to 1 over x.
• inverse trigonometric functions
  • arcsine — The arcsine is the inverse sine function, written as sin⁻¹, and it appears in formulas for the critical angle in total internal reflection. It also gives the half-angle of a Mach cone through the ratio of the speed of sound to the object’s speed.

Calculus and Differential Equations

Understand limits, derivatives, and integrals before differential equations.

Calculus

Origins and Fundamentals

• Founders — Newton (fluxions, 1660s) and Leibniz (notation d/dx and ∫, 1670s–1680s) developed calculus independently; a priority dispute consumed much of their later careers. Leibniz’s notation became standard.
  • Isaac Newton and Gottfried Leibniz — Isaac Newton and Gottfried Leibniz are the two mathematicians each credited with inventing calculus. Newton developed fluxions, while Leibniz published the notation and methods that remain standard today.
• Limits — formal foundation of calculus (Cauchy, Weierstrass, 19th century); lim(x→a) f(x) describes the value f approaches but need not equal f(a). A limit is the value a function or sequence approaches as its input changes, usually written with lim notation. Limits formalize continuity, derivatives, and indeterminate forms through epsilon-delta reasoning and l’Hôpital’s rule. In category theory, equalizers and pullbacks are examples of limits.

  • delta-epsilon proof — A delta-epsilon proof is the standard rigorous way to define a limit in calculus. It says that for every epsilon neighborhood around the output, one can choose a delta neighborhood around the input so the function stays within that tolerance.

  • Indeterminate forms — Indeterminate forms are expressions whose limits do not determine a unique value, such as 0/0 or ∞/∞. They also include forms like 0·∞, ∞^0, and 1^∞, which are often analyzed with l’Hôpital’s rule.

  • limit function — A limit function describes the value a function approaches as its input nears a point. The epsilon-delta definition and L’Hôpital’s rule are standard clues for this calculus idea.

  • limit — A limit is the value a function approaches as its input approaches a point. It underlies continuity, derivatives, improper integrals, the squeeze theorem, and L’Hôpital’s rule.

• Continuity — f is continuous at a if the limit equals the function value; differentiability implies continuity (not vice versa). In epsilon-delta terms, every point has a neighborhood whose image lies within any chosen epsilon-ball; in metric spaces, this means small changes in input force small changes in output. It is central to the intermediate value theorem.

  • continuous — A continuous function has no breaks, holes, or jumps, and its values vary smoothly with its input. This property is preserved by homeomorphisms and appears in the Intermediate Value Theorem, Heine-Cantor theorem, and the epsilon-delta definition of continuity.

  • uniform continuity — Uniform continuity is the stronger form of continuity requiring one delta to work for all points in the domain. It guarantees that sufficiently close inputs always produce close outputs, independent of location.

• L’Hôpital’s rule — if lim f(x)/g(x) is 0/0 or ∞/∞, then lim f(x)/g(x) = lim f′(x)/g′(x) (provided the latter limit exists); resolves indeterminate forms. It is credited to a French mathematician’s 1696 text, though John Bernoulli likely originated it. It is often used after logarithmic rewriting and is closely related to the Stolz-Cesàro theorem for sequences.

• Intermediate value theorem — if f is continuous on [a,b] and k is any value between f(a) and f(b), there exists c in (a,b) with f(c) = k; implies, e.g., that a continuous function changing sign must have a zero. The theorem is often stated as: if f is continuous on [a,b] and k lies between f(a) and f(b), then there exists c in (a,b) with f(c)=k. A standard corollary is that a continuous function that changes sign on an interval must have a root there.

• fluxion — Fluxion is the spelling clue for the archaic term that later became standard in calculus history. The intended answer is the word spelled F-L-U-X-I-O-N.

• constant — A constant quantity or function does not change with time or input. In mathematics and physics, this idea appears in conserved quantities, functions with zero derivative, and time-invariant values such as DC voltage or total energy in an idealized system. Quizbowl clues may connect constants to Liouville’s theorem, constant functions on connected spaces, and conservation laws from Noether’s theorem. The word also describes a number or value that remains fixed rather than varying.

Differential Calculus

• differential calculus
  • Hessian — The Hessian is the square matrix of second partial derivatives of a scalar function. Its eigenvalues are used to classify critical points, including saddle points.

• Rolle’s theorem — if f is continuous on [a,b], differentiable on (a,b), and f(a) = f(b), then there exists c in (a,b) where f′(c) = 0; a special case of (and the basis for proving) the mean value theorem.

• Taylor’s theorem — a smooth function can be approximated near a point by a polynomial (the Taylor polynomial) with an explicit remainder term; underpins numerical analysis, asymptotic methods, and series expansions.

• Derivative — instantaneous rate of change; f′(x) = lim(h→0) [f(x+h) − f(x)] / h. It appears in rules such as the chain rule, Taylor series coefficients, and the computation of acceleration from velocity. Derivatives may be ordinary, partial, or higher-order; the Jacobian and gradient are built from first-order derivatives.
  • points of inflection — Points of inflection are points on a curve where the concavity changes sign. They are often identified by a second derivative equal to zero, though not every zero of the second derivative is one.

• Basic rules — power rule: d/dx xⁿ = nxⁿ⁻¹; product rule: (fg)′ = f′g + fg′; quotient rule: (f/g)′ = (f′g − fg′)/g²; chain rule: d/dx f(g(x)) = f′(g(x))g′(x).

• Common derivatives — d/dx sin x = cos x; d/dx eˣ = eˣ; d/dx ln x = 1/x.

• Critical points and optimization — f′(c) = 0 or undefined at local extrema; second derivative test: f″(c) > 0 → local min; < 0 → local max.
  • stationary points — Stationary points are points where a function’s derivative is zero. They are used in calculus and real analysis, including in Fermat-style arguments about extrema.
    • -2 and 2 — For the polynomial x^3-12x, the stationary points occur at x = -2 and x = 2.
• Mean value theorem — if f is continuous on [a,b] and differentiable on (a,b), there exists c where f′(c) = (f(b) − f(a)) / (b − a). It is commonly used in calculus to relate average speed to a possible instantaneous speed. It underlies the Lagrange remainder form in Taylor’s theorem and is generalized by Cauchy’s mean value theorem.
  • Mean Value — The mean value of a function on an interval is its average value over that interval. It is computed from a definite integral divided by the interval length, and it appears in the mean value theorem.
    • 2/pi — The value is 2/pi, the average of sin x plus cos x over the interval from 0 to pi.

• Taylor — Taylor is a surname and given name attached to several scientific eponyms, including Taylor series, Taylor columns, and the Taylor-Proudman theorem. The same name also appears in public figures such as Taylor Swift, Taylor Lautner, Taylor Kitsch, and drummer Taylor Hawkins.

• Calculus
  • Concavity — Concavity is the property of a curve or function tracked by the sign of its second derivative and by changes at inflection points. In geometry, it is the opposite of convexity.
    • concave — Concave describes a shape that bends inward, like the inside of a sphere. In mathematics and optics, concave lenses spread light and are used to correct myopia. The term also appears in geometry for polygons or sets that are not convex.
  • critical points — Critical points are values where a function’s derivative vanishes or fails to exist, and in several variables they include points where the Jacobian loses maximal rank. They are the places singled out by Fermat’s theorem as candidates for local extrema, and on phase diagrams the term can also mark the endpoints where a line of equilibrium suddenly ends.

    • critical point — A critical point is a point where a function’s derivative vanishes or becomes undefined, and in physics it can mark a second-order phase transition. In phase diagrams, the term also names the temperature-pressure point where liquid and gas become indistinguishable.

    • saddle point — A saddle point is a stationary point that is a local maximum in one direction and a local minimum in another. In calculus and game theory, it is identified by vanishing first derivatives and often appears as the minimax value of a payoff function.

  • Derivative of 3x^3 - 4x^2 + 5x - 13 — The derivative of y = 3x^3 - 4x^2 + 5x - 13 is 9x^2 - 8x + 5. Differentiation applies the power rule term by term to find the rate of change of the function.

  • derivatives

    • 12x + 8 — The second derivative of 2x^3 + 4x^2 - 6x + 2 is 12x + 8. This comes from differentiating the polynomial twice.

    • 7x to the sixth power plus 10x to the fifth power minus 4x to the fourth power — The derivative of 7x^6 + 10x^5 - 4x^4 is 42x^5 + 50x^4 - 16x^3.

    • Derivative of ln(cos 2x) — The expression is the derivative of ln(cos 2x). Using the chain rule gives -2 sin(2x)/cos(2x), which simplifies to -2 tan(2x).

    • Find f prime of x — This asks for the derivative of a polynomial function, so the answer is f prime of x.

    • first derivative — The first derivative measures instantaneous rate of change and gives the slope of a function at a point. It is the operation whose result is set to zero to find critical points and which underlies differentiation and Euler’s method.

    • first time derivative — The first time derivative is the calculus operation that gives rate of change with respect to time. In reaction kinetics and physics, it turns quantities into rates, such as concentration changing into reaction rate.

    • Second derivative — The second derivative measures curvature and concavity, so its sign determines whether a function is concave up or down. It appears in the second derivative test for local extrema and in the Hessian and Laplacian-related analysis of functions.

    • Time derivative — The time derivative measures instantaneous change with respect to time and is often written d/dt or by a dot over a variable. In physics it turns position into velocity and velocity into acceleration, and it appears in Hamilton’s and Euler-Lagrange equations.

  • derivatives of trigonometric functions
    • sec^2 x — The derivative of tangent x is secant squared x, often written sec^2 x. It is the basic trig derivative identity used in calculus.

  • differentiability — Differentiability is the property of having a derivative, and therefore a tangent line, at a point. In complex analysis, holomorphic or analytic functions have the corresponding complex form of this property, while the Weierstrass function is continuous everywhere but nowhere differentiable.

  • differentiable — A function is differentiable if its derivative exists, and this property underlies the mean value theorem and Taylor’s theorem. In complex analysis, the corresponding notion leads to holomorphic or analytic functions.

  • differentiation rules
    • Quotient rule — The quotient rule is the calculus formula for differentiating a ratio of two functions. It says to subtract the numerator times the derivative of the denominator from the denominator times the derivative of the numerator, then divide by the denominator squared.

  • Disk method — The disk method is a calculus technique for finding volumes of solids of revolution by integrating cross-sectional circles or washers. It is used when slices are taken parallel to the axis of rotation, often alongside the shell method.

  • extrema
    • maximum — A maximum is the highest value or point a function attains, often contrasted with a minimum. In analysis and optimization, related language appears in argmax, softmax, and local maxima, and in physics and finance the term describes peak values of quantities or payouts.
  • foundations
    • infinitesimals — Infinitesimals are quantities smaller than any finite positive amount but not equal to zero. They appeared in early calculus and were later used in attempts to make the foundations of calculus more rigorous.

  • Inventor of calculus — The title of inventor of calculus was disputed between Isaac Newton and Gottfried Leibniz during the Prioritätsstreit. The controversy centered on their independent development of differentiation and integration and on competing notations such as fluxions and dx.

  • homogeneous functions
    • Euler’s homogeneous function theorem — Euler’s homogeneous function theorem applies to functions that scale by a fixed power when all variables are scaled together. It gives the relation x dot grad f equals n times f of x for a homogeneous function of degree n.

  • Implicit differentiation — Implicit differentiation is a method for finding derivatives when x and y are tied together in an equation that is not solved explicitly for y. It is used for relations like circles and other curves defined by f(x,y)=c.

  • inflection points — Inflection points are points where a function’s concavity changes. For differentiable functions, they are often detected using the second derivative, with the second derivative equal to zero and the third derivative nonzero in a common test.

  • Integration — Integration is the calculus operation inverse to differentiation. It is used to compute definite integrals, which represent accumulated quantity such as signed area under a graph; an antiderivative can be used to evaluate them. Common techniques include substitution, integration by parts, trigonometric substitution, and partial fractions. Numerical methods include Simpson’s rule and the trapezoidal (trapezium) rule. Related results include the fundamental theorem of calculus, Riemann sums, Fubini’s theorem, and Green’s theorem. Integrals also occur as line, surface, and contour integrals, and integrals of odd functions over symmetric intervals vanish.

    • Darboux integral — The Darboux integral is defined using upper and lower sums over partitions of an interval. It is equivalent to the Riemann integral and generalizes naturally in the Riemann-Stieltjes setting.

    • elliptic integrals — Elliptic integrals are the family of integrals that generalize inverse trigonometric functions and include forms such as the integral defining the elliptic integral of the first kind. They are also associated with Jacobi and Weierstrass functions, which arise by inverting them.

    • Lebesgue integral — The Lebesgue integral is the measure-theoretic generalization of the Riemann integral, extending it to measure spaces and defining it using simple functions and measures. It is useful for functions that are not Riemann-integrable, treats functions that differ only on sets of measure zero as equivalent, and underlies results such as the monotone convergence theorem and the dominated convergence theorem.

    • Method of exhaustion — The method of exhaustion is an ancient Greek precursor to integral calculus. It approximates areas and volumes by repeatedly narrowing bounds, and is associated with Eudoxus and Archimedes.

    • Method of partial fractions — The method of partial fractions is a calculus technique for integrating rational functions by splitting them into simpler terms.

    • Riemann integral — The first rigorous definition of integration, built from tagged partitions and sums of rectangles under a curve. It is equivalent to the Darboux integral, is generalized by gauge integration, and is closely associated with the Riemann sums of Bernhard Riemann. It is a foundational notion in calculus and is often contrasted with Lebesgue integration.

    • Riemann Sums — Riemann sums approximate definite integrals by partitioning a region into thin rectangles and adding their areas. They are the standard limit process behind the Riemann integral.
      • Riemann sum — A Riemann sum estimates area under a curve by breaking a region into rectangles or related shapes and adding their areas. Left, right, midpoint, and trapezoid variants refine the approximation used to define integrals.

    • The integral of dee-u over u — The integral of du over u is the logarithmic antiderivative that gives ln

      u

      plus a constant. It is a standard basic integration result in elementary calculus.

  • intervals
    • closed interval — A closed interval includes both endpoints, such as the interval written with square brackets. These intervals are the ones used in standard statements of the mean value theorem and Rolle’s theorem.

  • linearization — Linearization is the process of turning a nonlinear relationship or equation into one that is approximately linear. It is used in physics and chemistry to simplify differential equations and to make reaction plots fit straight lines.

  • point of inflection — A point of inflection is a point on a curve where concavity changes sign, often where the second derivative crosses zero. In titration and other graph-based analyses, it can mark the equivalence region or the point of maximum slope. A line has no inflection points because its concavity never changes.

  • Squeeze theorem — The squeeze theorem says that if a function is trapped between two others with the same limit, then it has that same limit too. It is a standard tool for evaluating limits in calculus.

  • The chain rule — The derivative of a composite function is the derivative of the outer function evaluated at the inner function, multiplied by the derivative of the inner function. In multivariable calculus it extends through Jacobians, and u-substitution is its reverse in integration.
    • chains — Chains are linked metal loops, but the word also appears in several academic and cultural contexts. They show up in the chain rule, the Communist Manifesto, the binding of Fenrir, and mathematical and polymer terminology.
• derivatives
  • 2x + 2 — The derivative of (1 + x)^2 with respect to x is 2x + 2.
• Rodrigues’ formula — Rodrigues’ formula gives the Legendre polynomials by differentiating an associated expression repeatedly. It is commonly used in generating higher-order Legendre polynomials and in applications to spherical harmonics.

Integral Calculus

• Antiderivative / indefinite integral — F is an antiderivative of f if F′ = f; written ∫ f(x) dx = F(x) + C.

• Definite integral — the signed area under f from a to b; defined as the limit of Riemann sums. It is also used in probability and in many applications where area or accumulated quantity is being computed.

• Fundamental theorem of calculus — Part 1: d/dx ∫(a to x) f(t) dt = f(x); Part 2: ∫(a to b) f(x) dx = F(b) − F(a). Unifies differentiation and integration. It states that differentiation and integration are inverse processes, and in its evaluation form the integral of a continuous function over an interval equals the difference of an antiderivative at the endpoints. Higher-dimensional analogues include Green’s theorem, Stokes’s theorem, and the divergence theorem.

  • First Fundamental Theorem of Calculus — The First Fundamental Theorem of Calculus states that integrating a derivative over an interval recovers the net change in the original function; equivalently, the integral of a derivative over an interval equals the difference of the function’s values at the endpoints. It connects antiderivatives with definite integrals and underlies the generalized Stokes’ theorem in higher dimensions.

  • the Second Fundamental Theorem of Calculus — The second fundamental theorem of calculus says that an integral over an interval is given by evaluating an antiderivative at the endpoints. It is the basis for many standard techniques of integration and underlies generalizations such as Stokes’ theorem.

• Integration techniques — substitution (u-substitution), integration by parts (∫ u dv = uv − ∫ v du), partial fractions, trigonometric substitution.

  • Trigonometric Substitution — Trigonometric substitution is a calculus technique used to evaluate radicals such as the integral of dx over the square root of 9 minus x squared. It replaces algebraic expressions with trig functions to simplify the integrand.

  • u-substitution — U-substitution is a calculus integration technique that rewrites an integral in terms of a new variable, usually chosen so the integrand has the form f(g(x))g’(x). It reverses the chain rule by changing variables to simplify the integrand, and can be used in one-variable, partial, and total forms.

  • integration by parts — Integration by parts is the calculus technique that rewrites the integral of u dv as uv minus the integral of v du. It is often chosen with the LIATE rule, appears in tabular form when repeated, and is the integration analogue of the product rule.

• Improper integrals — integrals over infinite intervals or with singularities; convergent if the limit exists.
  • Improper — An improper integral is an integral that must be defined by a limit because the interval is unbounded or the integrand is singular. The examples here refer to integrating 1 over x at zero, where the usual antiderivative fails directly.
• Definite integrals
  • The definite integral of f(x) from 0 to 1 — The quantity sought is the definite integral of f(x) from 0 to 1.
• Integration theory
  • Lebesgue integration — Lebesgue integration is the measure-based generalization of the Riemann integral. It is defined using measures rather than partitions of the domain, and it behaves well with convergence theorems.
• integral transforms

  • Laplace transformation — The Laplace transformation sends a function of time into a function of a complex variable by integrating against an exponential kernel. It is often used to turn differential equations into algebraic ones.

  • Radon transform — The Radon transform is an integral transform that maps a function on a plane to its collection of line integrals, and filtered back projection is its inverse. It is central to computerized tomography and is often described as a multidimensional Fourier-like tool for reconstructing images from noisy data.

• Fundamental theorems
  • Fundamental Theorems of Calculus — The fundamental theorems of calculus state that differentiation and integration are inverse processes. They connect accumulation with rates of change and underpin results such as the gradient theorem and Stokes’ theorem in higher settings.
• solids of revolution
  • Gabriel’s Horn Paradox — Gabriel’s Horn is the paradoxical solid formed by revolving y = 1/x for x from 1 to infinity about the x-axis. It has finite volume but infinite surface area, a result that gives the paradox its name.

Multivariable and Beyond

• Partial derivatives — ∂f/∂x holds other variables constant; gradient ∇f points in the direction of steepest ascent.

  • partial — Partial describes derivatives taken with respect to one variable while holding others fixed, as well as partial differential equations involving several variables. The same adjective also appears in partial fraction decomposition and in statistical tools such as partial correlation and partial regression.

  • partial derivative — A partial derivative measures the rate of change of a multivariable function with respect to one variable while holding the others constant. It underlies the Jacobian and Hessian matrices and is a basic tool in multivariable calculus and partial differential equations.

  • partial time derivative — A partial time derivative is the derivative with respect to time while holding the other variables fixed. It appears in Hamiltonian mechanics, Liouville’s theorem, Maxwell’s equations, and other settings where time evolution is expressed in differential form.

• Multiple integrals — double and triple integrals over regions; Fubini’s theorem permits iterating the integrals.

• Lagrange multipliers — method for optimizing f(x,y,…) subject to constraint g(x,y,…) = 0; set ∇f = λ∇g and solve simultaneously for variables and multiplier λ. Lagrange multipliers are central to constrained optimization and appear in economics as shadow prices and in the Karush–Kuhn–Tucker (KKT) conditions.

• Calculus of variations — optimizes functionals (functions of functions) rather than ordinary functions; the Euler-Lagrange equation gives necessary conditions; classic problems include the brachistochrone (curve of fastest descent, solved by Bernoulli and Newton) and geodesics.

  • Beltrami identity — In the calculus of variations, Beltrami’s identity is a simplification of the Euler–Lagrange equation for functionals or Lagrangians that do not depend explicitly on the independent variable, especially time-independent Lagrangians. It implies a conserved Hamiltonian quantity.

  • Brachistochrone curve — The brachistochrone is the curve of fastest descent under gravity between two points for a frictionless body. Its classical solution is a cycloid, and its study helped motivate Euler’s development of the calculus of variations.

  • brachistochrone problem — The brachistochrone problem asks for the curve along which a bead or mass will travel from one point to another in the least time under gravity alone. Solved by Bernoulli, Newton, Leibniz, and others using the calculus of variations, it is a classic early problem in that field.

    • brachistochrone — The brachistochrone problem asks for the curve of fastest descent between two points under gravity alone. Its solution is a cycloid, and the problem helped launch the calculus of variations.

    • the brachistochrone problem — The brachistochrone problem asks for the curve of fastest descent under gravity between two points, and its solution is the inverted cycloid. It became a famous challenge for early calculus and was solved by mathematicians including the Bernoullis, Newton, Leibniz, and L’Hôpital.

  • Calculus of variations or variational calculus — Calculus of variations studies functionals and asks for extrema under constraints, often through the Euler-Lagrange equations. Standard examples include the brachistochrone problem and Dido’s problem.

  • Euler-Lagrange equation — The central condition in the calculus of variations for finding stationary paths and surfaces, obtained by setting the variation of the action to zero. In classical mechanics, the Euler-Lagrange equations are the variational equations of motion derived from a Lagrangian; they characterize stationary action, are central to deriving equations of motion for constrained systems, and convert higher-order variational problems into first-order equations. They appear in problems such as the brachistochrone, reduce in special cases to the Beltrami identity, and are commonly paired with Hamilton’s formulation of mechanics.

  • Tautochrone Problem — The tautochrone problem asks for a curve on which a bead or marble reaches the bottom in the same amount of time no matter where it starts. It is a classic problem in calculus of variations and is often illustrated by the cycloid.

  • the calculus of variations — The calculus of variations studies functions that optimize a functional, usually by minimizing or maximizing an integral. Its central equation is the Euler-Lagrange equation, and it is classically associated with the brachistochrone problem.

• Green’s theorem — relates a line integral around a closed planar curve C to a double integral over the enclosed region D: ∮_C (P dx + Q dy) = ∬_D (∂Q/∂x − ∂P/∂y) dA. It can be viewed as a two-dimensional special case of Stokes’s theorem.

• Stokes’ theorem — generalizes Green’s theorem to surfaces in 3D: ∬S (∇ × F) · dS = ∮∂S F · dr; flux of the curl through a surface equals the circulation around its boundary. It is a central result of vector calculus and can also be stated more generally as the integral of a differential form over a manifold equaling the integral of its exterior derivative over the boundary.
  • Kelvin-Stokes’ theorem — Kelvin-Stokes’ theorem relates the curl of a vector field over a surface to the line integral of that field around the surface’s boundary. It is a higher-dimensional analogue of the fundamental theorem of calculus, and its two-dimensional cousin is Green’s theorem.

• Divergence theorem (Gauss’s theorem) — ∭V (∇ · F) dV = ∯∂V F · dS; total divergence in a volume equals net flux through the enclosing surface.

• Implicit function theorem — given conditions on a system of equations F(x, y) = 0, the theorem guarantees the existence of a locally defined function y = f(x) and gives its derivative; foundational in manifold theory and economics. Under suitable differentiability and non-singularity conditions, it applies to equations F(x,y)=0. It is closely related to the inverse function theorem and is used in differential geometry.

• Inverse function theorem — if a differentiable map has an invertible Jacobian at a point, it is locally a diffeomorphism near that point; the derivative of the inverse is the inverse of the Jacobian.

• Jacobian — the matrix of all first-order partial derivatives of a vector-valued function; its determinant measures local volume scaling and appears in change-of-variables for multiple integrals. Its eigenvalues are used to study stability in dynamical systems, and it appears in local invertibility tests and robot kinematics.

• differential operators
  • Laplacian — The Laplace operator, also called the Laplacian, is a second-order differential operator equal to the divergence of the gradient, often written del squared. It is the sum of the second partial derivatives of a function. It appears in harmonic functions, Poisson’s equation, the heat equation, the gravitational potential equation, and in quantum mechanics in the time-independent Schrödinger equation acting on the wavefunction, as well as in physics formulas involving the kinetic-energy term of the Hamiltonian.
• Multivariable calculus
  • change of variables
    • Jacobian determinant — The Jacobian determinant is the factor inserted in a change of variables to account for how volume scales under coordinate transformations. In differential geometry it appears as the absolute value of the pullback factor for forms, and in spherical coordinates it becomes rho-squared sine phi.

  • Clairaut’s theorem — Clairaut’s theorem states that mixed second partial derivatives are equal when the relevant derivatives are continuous. This makes the Hessian matrix symmetric for smooth functions and is sometimes called Schwarz’s theorem.

  • Hessian matrix — The Hessian matrix is the square matrix of second partial derivatives of a multivariable function. It is used in optimization to classify stationary points such as minima, maxima, and saddles, and it underlies methods like BFGS and SR1.

  • Jacobian matrices
    • the Jacobian matrix — This matrix contains all first-order partial derivatives of a vector-valued function. Its determinant appears in change-of-variables formulas, and it gives the best linear approximation to a function near a point.
  • level sets — Level sets are the points where a function takes a constant value, and in two variables they appear as level curves or contour lines. They are a standard way to visualize multivariable functions and to explain why gradients are perpendicular to constraint curves in optimization.
• tensor calculus
  • tensor contraction — Tensor contraction is the operation of summing over a shared index in a tensor expression, such as the Einstein notation A_mu B^mu. It reduces tensor rank, and the trace is a special case obtained by contracting a tensor with the metric.
• tensor notation
  • covariant and contravariant — Covariant and contravariant are terms for different kinds of tensor indices in curved spacetime. They also describe two kinds of four-vectors that differ in the sign of the zeroth component.
• tensors
  • metric tensor — The metric tensor is the symmetric bilinear form that defines distances and spacetime intervals in geometry and relativity. In general relativity it appears with the Ricci tensor in Einstein’s field equations, and in flat spacetime it becomes the Minkowski metric.
• vector calculus
  • vector fields — Vector fields assign a magnitude and direction to each point in space. They include force fields and velocity fields, and their divergence and curl are standard operations on them.
    • vector field — A vector field assigns a vector to each point in space, so it gives both direction and magnitude pointwise. Such fields appear as tangent fields on manifolds and can be conservative or irrotational, with line integrals computed along curves using the field and differential elements.
  • conservative fields

    • conservative vector field — A conservative vector field is one that equals the gradient of a potential function. Such fields are path-independent and have zero curl.

    • path independence — Path independence is the property of a vector field whose line integral depends only on the endpoints, not the route taken. It is characteristic of conservative forces in multivariable calculus.

  • conservative vector fields — Conservative vector fields are vector fields with a potential function. Their line integrals around closed curves vanish, and they have zero curl.

  • curl — The vector calculus operator that measures infinitesimal rotation, circulation density, or vorticity in a vector field, written as del cross with a vector field. It is distinguished from divergence by describing local rotation rather than expansion, vanishes for path-independent fields, and can be pictured with tiny paddlewheels. Curl appears in electromagnetism, including Faraday’s law, Maxwell’s equations, the electromagnetic wave equation, and the definition of a magnetic field from a vector potential.

  • Divergence — Divergence is the vector-calculus operator that measures the net outward flow of a vector field from a point, often written div or del dot. For a field that is itself a curl, its divergence is zero. It appears in Gauss’s theorem, Gauss’s law, the Coulomb gauge condition, and continuity equations; for a fluid velocity field, incompressibility means its divergence is zero. It is a core operator of vector calculus paired with gradient and curl.

  • divergence — In mathematics, this is the property of a series whose partial sums do not approach a finite limit. In vector calculus, it is the del-dot operator that measures how much a field spreads out from a point; in electromagnetism, Gauss’s law relates it to charge density. The term also names the opposite of convergence in series.

  • gradient — In vector calculus, the gradient is the operator del that gives the direction of greatest increase of a scalar field and is orthogonal to level surfaces. It also appears in physics and geometry as the source of directional derivatives, the velocity field in Helmholtz decomposition, and the basis for gradient descent. In graphics, the word also refers to smooth color transitions.
    • the gradient — The gradient is the vector derivative of a scalar field, pointing in the direction of greatest increase. It has magnitude equal to the rate of steepest change and vanishes at local maxima and minima.

  • Green’s identities — Green’s identities are the three vector-calculus identities that relate the divergence theorem, line integrals, and surface integrals. They generalize integration by parts and connect Green’s theorem with higher-dimensional analogues.

  • integral theorems
    • Divergence theorem — The divergence theorem states that the flux of a vector field through a closed surface equals the triple integral of its divergence over the enclosed region. It is a multidimensional analogue of integration by parts and a special case of the generalized Stokes theorem.
  • Normal vectors
    • normal vector — A normal vector is a vector perpendicular to a curve or surface, used to define planes, orientations, and surface integrals. It appears in multivariable calculus, Frenet-Serret formulas, and the geometry of osculating circles.
  • potential functions
    • potential function — A potential function is a physical or mathematical function whose gradient gives a force or whose value encodes stored energy. It appears in fields from electrostatics and fluid mechanics to amortized analysis, where it measures pre-paid work or hidden resources.

  • solenoidal vector field — A solenoidal vector field is divergence-free, meaning its divergence is zero. Magnetic fields are a standard example, and such fields can be expressed in terms of a vector potential.

  • triple product
    • scalar triple product — The scalar triple product combines a cross product and a dot product to give the signed volume of a parallelepiped. It is equivalent to the determinant of three vectors and appears in formulas for volumes of three-dimensional solids.

• Legendre transform — The Legendre transform relates the Lagrangian and Hamiltonian by switching to conjugate variables. It also appears in thermodynamics, where it connects quantities such as Helmholtz free energy and Gibbs free energy.

• multiple integration
  • Fubini’s theorem — Fubini’s theorem says that, under suitable conditions, a multiple integral can be evaluated as an iterated integral in any order. It is a standard result in multivariable calculus, and Tonelli’s theorem is a more general corollary.
• Integral theorems
  • Stokes’s theorem — Stokes’s theorem relates a surface integral of curl over a manifold to the line integral around its boundary, making it a multivariable analogue of the fundamental theorem of calculus. Green’s theorem is its planar special case, and the theorem also appears in forms using differential forms and de Rham cohomology.

Related Concepts and Applications

• integration with respect to time — Integration with respect to time is the calculus operation used to recover quantities such as displacement from acceleration and total energy from power. It appears in models from physics and engineering, including the Stefan–Boltzmann law, op-amp circuits, and control systems.

• line integral — A line integral is an integral taken along a curve, often used to compute work by integrating force along a path. Green’s theorem connects certain line integrals around closed curves to double integrals over the region they enclose.

• Maria Gaetana Agnesi — Maria Gaetana Agnesi was an eighteenth-century Italian mathematician and the first woman appointed professor of mathematics at a university. She is remembered for the curve called the witch of Agnesi and for her analytical textbook Instituzioni analitiche.
  • Maria Agnesi — Maria Agnesi was the 18th-century Italian mathematician and physician who wrote an influential calculus text and was honored by the University of Bologna. She is remembered for the ‘Witch of Agnesi,’ a curve named from a mistranslation of versiera.

• surface integral — A surface integral is a double integral taken over a two-dimensional surface in space. It is used to compute quantities such as flux, including the flux of a vector field through a surface and the flow represented by the Poynting vector.

• tangent to a curve — A tangent to a curve is the line that touches the curve without crossing it at the point of contact. In calculus, its slope is the quantity found by differentiation.

Sequences, Series, and Convergence

Study sequences and convergence after limits and derivatives, then use series to approximate functions.

• Fibonacci sequence — 0, 1, 1, 2, 3, 5, 8, 13, 21, …; each term is the sum of the two preceding. The ratio of consecutive Fibonacci numbers converges to φ. It is associated with the medieval Italian mathematician Fibonacci and with the classic rabbit-growth problem from 13th-century Pisa. It also appears in Pascal’s triangle, Binet’s formula, Zeckendorf’s theorem, Lucas sequences, tilings, and spiral patterns in nature such as sunflower seeds and pinecones.

  • Binet’s formula — Binet’s formula is the closed form for Fibonacci numbers in terms of powers of the golden ratio and its conjugate. It is a standard clue for the Fibonacci sequence and the presence of a one-over-square-root-of-five factor.

  • Fibonacci sequence/numbers — The Fibonacci sequence is the recursive series that begins 0, 1, 1, 2, 3, 5, 8 and is formed by adding each term to the one before it. It appears in rabbit-population models, in Binet’s formula, and in the limit that approaches the golden ratio.

• Pascal’s triangle — triangular array where each entry is the sum of the two above it; row n gives the binomial coefficients C(n,0), C(n,1), …, C(n,n); also encodes Fibonacci numbers (diagonal sums) and Sierpinski triangle (odd entries). Its rows sum to powers of two, and it appears in probability calculations.

• Taylor / Maclaurin series — f(x) = Σ f⁽ⁿ⁾(a)/n! (x − a)ⁿ; Maclaurin is the special case a = 0. Classic examples: eˣ = Σ xⁿ/n!; sin x = x − x³/3! + …; cos x = 1 − x²/2! + …

• mathematical sequences

  • sequence — A sequence is an ordered list of values, often studied in analysis and algebra. Familiar examples include Fibonacci sequences, Cauchy sequences, and exact sequences.

  • sequences — A sequence is an ordered collection, often in mathematics as a list of terms indexed by the natural numbers and studied for patterns such as increase, decrease, convergence, recursion, Cauchy criteria, exact sequences, diagonal arguments, and named examples like the Fibonacci sequence. In music, the term also refers to a medieval chant genre associated with Notker Balbulus.

    • monotonic — A monotonic sequence is one that is entirely nondecreasing or nonincreasing, so it never changes direction. In analysis, the monotone convergence theorem says a bounded monotonic sequence converges.
• Number sequences
  • Lucas numbers — The Lucas numbers are a Fibonacci-like integer sequence generated by the same recurrence as the Fibonacci numbers, but with initial terms 2 and 1 rather than 1 and 1. They are named for the French mathematician Édouard Lucas, and their closed form uses powers of the golden ratio and its reciprocal.
    • 2 and 1 — The pair 2 and 1 is used as the starting terms of the Lucas numbers. The same ordered pair also fits a pKa interval clue involving hydronium.
• Sequences and recurrence relations
  • Fibonacci sequence or numbers — The Fibonacci sequence is the recursive series that begins 0, 1, 1, 2, 3, 5, 8 and is built by summing the previous two terms. It is associated with rabbit population growth, Pascal’s triangle, Lucas numbers, and the golden ratio.
• sequences and recurrences
  • Fibonacci sequence or Fibonacci numbers — The Fibonacci sequence is the recursive integer sequence whose terms satisfy the rule that each entry is the sum of the previous two. It is written in closed form by Binet’s formula, appears in Pascal’s triangle, and has ratios that approach the golden ratio.
• Sequences and series
  • Arithmetic sequences
    • arithmetic sequence — An arithmetic sequence is a sequence of numbers whose consecutive terms differ by a constant amount. Arithmetic sequences are also called arithmetic progressions. They appear in results such as Dirichlet’s theorem on primes in progressions and the Green-Tao theorem on long prime progressions.

  • Cauchy criterion — The Cauchy criterion states that a sequence converges if and only if its terms eventually become arbitrarily close to one another. It is a standard test for convergence that does not require knowing the limit in advance.

  • Convergent sequences
    • convergent sequence — A convergent sequence is one whose terms approach a single limit. For geometric sequences, convergence occurs when the common ratio has absolute value less than 1, while larger ratios produce divergence.
  • geometric sequences
    • geometric sequence — This is a sequence in which each term is obtained by multiplying the previous term by a constant ratio. Examples include 3, 6, 12, 24, where the common ratio is two.
  • recurrence relations

    • n+1 (“n plus one”, — The function n+1 is the successor function that sends an integer to the next larger integer. It appears in induction proofs, Pascal’s triangle, the pigeonhole principle, and polynomial remainders such as P(-1) when dividing by x+1.

    • recurrence relation — A recurrence relation, also called a difference equation, defines each term of a sequence from earlier terms. It is a discrete analog of a differential equation and can often be solved by unrolling or with tools such as the z-transform. The Fibonacci sequence is the classic example, with each term equal to the sum of the two before it.

  • series — A series is a sum of the terms of a sequence, finite or infinite. Common examples include geometric, Fourier, power, and Taylor series, and convergence is tested with tools such as the ratio, root, and integral tests. The harmonic series is a standard divergent example.

    • Basel problem — The Basel problem asks for the sum of the reciprocals of the squares, and Euler showed that it equals pi squared over six. It is a classic example of a series evaluation tied to the zeta function.

    • geometric series — A geometric series is a series whose terms have a constant ratio, so each term is obtained by multiplying the previous one by the same number. Its infinite sum converges when the common ratio has absolute value less than one, and then equals the first term divided by one minus the ratio.
      • 1 /(1 - x) — This is the first-order Taylor expansion of the geometric-series function 1/(1-x) near x = 0. To first order, it is written as 1 + x.

    • harmonic series — This sequence of frequencies consists of the fundamental and its overtones, each an integer multiple of the base frequency. The same phrase also names the divergent sum of the reciprocals of the positive integers.

    • infinite series — An infinite series is an endlessly summing sequence of terms, with familiar examples including the harmonic series, power series, and Taylor series. Such series can represent analytic functions and are central to techniques like Frobenius methods and convergence tests.

    • Taylor series expansion — A Taylor series expansion, or Taylor series, is a power series representation of a function in terms of its derivatives at a chosen point. When centered at zero, it is called a Maclaurin series. Taylor series are used to approximate analytic functions and underpin many standard expansions in calculus and complex analysis. The leftover term after truncation is the remainder.
      • Brook Taylor — Brook Taylor was the English mathematician whose name is attached to Taylor series, which expand functions using derivatives at a point.
  • Cauchy sequences — A Cauchy sequence is one whose terms eventually become arbitrarily close to each other. In a Banach space, every Cauchy sequence converges, making Cauchy sequences the basic test objects for completeness.

    • A Cauchy sequence — A Cauchy sequence is one whose terms eventually become arbitrarily close to one another. In a metric space, this means that for every epsilon there is an index beyond which all later terms are within epsilon of each other.

    • Cauchy sequence — A Cauchy sequence is a sequence whose terms eventually become arbitrarily close to one another, named for Augustin-Louis Cauchy. In a complete metric space every Cauchy sequence converges, so the idea is central to Banach spaces and completeness.

• Integer sequences
  • the Lucas series — The Lucas series is a related integer sequence beginning 1, 3, 4, 7, 11, 18. It is named for the Cambridge mathematician Édouard Lucas, after whom the Lucas Chair is also named.

• OEIS — The OEIS is the On-Line Encyclopedia of Integer Sequences, a database of numbered integer sequences created by Neil Sloane. Its entries are labeled with A-numbers and include classic lists such as the primes and the Fibonacci numbers.

• Convergence tests
  • ratio test — The ratio test determines convergence of a series by examining the limit of the absolute value of successive terms, usually \|a_{n+1}/a_n\|. It is especially useful for series with factorials or powers, but is inconclusive when the limiting ratio is 1.

Differential Equations

• Differential equations — Differential equations are equations involving an unknown function and one or more of its derivatives. They come in ordinary and partial forms, and standard clues include separable equations, existence-and-uniqueness theorems, and systems such as Lotka–Volterra.
  • autonomous differential equations
    • autonomous — An autonomous differential equation has the independent variable separated out, so the derivative depends only on x and not explicitly on t. The word also describes a region or country with a degree of self-government.
  • boundary conditions — Boundary conditions specify constraints at the edge of a domain for a differential equation, such as Dirichlet, Neumann, Robin, or Cauchy types. They are part of boundary value problems and help determine whether a solution is unique and well posed.
    • boundaries — Boundaries are the dividing edges between regions, domains, or habitats, and they matter in ecology, differential equations, and materials science. In the science clues here they appear as habitat edges, the domain edges for boundary-value problems, and the surfaces where no-slip conditions are imposed.
      • boundary — A boundary is the outer edge of a region or space, such as the points where an interval ends or where a manifold stops. In differential equations and topology, boundary conditions and boundary operators describe behavior on that edge, while concepts like Stokes’s theorem and closure use it directly.
  • boundary value problems — Boundary value problems are differential-equation problems in which conditions are specified at the boundaries of the domain. They include Dirichlet and Neumann setups and appear in contexts such as Green’s functions and Sturm-Liouville theory.
    • Dirichlet problem — The Dirichlet problem asks for a function satisfying Laplace’s equation on a region while taking prescribed values on the boundary. Its solutions are harmonic functions, and it appears in potential theory and steady-state heat flow.

  • differential equation — A differential equation is an equation that relates a function to one or more of its derivatives. They come in ordinary and partial forms, and methods like Euler’s method can be used to approximate their solutions.

  • eigenfunctions
    • e^{kx} — If a function is an eigenfunction of differentiation with eigenvalue k and y(0)=1, then the solution is y(x)=e^{kx}.

  • exact equation — An exact equation is a differential equation of the form M dx + N dy = 0 where the mixed partials satisfy dM/dy = dN/dx. These equations are solved using a potential function whose total differential matches the given form.

  • first-order ordinary differential equations — First-order ordinary differential equations relate a function to its first derivative and include models of population growth and falling objects. They are often approached with slope fields, Euler’s method, and Runge-Kutta style numerical methods.

  • Floquet theory — This method analyzes linear differential equations with periodic coefficients by studying the exponential growth rates of solutions over one period. Its key objects are characteristic multipliers and quasi-energies, and it is used in work on the Mathieu equation and discrete time crystals.

  • Green’s function — Green’s function is an integral kernel used to solve inhomogeneous linear differential equations, often defined by the response to a delta source. For differential operators, convolving this kernel with a source term produces the solution, and in simple cases such as the 3D Laplacian it is the namesake impulse response.

  • integrating factors — An integrating factor is a function used to make a first-order differential equation solvable by multiplication. For equations of the form y’ + q(x)y = j(x), it is e to the antiderivative of q(x).

  • logistic equation — It models bounded population growth with a carrying capacity. In dimensionless form it is often written dx/dy = r x(1 - x); the corresponding population form uses a limiting factor such as 1 - N/K, giving sigmoidal growth.

  • method of Frobenius — The method of Frobenius is a power-series technique for solving linear differential equations near singular points. It is especially useful for equations such as Bessel’s equation, where solutions are written as a series times a power of x minus x sub zero.

  • ordinary differential equation — An ordinary differential equation is an equation involving derivatives of a function of one independent variable. Unlike partial differential equations, ODEs are often introduced through examples solvable by separation of variables.

  • ordinary differential equations — Ordinary differential equations are equations involving derivatives of a function of one variable, and they often require initial or boundary data to determine a specific solution. Standard tools for solving them include integrating factors, Runge-Kutta methods, and Picard–Lindelöf existence and uniqueness theory.

    • Euler method — The Euler method is a simple numerical scheme for solving ordinary differential equations from an initial value. It advances the solution by adding the derivative times the step size, using the first term or two of a Taylor expansion.

    • solutions to ordinary differential equations — These are functions that satisfy equations involving themselves and their derivatives, and they are the target of initial value and boundary value problems. Standard methods for finding them include separation of variables, Picard iteration, and variation of parameters.

    • solving (ordinary) differential equations — Solving ordinary differential equations is the task of finding a function that satisfies an equation involving derivatives. Standard methods include separation of variables, Picard iteration, Euler and Runge-Kutta schemes, and other numerical and analytic techniques.

  • partial differential equations — Partial differential equations are equations involving derivatives with respect to more than one variable. Standard examples include the wave and heat equations, and they are often discussed alongside boundary conditions, characteristics, and methods such as Lax pairs or homotopy approaches.

    • eikonal equation — The eikonal equation is a nonlinear partial differential equation used in wave propagation and ray optics. It relates the gradient norm of a travel-time function to the reciprocal of wave speed and can be solved numerically with fast marching methods.

    • harmonic functions — Harmonic functions are functions whose Laplacian is zero, so they satisfy Laplace’s equation. They have the mean-value property and appear in potential theory, complex analysis, and the classical Dirichlet problem.

    • Korteweg-de Vries equation — The Korteweg-de Vries equation is a nonlinear partial differential equation used to model shallow-water waves and solitons. It is integrable by inverse scattering, with famous soliton solutions, and in standard form is written u_t + 6uu_x + u_{xxx} = 0. Related forms include the modified KdV equation and the KP equation; it is named for Korteweg and de Vries.

    • Laplace’s equation — Laplace’s equation is the partial differential equation satisfied by harmonic functions, written as del squared u equals zero. It governs steady-state heat flow, incompressible velocity potentials, and electrostatic potential in charge-free regions. Its solutions have the mean-value property and appear in special-function contexts such as spherical harmonics, whose simplest form is a constant multiple of the square root of 1 over pi. In two dimensions its fundamental solution is proportional to negative log r.

    • parabolic equations
      • parabolic partial differential equation — A parabolic partial differential equation is the type exemplified by the heat equation. It is named for the conic section associated with projectile motion, and it typically involves a time derivative and a Laplacian.

    • Poisson equation — The Poisson equation is the inhomogeneous form of Laplace’s equation, with the Laplacian of a potential set equal to a source term such as charge density. It appears in electrostatics, gravity, fluid dynamics, and screened variants like the Poisson-Boltzmann equation.

    • Sine-Gordon equation — The sine-Gordon equation is a nonlinear partial differential equation famous for soliton solutions such as kinks, antikinks, and breathers. In one form it reads as a wave equation with a sine term, and it appears in models like the Frenkel-Kontorova chain. Its name alludes to the Klein-Gordon equation, though the two are different.

  • Separable differential equation — A separable differential equation is one whose right-hand side can be written as a product of a function of x and a function of y. This allows the variables to be rearranged so each side of dy/dx depends on only one variable.

  • separation of variables — Separation of variables is a standard method for solving differential equations by splitting the unknown into single-variable factors. It is used for first-order ODEs and for PDEs such as the heat and wave equations, often producing a product like X(x)T(t).

  • Sofia Vasilyevna Kovalevskaya — Sofia Vasilyevna Kovalevskaya was a Russian mathematician known for work on partial differential equations, elliptic integrals, and the rotation of rigid bodies. She earned a doctorate at Göttingen under Weierstrass and later became a professor in Stockholm, one of the first women to hold such a post at a European university.

  • solution methods
    • method of variation of parameters — The method of variation of parameters is a standard way to solve inhomogeneous linear differential equations. It starts from a fundamental set of homogeneous solutions and uses the Wronskian to build a particular solution.

  • solving differential equations — Solving differential equations means finding functions that satisfy equations involving derivatives. Standard methods include separation of variables, integrating factors, Euler’s method, Runge-Kutta methods, and numerical schemes for initial and boundary value problems.

  • uniqueness — Uniqueness is the property that there is exactly one solution, especially in well-posed differential equations and initial value problems. It also appears in results such as the fundamental theorem of arithmetic, the method of images for Poisson’s equation, and the failure of Newton’s second law to guarantee a unique solution in Norton’s dome.

  • Wronskian — The Wronskian is a determinant built from a set of functions and their successive derivatives. In differential equations, a nonzero Wronskian shows the functions are linearly independent and can form a fundamental solution set.

  • Wronskian determinant — The Wronskian determinant is a determinant formed from a set of functions and their derivatives up to order n minus one. It is used to test linear independence of solutions to linear differential equations.

  • Green’s functions — Green’s functions are integral kernels used to solve linear differential equations by giving the response to a point source. They are closely tied to impulse-response language, the Dirac delta function, and applications in quantum mechanics and boundary-value problems.

• Ordinary differential equation (ODE) — equation relating a function of one variable to its derivatives; order = highest derivative present; e.g., y′ = ky has solution y = Ce^(kt).

• Separable equation — ODE of the form dy/dx = f(x)g(y); solved by separating variables and integrating both sides: ∫ dy/g(y) = ∫ f(x) dx.

• Laplace transform — integral transform ℒ{f(t)} = ∫₀^∞ e^(−st) f(t) dt; converts ODEs into algebraic equations in s; inverse transform recovers the solution. It sends a function of time into a function of the complex variable s. It is especially useful for solving linear differential equations, handling step functions, and analyzing systems through transfer functions and convolution.

• Dirac delta distribution — the unit impulse δ is defined by its action on a smooth test function: ∫δ(x − a)φ(x) dx = φ(a). It is a distribution rather than an ordinary function with a finite height at a. In mechanics, F(t) = Jδ(t − t₀) represents an idealized impulse of magnitude J at time t₀. The derivative of the Heaviside step function is δ in the distributional sense.⁵ It is commonly used in sampling, Green’s functions, and signal processing, and is often treated as a limit of narrow ordinary functions with total integral 1.

• Fourier series — decomposes a periodic function into sums of sines and cosines: f(x) = a₀/2 + Σ (aₙ cos nx + bₙ sin nx); coefficients given by orthogonality integrals. They can also be written using complex exponentials, and their orthogonality on the circle underlies the coefficient formulas. Fourier series are notable for the Gibbs phenomenon near discontinuities.
  • Jean-Baptiste Joseph Fourier — A Fourier series represents a function as a sum of sines and cosines. The method is named for Jean-Baptiste Joseph Fourier, whose work lies at the center of harmonic analysis.

• Fourier transform — extends Fourier series to non-periodic functions: F̂(ξ) = ∫ f(x) e^(−2πiξx) dx; fundamental to signal processing, PDEs, and quantum mechanics. It is central to Parseval’s theorem, Plancherel’s theorem, the Cooley-Tukey FFT algorithm, and diffraction-based imaging.

• Heat equation — ∂u/∂t = α ∇²u; models diffusion of heat (or other quantities) over time; one of the canonical parabolic PDEs; solution via Fourier series or the heat kernel. It can also be solved by finite-difference schemes such as Crank-Nicolson.
  • heat kernel — The heat kernel is the fundamental solution to the heat equation, often written as a Green’s function or kernel on a manifold. In one dimension it has the familiar Gaussian form and appears in spectral theory, index theorems, and quantum-field calculations.

• Wave equation — ∂²u/∂t² = c² ∇²u; models propagation of waves (sound, light, strings); one of the canonical hyperbolic PDEs. The standard second-order hyperbolic PDE for propagating disturbances in space and time. In electromagnetism, the Lorenz gauge makes the equations for the potentials take this form with source terms from charge and current densities; its solutions include d’Alembert’s traveling waves.

• Laplace equation — ∇²u = 0; solutions are harmonic functions; models steady-state heat, gravitational potential, and electrostatics; one of the canonical elliptic PDEs.

• Sturm-Liouville theory — framework for second-order linear ODEs with boundary conditions yielding eigenfunctions that form orthogonal bases; unifies the theory of Fourier series, Legendre polynomials, and Bessel functions. It is also described as a broad class of second-order differential equations recast as eigenvalue problems, with orthogonality relations taken with respect to a weight function.

• boundary-value methods
  • the technique or method of images — The method of images is a mathematical technique for solving boundary-value problems by replacing a boundary with a reflected source or charge. It is used in electrostatics and in fluid flow problems involving vortices near walls or inside cylinders.
• Laplace transforms
  • Bromwich integral — The Bromwich integral is the contour integral used to write the inverse Laplace transform. It is taken over a vertical line in the complex plane to the right of the integrand’s singularities.
• mathematical transforms
  • transform — A transform is an operation that can rewrite a problem into a different domain or break a compound into smaller pieces in retrosynthesis. The Laplace transform sends a function of time into a function of a complex variable by integrating against an exponential kernel.
• Transforms
  • z-transforms
    • z-transform — The z-transform is the discrete-time analogue of the Laplace transform. It represents a sequence as an infinite sum in a complex variable and has a region of convergence that forms an annulus.

• Dirac delta functions — Dirac delta functions are idealized infinitely narrow functions named for Paul Dirac that integrate to 1 and vanish almost everywhere. They are used in physics and engineering to represent point sources and to model discrete particles through the sifting property.

• Fourier analysis

  • discrete Fourier transform — The discrete Fourier transform converts a signal from position or time space into momentum or frequency space, and fast algorithms like Cooley–Tukey make it practical on large inputs. It also appears in short-time form for spectrograms and in the nearly free electron model, where periodic functions are expanded into reciprocal-lattice components.

  • frequency domain — The frequency domain is the representation of a signal in terms of frequencies rather than time. It is reached from the time domain by the Fourier transform and inverted by the inverse transform.

  • Gibbs phenomenon — The Gibbs phenomenon is the oscillatory overshoot that appears near a jump discontinuity in a Fourier series. It is named for J. Willard Gibbs, whose name also appears in thermodynamics.

  • Parseval’s theorem — Parseval’s theorem says that the total energy of a signal is preserved when moving between the time domain and the frequency domain. It also gives an identity for Fourier coefficients that is used in analytic number theory and harmonic analysis.

• integral transforms
  • Hankel transform — The Hankel transform is an integral transform used to solve rotationally symmetric problems, especially Laplace’s equation in cylindrical coordinates. Its kernel involves a Bessel function, and the two-dimensional Fourier transform of a radially symmetric function gives the zeroth-order Hankel transform.

Linear and Abstract Algebra

Build from vectors and linear maps to matrices and algebraic structures.

Linear Algebra

• linear algebra — Linear algebra is the branch of mathematics concerned with vector spaces, matrices, and systems of linear equations. It studies invertibility, bases, eigenvalues, and the structure of linear transformations.

  • adjoint — The adjoint of a linear map is the operator defined by moving the map across an inner product, so that it preserves pairings on an inner product space. For a matrix, the adjoint is the conjugate transpose.

  • adjoints
    • Adjoint of A — The adjoint of a matrix is formed by taking the cofactor matrix and then transposing it. It is a standard construction in linear algebra related to matrix inversion.
  • Bases

    • basis — A basis is a linearly independent spanning set, so its size gives the dimension of a vector space. The term also appears in algebra in names such as Hamel bases and Gröbner bases, and in the Gram-Schmidt process for constructing orthogonal bases.

    • basis set — A basis set is a linearly independent spanning set for a vector space. In topology and linear algebra, the term also appears in standard phrases such as basis for a topology, standard basis, and orthonormal basis.

  • basis theorems
    • Steinitz exchange — The Steinitz exchange is a linear algebra result used to prove that all bases of a finite-dimensional vector space have the same cardinality. It works by swapping vectors from an independent set with vectors from a spanning set.

  • characteristic polynomial — The characteristic polynomial of a square matrix is obtained by setting det(A - λI) = 0; its roots are the matrix’s eigenvalues. It is unchanged under similarity, and by the Cayley-Hamilton theorem a matrix satisfies its own characteristic equation, so evaluating the polynomial at the matrix itself gives the zero matrix.

  • Cramer’s Rule — Cramer’s rule is a determinant-based method for solving systems of linear equations. It replaces columns in the coefficient matrix with the right-hand side vector and works only when the system matrix is invertible.

  • dependent — A dependent variable is the quantity that changes in response to other variables, such as the output of a function or the vertical axis on a graph. In linear algebra, dependent vectors include one that can be written as a linear combination of the others, and dependent equations may produce infinitely many solutions.

  • determinant — A determinant is the alternating multilinear scalar associated with a square matrix; a matrix is singular exactly when its determinant is zero. Determinants appear in eigenvalue calculations, Cramer’s rule, the Wronskian, and for a 2-by-2 matrix the formula is ad − bc.

    • determinant of a matrix — The determinant of a matrix is the scalar computed from a square matrix that vanishes exactly when the matrix is singular. For a 2-by-2 matrix, it equals ad minus bc and can be evaluated by cofactor expansion or related identities such as Jacobi’s formula.

    • y equals five — This is the missing entry in a 2-by-2 determinant problem with matrix rows (4, -3) and (-7, y). Setting the determinant 4y - 21 equal to -1 gives y = 5.

  • diagonal — A diagonal is a line segment joining nonadjacent vertices of a polygon, and in matrices it refers to the line of entries from the upper left to the lower right. Diagonal matrices have all nonzero entries confined to that main line, and diagonalizable matrices are those similar to such a form.

  • diagonalizability — A matrix is diagonalizable when it is similar to a diagonal matrix, so that some basis of eigenvectors exists. For square matrices, this happens exactly when each eigenvalue’s geometric multiplicity equals its algebraic multiplicity.

  • diagonalization — Diagonalization is the process of transforming a matrix into a diagonal form using its eigenvectors or related bases. It appears in linear algebra, quantum mechanics, and logic, where diagonal arguments are used to prove impossibility and uncountability results.
    • diagonalizable — A matrix is diagonalizable when it has enough linearly independent eigenvectors to form a basis, equivalently when it can be written as PDP^{-1} for an invertible P and a diagonal matrix D. Distinct eigenvalues guarantee diagonalizability, and commuting matrices can sometimes be simultaneously diagonalized.
  • dimension — Dimension is the measure of how many coordinates or independent variables are needed to describe a space or vector space. In linear algebra it is the size of a basis, and for Euclidean space Rn it is n. The term also appears in geometry, topology, and fractal geometry, where familiar examples include a square or cube and their usual dimensions. More advanced clues can invoke Krull dimension, rank-nullity, or the dimension of a representation.

    • Dimensions — Dimensions are the number of coordinates needed to specify a point, and they measure the size of geometric or abstract spaces. In physics they are used to describe space and time, with spacetime commonly treated as four-dimensional; higher-dimensional models appear in string theory and M-theory, including M-theory’s eleven dimensions. The term also appears in rank-nullity, vector spaces and eigenspaces, Minkowski spacetime, Kaluza-Klein theory, fractal geometry, PCA, and the curse of dimensionality.

    • fractal dimension — Fractal dimension measures the effective scaling size of self-similar sets such as the Cantor set, Sierpinski triangle, and Koch snowflake. Common versions include Hausdorff, Minkowski, and box-counting dimension, which can be non-integer for fractals.

  • dual spaces
    • dual space — The dual space of a vector space is the space of its linear functionals, often denoted V-star. It is connected to the Riesz representation theorem, the double dual embedding, and, for locally compact abelian groups, the group of continuous homomorphisms into the circle group.
  • eigenvalues — Eigenvalues are scalars associated with a linear transformation or square matrix, defined by Ax = λx for some nonzero vector x or equivalently by det(A − λI) = 0. They are the roots of the characteristic polynomial; for a triangular matrix they are the diagonal entries, and their sum equals the trace while their product equals the determinant.

    • algebraic multiplicity — Algebraic multiplicity is the number of times an eigenvalue is repeated as a root of a characteristic polynomial. It is compared with geometric multiplicity, and for any eigenvalue it is always at least the geometric multiplicity.

    • eigenvalue — An eigenvalue is a scalar associated with a linear operator or square matrix such that Av = λv for some nonzero vector v. The eigenvalues of a matrix are the roots of its characteristic polynomial and their sum equals the trace.

  • eigenvalues and eigenvectors
    • principal — In mechanics, principal values are the special orthogonal axes, stresses, or moments of inertia singled out by diagonalizing a tensor or matrix. The term also appears in Mohr’s circle and in principal component analysis, where it marks the dominant directions or eigenvalues of a system.

  • eigenvector — An eigenvector is a nonzero vector that a linear transformation sends to a scalar multiple of itself. In matrix terms, multiplying by the matrix leaves the vector unchanged except for a scaling factor. The associated scalar is the eigenvalue.

  • eigenvectors — Eigenvectors are vectors that are scaled, rather than rotated, by a linear transformation. The associated scalars are eigenvalues, and for semisimple matrices these vectors can form a basis for the space.

  • elimination
    • Gauss-Jordan elimination — Gauss-Jordan elimination is the row-reduction procedure used to solve systems of linear equations and to invert matrices. It brings an augmented matrix to reduced echelon form by pivoting and elementary row operations, and is named for Gauss and Jordan.

  • Gauss-Jordan method — The Gauss-Jordan method is a matrix technique for solving systems of equations by row reduction. It reduces a matrix to row-echelon or reduced row-echelon form by elementary row operations.

  • general linear group — The general linear group GL(n) is the group of invertible n-by-n matrices over a ring or field under matrix multiplication. In algebraic group theory, complete flags are parametrized by Borel subgroups of this group.

  • Hermitian matrices — Hermitian matrices are the complex analogue of symmetric matrices, defined by equality to their conjugate transpose. As a result, they have real eigenvalues and are central objects in linear algebra and quantum mechanics, where they represent observables.

  • Householder transformations
    • Householder transformation — A Householder transformation is a reflection used in linear algebra, often applied to QR factorization. It can be written as the identity matrix minus a rank-one term built from a normal vector.

  • inverse — For a square matrix, this is the matrix that reverses a linear transformation when it is defined and undoes the matrix’s action under multiplication. It does not exist when the determinant is zero, when the rank is less than n, or when zero is an eigenvalue. A nonzero determinant is the key condition for its existence; for example, a 2 by 2 matrix with entries 8, 5, 6, and 5 can be inverted if its determinant is nonzero.

  • invertibility — The property of having an inverse, whether for a function, matrix, or algebraic element, so it can be undone or multiplied to yield the identity. In linear algebra, an invertible matrix is nonsingular, has nonzero determinant, and is row-equivalent to the identity; invertibility also applies to inverse maps and reciprocals.

  • invertible matrices
    • Invertible matrix — An invertible matrix is a square matrix that defines a linear transformation which is both one-to-one and onto. Equivalent clues include having no zero eigenvalue, a trivial kernel, pivot positions in every column, and columns that are linearly independent and span the whole space.

  • Jordan canonical form — Jordan canonical form is a matrix normal form made of upper-triangular Jordan blocks and is used to study eigenvalues and minimal polynomials. It generalizes diagonalization by placing ones on the superdiagonal within each block.

  • kernel and image — The kernel and image of a map are the set of inputs sent to zero and the set of outputs actually attained, respectively. For linear maps, the rank-nullity theorem links their dimensions to the dimension of the domain.

  • Kernels
    • kernel — In linear algebra, the kernel is the set of inputs a map sends to zero, and for a linear transformation it is the same as the null space. The word also appears in machine learning and integral transforms, where kernels package similarity or integration data through functions such as the kernel trick and Mercer kernels.

  • Kronecker delta — The Kronecker delta is a discrete two-variable function or symbol that equals 1 when its indices are equal and 0 otherwise. It is symmetric in its indices, functions like the identity matrix in index notation, and is the identity-matrix analogue of the Dirac delta. It appears throughout tensor notation, orthogonality relations, and combinatorics.

  • linear — Linear describes equations, molecular geometry with 180-degree bond angles, and mathematical structures governed by first-degree relations. It also names the branch of algebra concerned with vectors and matrices, and appears in quantum chemistry, optimization, and the classification of molecules such as acetylene or carbon dioxide.

  • linear independence — Linear independence is the vector-space property that no vector is a linear combination of the others. It also underlies nonzero determinants, bases, and the Wronskian tests for differential equations.
    • linear independence bowl — Linear independence is the property of a set of vectors in which no nontrivial linear combination equals zero. The clue also points to the Independence Bowl, a college football bowl game.

  • linearity — Linearity is the property of additivity and homogeneity that defines linear maps, linear differential equations, and linear algebra. It is the feature behind graphs of the form y = mx + b and structures such as the general linear group.

  • linearly independent — A collection of vectors is linearly independent when none of them can be written as a linear combination of the others. In differential equations, this is reflected by a nonzero Wronskian for the relevant functions.

  • matrix decompositions

    • Cholesky decomposition — Cholesky decomposition factors a symmetric positive-definite matrix into a triangular matrix and its transpose. It is a standard numerical method for simplifying matrix computations and solving linear systems.

    • LU decomposition — LU decomposition factors a matrix into lower- and upper-triangular parts, sometimes with a permutation matrix as well. It records the steps of Gaussian elimination and is a standard method for solving linear systems.

    • QR decomposition — QR decomposition factorizes a matrix into an orthogonal matrix and an upper triangular matrix. It is widely used in linear algebra and least-squares problems, often via the Gram-Schmidt process.

  • matrix forms
    • Echelon — An echelon is a step-like arrangement that can describe a military formation, a matrix form, or a geological pattern. The word comes from the French term for a rung of a ladder.
  • matrix invariants
    • the trace of A and the determinant of A — For a square matrix, the sum of the eigenvalues equals the trace and their product equals the determinant. These two quantities are standard invariants used to summarize a matrix’s spectrum.

  • matrix multiplication — Matrix multiplication is the standard noncommutative operation that combines matrices to produce a product matrix. It underlies linear transformations, has fast algorithms such as Strassen’s and Coppersmith-Winograd’s, and is the operation whose naive method runs in cubic time.

  • matrix properties
    • Hermitian — Hermitian describes a matrix or operator equal to its own conjugate transpose, and in the self-adjoint case it is its own adjoint. Such operators have real eigenvalues and orthogonal eigenvectors in the standard finite-dimensional setting. In quantum mechanics, observables are assumed to be Hermitian, which guarantees real spectra and unitary evolution after exponentiation by i times the operator. The term also applies to matrices with real diagonal entries and symmetry conditions over complex inner products.

  • norm — A norm is a function that assigns a nonnegative length to vectors and satisfies positivity, homogeneity, and the triangle inequality. Norms generalize familiar notions such as Euclidean length and underlie metric completion results like Banach spaces.

  • orthogonal matrix — An orthogonal matrix is a real matrix whose transpose is its inverse, so multiplying it by its transpose gives the identity matrix. These matrices appear in QR decomposition and in diagonalizing symmetric matrices, and their columns form an orthonormal basis.

  • Orthogonality — The property of being mutually perpendicular or having zero inner product. In mathematics and physics it describes vectors, lines, matrices, eigenfunctions, lattice directions, and other independent structures. In linear algebra it underlies orthonormal bases, Gram-Schmidt, orthogonal matrices, and special orthogonal groups; in Fourier analysis it appears in orthogonal functions. In coordinate geometry, nonzero slopes of perpendicular lines multiply to negative one, and a vector cross product is perpendicular to both inputs. The term is also used in computer science for languages whose features combine cleanly without special cases.

    • orthogonal — Orthogonal describes vectors, lines, or matrices meeting at right angles or preserving inner products. In linear algebra, orthogonal vectors have dot product zero, and an orthogonal matrix has transpose equal to its inverse. The term also appears in orthonormal bases and Gram-Schmidt orthogonalization. Related uses include orthogonal transformations and orthogonality in Fourier analysis.

    • they are perpendicular — A line or vector perpendicular to a surface makes a 90-degree angle with it. In geometry, a tangent to a circle is perpendicular to the radius at the point of tangency.

  • orthonormal — Orthonormal vectors have unit length and are pairwise orthogonal, so their dot product is 1 with themselves and 0 with each other. The Gram-Schmidt process produces an orthonormal basis, and this condition is central to QR decomposition and many basis sets in quantum chemistry.

  • orthonormal basis — An orthonormal basis is a set of mutually perpendicular unit vectors that spans a vector space. It combines orthogonality with normalization, making coordinates especially convenient in linear algebra.

  • pivots
    • Pivot — In linear algebra, pivots are the first nonzero entries in the rows of a matrix in row echelon form. In Vygotsky’s discussion of imaginative play, the pivot is the object that takes on a pretend role, such as a stick becoming a horse.
  • positive definite matrices

    • positive definite — A positive definite matrix or metric has all positive quadratic forms on nonzero vectors, so it underlies Riemannian metrics and Cholesky decomposition. In linear algebra and dynamical systems, the term also appears through positive eigenvalues, Sylvester’s criterion, and factorizations of the form B times its conjugate transpose.

    • positive definiteness — Positive definiteness is the property of a matrix whose quadratic form is strictly positive for every nonzero vector. It appears in covariance matrices, Gram matrices, and the unique Cholesky decomposition of suitable matrices.

  • projection — Projection is the linear operation that takes the component of one vector along another, as in orthogonal projection and Gram–Schmidt. In Hilbert space, it is the unique closest-point map onto a subspace and is also an idempotent linear transformation. Projection can also refer to the art technique of throwing images or text onto buildings and other surfaces, as in the work of Jenny Holzer and Krzysztof Wodiczko.

  • projection operators — Projection operators are idempotent linear operators that map a vector onto a subspace. In quantum mechanics they represent measurements, appear in projector-valued measures, and can be written as outer products such as ket-bra expressions.

  • Reduced row echelon form — Reduced row echelon form, often abbreviated RREF, is the standard simplified matrix form used in linear algebra. In this form, each leading entry is 1, the leading 1 is the only nonzero entry in its column, and zero rows are placed below nonzero rows.

  • scalars — Scalars are directionless quantities such as real and complex numbers, contrasted with vectors in linear algebra and physics. In relativity and differential geometry, scalar curvature quantities include the Ricci scalar and the Kretschmann scalar.
    • scalar — A scalar is a quantity with magnitude but no direction, unlike a vector. In physics, calculus, and programming, scalars are contrasted with directional or array-like values.
  • singular matrices
    • singular — A singular matrix is one with zero determinant and no inverse, also called degenerate or non-invertible. The term also appears in singular value decomposition, where singular values come from the eigenstructure of X*X and are used in matrix approximation and pseudoinverse calculations.

  • singular values — Singular values are the nonnegative numbers produced by singular value decomposition and used to measure how a matrix stretches the unit sphere. They control low-rank approximation, appear on the diagonal in SVD, and determine the spectrum of the pseudoinverse through reciprocals.

  • Solving systems of linear equations — This is a pair of arithmetic equation-solving prompts asking for the values of x and y from two linear equations. In the cited examples, the system is solved by substitution or elimination to obtain an ordered pair.

  • sparsity — Sparsity is the property of vectors or matrices that have many zero entries and only a few nonzero ones. It is useful in compressed sensing and sparse linear algebra, where algorithms like CSR storage, conjugate gradient methods, and lasso regression exploit it.

  • symmetric matrices — Symmetric matrices are square matrices equal to their transposes, so entry i,j matches entry j,i. They are diagonalizable with real eigenvalues, and the spectral theorem guarantees an orthonormal eigenbasis in the real case.
    • symmetric matrix — A symmetric matrix is a square matrix equal to its transpose, so the ij entry equals the ji entry. Real symmetric matrices are diagonalizable, and they are classified by definiteness through quadratic forms.
  • systems of linear equations — Systems of linear equations are collections of linear constraints that can be solved together by elimination, substitution, matrices, or Cramer’s rule. They may have one solution, no solution, or infinitely many solutions depending on whether the equations are consistent and independent.
    • Graphing — Graphing is a method for solving a system of linear equations by plotting the equations on a coordinate plane and finding their intersections. The x-axis and y-axis provide the reference grid used to visualize the lines.
      • Horizontal asymptotes
        • y = 0 — This is the horizontal asymptote of reciprocal-type functions such as 1/x^3 and other rational functions whose denominator grows faster than the numerator. It is also the expected asymptote when a problem simply asks for the horizontal asymptote of a graph with no further details.
    • system of linear equations — A system of linear equations is a set of equations in the same variables that can be solved together. Such systems may be consistent or inconsistent and are commonly solved by elimination, substitution, matrices, or Cramer’s rule.
      • solving a system of linear equations — Solving a system of linear equations means finding values that satisfy several linear equations at once. Common methods include Gaussian elimination, Gauss-Jordan reduction, Cramer’s rule, and related matrix techniques.

  • tensor product — The tensor product is the bilinear construction that combines vector spaces or representations into a larger object of dimension equal to the product of the original dimensions. In representation theory it underlies Clebsch-Gordan decompositions, and in matrix language it is often called the Kronecker product.

  • transpose matrix — The transpose of a matrix is formed by swapping rows and columns, so entry a sub ij becomes a sub ji. It is commonly denoted by a prime or superscript T and is fundamental in linear algebra.

  • triangular matrix — A triangular matrix has all entries on one side of the main diagonal equal to zero, and its diagonal entries are its eigenvalues. Jordan canonical form is an upper triangular example of this matrix type.

  • vector spaces — A vector space is a set closed under vector addition and scalar multiplication over a field. Linear algebra studies their dimension, basis, dual space, and linear maps.
    • span — A span is a basic term in mathematics for the set of all linear combinations of a given subset of a vector space. It is also an HTML inline element often used with CSS styling, unlike div, which begins a new paragraph.
  • spectrum — The spectrum of a matrix or linear operator is the set of values for which the operator fails to be invertible, and for finite-dimensional matrices it is the set of eigenvalues. The same word also names the visible range of colors produced by dispersion, such as through a prism.
• Vectors, Spaces, and Linear Maps

  • Vector space — set closed under addition and scalar multiplication satisfying eight axioms (e.g., ℝⁿ, polynomials, function spaces); a basis is a minimal spanning set; dimension is the number of basis vectors.

  • Vector operations
    • dot product — The dot product is the vector operation that multiplies corresponding components and sums them to produce a scalar. It equals the product of the vectors’ lengths times the cosine of the angle between them, so it vanishes for orthogonal vectors. It underlies projection, Gram-Schmidt orthogonalization, and the directional derivative.
  • Vector algebra
    • cross product — The cross product is a vector operation that produces a vector perpendicular to two inputs, with direction given by the right-hand rule. Its magnitude equals the area of the parallelogram spanned by the vectors, and it appears in formulas for curl, the Lorentz force, and rotational generators.

  • Linear transformation — function T: V → W preserving addition and scalar multiplication; representable as matrix multiplication once bases are chosen. Matrices represent these maps once bases are chosen, and common examples include rotations and reflections in geometry. The zero transformation and identity map are also linear transformations.

  • Rank-nullity theorem — for a linear map T: V → W, dim(V) = rank(T) + nullity(T), where rank is the dimension of the image and nullity is the dimension of the kernel; a fundamental dimension-counting result. It is also called the dimension theorem. In finite dimensions, if T is injective then nullity(T)=0 and dim(V)=rank(T); if T is surjective then rank(T)=dim(W).

  • Cauchy-Schwarz inequality —

    ⟨u, v⟩

    ² ≤ ⟨u,u⟩ · ⟨v,v⟩ for inner product spaces; in ℝⁿ: (Σ aᵢbᵢ)² ≤ (Σ aᵢ²)(Σ bᵢ²); ubiquitous in analysis, probability, and linear algebra. Standard versions include sum and integral forms.

    • Cauchy-Schwarz-Bunyakovsky inequality — The Cauchy-Schwarz-Bunyakovsky inequality bounds an inner product by the product of vector norms. It underlies the triangle inequality and appears in Euclidean, inner-product, and Lp settings.
  • Triangle inequality — for a normed space: ‖u + v‖ ≤ ‖u‖ + ‖v‖; generalizes the geometric fact that one side of a triangle is shorter than the sum of the other two; underpins metric space theory. In normed and metric spaces it appears as the basic distance axiom, with the reverse-looking ultrametric form sometimes showing up in p-adic settings.
    • Minkowski’s theorem — Minkowski’s theorem here refers to the triangle inequality in a normed vector space. It states that the norm of a sum is at most the sum of the norms.

  • Gram-Schmidt process — algorithm that converts any basis of an inner product space into an orthonormal basis; foundation of QR decomposition. It is commonly presented as a step-by-step projection and normalization procedure: each new vector is made orthogonal to the earlier ones by subtracting their projections, then normalized. It is also used in the construction of orthogonal polynomials.

  • duality — Duality is the idea that one object or theory has two complementary aspects or descriptions. It appears in mathematics, physics, logic, and projective geometry, including vector-space duals and their linear functionals, Poincaré duality, Kramers-Wannier duality, wave-particle duality, and self-dual theorems.

  • Exterior algebra
    • exterior product — The exterior product, or wedge product, is the antisymmetric operation used to build differential forms. In three dimensions it underlies the Hodge-star description of pseudovectors and the relation between the cross product and differential forms.

  • linear combinations — A linear combination is formed by multiplying expressions by constants and adding them together. In chemistry, linear combinations of atomic orbitals are used to build molecular orbitals and symmetry-adapted linear combinations.

  • multilinear algebra

    • tensor — A tensor is a higher-order mathematical object that generalizes scalars and vectors and can be described by rank and components with upper and lower indices. Tensors appear throughout differential geometry, continuum mechanics, and physics, including the stress-energy tensor and the moment of inertia tensor.

    • tensors

      • Levi-Civita symbol — The Levi-Civita symbol, usually written epsilon, is the totally antisymmetric tensor used to express cross products and angular momentum commutators. It is zero when any two indices are equal and changes sign under odd permutations.
  • vectors — Vectors are mathematical objects or quantities with both magnitude and direction, unlike scalars. They are often represented by arrows and can be added tip-to-tail to produce a resultant; common examples include forces and velocities. Vectors appear throughout linear algebra, geometry, and physics, including dot and cross products, norms, vector fields, matrix-style row or column representations, and rank-one tensors.

    • 8i + 6j or -8i - 6j — If a vector has magnitude 10 and is perpendicular to 3i - 4j, its possible forms are 8i + 6j or the opposite vector -8i - 6j.

    • Position vector — A position vector, often written r or x, gives the location of a point relative to an origin. Its time derivatives lead to velocity, acceleration, and higher kinematic quantities such as jerk.

  • right hand rule
    • right hand — The right hand is used in the standard rule for determining the direction of a cross product by curling the fingers and extending the thumb. It also names a relic of Saint Stephen that is venerated in Hungary, and it appears in the name of the Black Hand organization.
• Matrices, Systems, and Decompositions
  • Matrix — rectangular array of numbers; addition and scalar multiplication are element-wise; matrix multiplication is row-by-column (not commutative in general). It has a determinant, and when square and nonsingular an inverse. Matrices are used to solve linear systems, represent linear transformations, and study eigenvalues and eigenvectors; common methods and decompositions include Gaussian elimination, cofactor expansion, LU decomposition, and QR decomposition. They also model graphs, stochastic processes, and other computational problems.

    • a matrix — A matrix is a rectangular array of numbers or other entries, and the term also appears in older general-language senses such as a mold or form. In linear algebra, matrices represent linear transformations and can be row-reduced to echelon form.

    • Adjoint matrix — The adjoint matrix is the conjugate transpose of a matrix, obtained by transposing it and then complex-conjugating each entry. In quantum mechanics it is marked with a dagger, and matrices equal to their adjoints are Hermitian.

    • augmented matrix — An augmented matrix is a coefficient matrix with an added column of constants for a linear system. It is commonly used in row-reduction methods such as reduced row-echelon form.

    • Diagonal matrix — A diagonal matrix is a square matrix whose off-diagonal entries are all zero, so its only nonzero entries lie on the main diagonal. The identity matrix is a basic example, and some symmetric matrices can be similar to diagonal matrices.

    • Hermitian matrix — A Hermitian matrix is equal to its own conjugate transpose and is the complex analogue of a symmetric matrix. Such matrices define self-adjoint operators and have real eigenvalues with orthogonal eigenvectors.

    • identity matrix — The identity matrix is the multiplicative identity for square matrices: it is the square matrix with ones on the main diagonal and zeros elsewhere, and multiplying a compatible matrix by it leaves the matrix unchanged. It is the matrix equivalent of one and is used in Gauss-Jordan inversion setups.

    • scalar matrix — A scalar matrix is a square matrix with the same value on every diagonal entry and zeros elsewhere. Multiplying by a scalar matrix is equivalent to multiplying by its constant diagonal value.

    • sparse matrices — Sparse matrices are matrices with mostly zero entries, so they are stored in compressed formats rather than as full arrays. They are common in graph problems and iterative numerical methods, where their low connectivity makes specialized storage efficient.
      • sparse — Sparse describes a matrix or vector with mostly zero entries, a property that makes compressed data structures efficient and helps feature-selection methods like LASSO. The same idea appears in compressed sensing, sparse PCA, and other settings where only a few coefficients are nonzero.
    • square matrix — A square matrix has the same number of rows and columns. Its determinant is defined and is used to determine whether the matrix is invertible. Square matrices are also the matrices for which a characteristic polynomial is defined, and they arise in linear algebra in eigenvalues, diagonalization, Gaussian elimination, and the representation of linear transformations.
      • A matrix whose dimensions are n by n — An n by n matrix is a square matrix. The phrase identifies a matrix with the same number of rows and columns.

    • trace — The trace of a square matrix is the sum of its main diagonal entries, and it equals the sum of the eigenvalues. It appears in tensor contraction, the Ricci scalar, and matrix identities such as cyclic invariance. In some contexts, the same quantity is called the character of the matrix.

    • transpose — A transpose is the matrix operation that swaps rows and columns by reflecting across the main diagonal. It is commonly denoted with a superscript T, and symmetric matrices are unchanged by taking their transpose.

    • triangular matrices
      • triangular — A triangular matrix has all entries either above or below the main diagonal, and such matrices are central to LU decomposition and back-substitution. Triangular meshes also appear in numerical methods and finite-element computation, where piecewise linear approximations are common.
    • Unitary matrices — Unitary matrices are square matrices whose adjoint equals their inverse. They are central in quantum mechanics, where quantum gates on qubits are represented by unitary matrices.
      • unitary matrix — A unitary matrix is a square matrix whose inverse is its conjugate transpose, so multiplying it by its Hermitian transpose gives the identity. Such matrices are central in quantum mechanics and are useful because they can diagonalize normal matrices.
    • Upper triangular matrix — An upper triangular matrix is one whose entries below the main diagonal are all zero. The R matrix in QR decomposition is a standard example of this kind of matrix.
  • Matrix theory

    • Condition number — The condition number of a matrix is the product of the matrix norm and the norm of its inverse. A large condition number indicates that the problem is ill-conditioned and nearly singular.

    • rank — Rank is the dimension of a matrix’s column space, equivalently the number of linearly independent rows or columns. It satisfies the rank-nullity theorem and can be approximated or reduced using singular-value decomposition. Related results include the Eckart–Young theorem, the CUR approximation, and the fact that a nonzero outer product has rank one.
      • free rank — The free rank of a finitely generated abelian group is the number of copies of Z appearing in its decomposition into cyclic factors. In topology, a closely related invariant is the Betti number.
    • Hadamard matrices
      • Hadamard matrix — A Hadamard matrix is a square matrix of plus and minus ones whose rows are pairwise orthogonal. Such matrices are used in coding theory, including the Reed-Muller code.
  • Matrix decompositions
    • singular value decomposition — Singular value decomposition is a matrix factorization that writes a matrix as unitary or orthogonal factors surrounding a diagonal matrix of singular values. It underlies applications such as pseudoinverses, compression, and principal component-style dimensional reduction.
  • Matrix factorization
    • matrix decomposition — Matrix decomposition is the process of rewriting a matrix as a product of other matrices or as unitary factors times singular values. Common examples include LU, QR, Cholesky, and singular value decomposition.
  • Matrix definiteness
    • Positive semidefinite — A positive semidefinite matrix is one whose quadratic form xᵀMx is never negative for any nonzero vector x. This property underlies semidefinite programming and is weaker than positive definiteness.
  • Gaussian elimination — systematic row operations to reduce a matrix to row echelon form; solves linear systems and computes rank and inverse. It proceeds by swapping rows, scaling rows, and adding multiples of rows to eliminate variables. The same basic process underlies Gauss-Jordan elimination, which continues to reduced row echelon form. It is a standard matrix technique for systems of equations of the form Ax = b.
    • Solve systems of linear equations through Gaussian elimination — In MATLAB, backslash and forward slash are used to solve systems of linear equations by Gaussian elimination or related matrix division routines. They are standard shorthand for computing solutions efficiently when the coefficient matrix is invertible or well-conditioned.

  • Determinant — scalar det(A) encoding whether a matrix is invertible (det ≠ 0) and the signed volume scaling factor of its linear transformation; det(AB) = det(A) det(B). For a 2×2 matrix, det(A) = ad − bc. It appears in Cramer’s rule, Laplace expansion/cofactor expansion, the Jacobian in changes of variables, and tests for singularity, linear independence, and eigenvalues.

  • Eigenvalue / eigenvector — scalar λ and nonzero vector v such that Av = λv; eigenvalues are roots of the characteristic polynomial det(A − λI) = 0; diagonalization decomposes A = PDP⁻¹ when n independent eigenvectors exist.

  • Cayley-Hamilton theorem — every square matrix satisfies its own characteristic polynomial; e.g., if p(λ) = det(A − λI), then p(A) = 0; allows matrix powers and inverses to be expressed as lower-degree polynomials. The linear-operator formulation is equivalent: if f is the characteristic polynomial of T, then substituting T into f gives the zero transformation.

  • Spectral theorem — a real symmetric (or complex Hermitian) matrix is diagonalizable by an orthogonal (unitary) matrix; its eigenvalues are real; fundamental to principal component analysis, quantum mechanics, and differential equations. The spectral theorem states that self-adjoint or symmetric operators can be diagonalized in an orthonormal basis, with eigenvalues appearing as the spectrum. In its functional-analytic form, it gives a projection-valued measure decomposition for operators such as Hermitian matrices.

  • Singular value decomposition (SVD) — any m×n matrix A can be written as UΣVᵀ where U and V are orthogonal and Σ is diagonal with non-negative entries (singular values); basis of principal component analysis, data compression, and pseudoinverse computation.

  • Positive definite matrix — a symmetric matrix A is positive definite if xᵀAx > 0 for all nonzero x; equivalently, all eigenvalues are positive; appears in optimization (Hessian criteria), statistics (covariance matrices), and physics.

  • Systems of equations
    • Overdetermined systems
      • overdetermined — Something is overdetermined when a single effect arises from multiple independent causes. The term also appears in mathematics for systems with more equations than unknowns that may have no solution.

• characteristic — A characteristic is a mathematical term that can mean the indicator function of a set, the Fourier-transform function of a distribution, or related algebraic notions. The same word appears in phrases such as characteristic polynomial, characteristic function, and Euler characteristic.

• lattices
  • Leech lattice — The Leech lattice is a remarkable 24-dimensional unimodular lattice. It gives an especially efficient sphere packing and is tied to the discovery of sporadic simple groups.

Abstract Algebra

• Groups and Symmetry

  • Group — set G with a binary operation satisfying closure, associativity, identity, and invertibility; e.g., (ℤ, +), permutations of a set. An abelian (commutative) group has ab = ba for all elements. The term also names a periodic-table column, though here it refers to the algebraic structure.

  • Lagrange’s theorem (group theory) — the order of any subgroup H of a finite group G divides the order of G; equivalently

    G

    /

    H

    = the number of cosets; key consequence: the order of any element divides

    G

    .

  • Normal subgroup / quotient group — a subgroup N of G is normal if gNg⁻¹ = N for all g ∈ G; the quotient group G/N consists of the cosets of N; the first isomorphism theorem states G/ker(φ) ≅ im(φ) for any homomorphism φ.

  • Sylow theorems — for a finite group G of order pⁿm (p prime, p ∤ m), Sylow’s theorems guarantee the existence, count, and conjugacy of subgroups of order pⁿ; central tools in the classification of groups. Sylow p-subgroups are maximal subgroups of that prime-power order. The three theorems are commonly stated as existence, conjugacy, and counting results for these subgroups; in particular, the number of Sylow p-subgroups is congruent to 1 mod p and divides m.

    • First Sylow Theorem — The First Sylow Theorem guarantees that if a finite group has order divisible by a prime power p^n, then it has a subgroup of that order. It is the opening theorem in Sylow’s trio of results on p-subgroups.

    • Sylow’s theorems — Sylow’s theorems are the basic results in finite group theory that guarantee the existence of subgroups of order p^n for each prime power dividing the group order. They also show that these Sylow subgroups are conjugate, with consequences used in proofs such as Wilson’s theorem.

  • Classification of finite simple groups — the complete list of finite simple groups consists of cyclic groups of prime order, alternating groups Aₙ (n ≥ 5), 16 families of groups of Lie type, and 26 sporadic groups (including the Monster group, the largest, of order ~8 × 10⁵³); the proof spans tens of thousands of pages across hundreds of papers, completed ~1981–2004.

  • normality
    • normal — Normal is a mathematical and scientific adjective meaning perpendicular, standard, or well-behaved, and it appears in topology, group theory, linear algebra, and probability. It also names the Gaussian normal distribution and the normal force in physics.
  • permutation groups
    • alternating groups — Alternating groups consist of the even permutations on n letters and have order n factorial divided by two. The degree-5 alternating group, A5, is the smallest non-solvable group.
  • Special unitary groups
    • SU (2) — SU(2) is the special unitary group of 2-by-2 complex matrices with determinant 1, widely used in particle physics and angular momentum. It is the double cover of the three-dimensional rotation group and appears in quaternions, spin-half rotations, and the electroweak gauge group.
  • symmetry — Symmetry is the property of remaining unchanged under transformations such as reflection, rotation, or inversion. In chemistry and physics it underlies selection rules, chiral behavior, and point groups; in mathematics it appears in symmetric groups and symmetric relations.

    • antisymmetry — Antisymmetry is the property that a quantity changes sign or becomes impossible to reverse when two arguments are switched. In quantum mechanics, Slater determinants are antisymmetric, so swapping two electrons changes the sign of the wave function.

    • symmetric — A symmetric object or relation is unchanged under reflection or swapping positions, as in symmetric matrices and equivalence relations. The term also appears in group theory, where the symmetric group on n objects contains the alternating group as a subgroup.

  • Symmetry groups
    • dihedral groups — Dihedral groups are the symmetry groups of regular polygons. For an n-gon, they contain n rotations and n reflections, and the square’s symmetries form the eight-element case.
  • Group theory
    • Cayley’s Theorem — Cayley’s theorem says every group of order n is isomorphic to a subgroup of the symmetric group S sub n. It is proved by representing left multiplication as permutations, and it underlies the idea that results about permutation groups can be applied to all groups.
      • Every group is isomorphic to a group of permutations — Every group is isomorphic to a group of permutations is Cayley’s theorem. It says that any group can be represented as a subgroup of a symmetric group acting on itself.

    • centralizer — In group theory, the centralizer of a subset is the subgroup of elements that commute with every element of that subset. For a single element, its size is related to the size of the element’s conjugacy class, and in an abelian group the centralizer is the whole group.

    • conjugate elements — In group theory, elements a and b are conjugate if one is obtained from the other by an inner automorphism. The relation is expressed as b = c a c^{-1} for some c in the group.

    • cosets — In group theory, cosets are the sets formed by multiplying every element of a subgroup by a fixed group element on the left or right. They partition the group and are central to the proof of Lagrange’s theorem. For a normal subgroup, left and right cosets coincide, and the index of a subgroup is the number of its cosets.
      • coset — A coset is formed by multiplying all elements of a subgroup by a fixed group element on the left or right. It is the translate of a subgroup inside a larger group and is a basic object in group theory.

    • cyclic groups — Cyclic groups are groups generated by a single element, so every element is a power of the generator. Finite cyclic groups have one subgroup for each divisor of their order, and every finitely generated abelian group decomposes into cyclic factors.

    • finite groups — Finite groups are groups with finitely many elements. Classification results for simple groups with this property include cyclic, alternating, Lie-type, and sporadic groups, and the Sylow theorems apply to them.
      • Klein four-group — The Klein four-group is the smallest non-cyclic group, isomorphic to Z2 × Z2 and to the symmetries of a rectangle. Every nonidentity element has order two, so all of its subgroups are normal.

    • first isomorphism theorem — The first isomorphism theorem states that a homomorphism’s domain modulo its kernel is isomorphic to its image. It is one of the basic results of group theory and is often used to factor maps through quotient groups.

    • group actions — A group action is a function from a group to permutations of a set, sending each group element to a transformation of the set. Its orbits partition the set, and standard results such as the orbit-stabilizer theorem, Cayley’s theorem, and Burnside-style counting use this idea.

      • Burnside’s lemma — Burnside’s lemma, also called the orbit-counting theorem or Cauchy-Frobenius lemma, counts orbits of a finite group action by averaging fixed points. It is a standard tool in combinatorics for counting distinct colorings under symmetry.

      • group action — A group action is a map describing how a group acts on a set by sending each pair of a group element and a set element to another set element. Its orbits and stabilizers organize the set, and in representation theory such maps correspond to homomorphisms into an automorphism group.

    • homomorphisms
      • Group homomorphism — A group homomorphism is a map between groups that preserves the group operation. It sends the identity element to the identity element and respects multiplication or addition depending on the groups involved.

    • Lagrange’s theorem — Lagrange’s theorem in group theory states that the order of any subgroup of a finite group divides the order of the whole group. Its proof uses cosets, and a standard consequence is that the number of cosets of a subgroup equals the quotient of the group order by the subgroup order. The theorem is a standard result in abstract algebra and underlies many results in finite group theory.

    • Normal subgroups — Normal subgroups are invariant under conjugation by the whole group. They can be described as unions of conjugacy classes, though not every such union is normal, and they are the subgroups that give quotient groups through the first isomorphism theorem.
      • Normal subgroup — A normal subgroup is invariant under conjugation by every element of the parent group. Such subgroups are the ones used to form quotient groups, and they are exactly the subgroups that can arise as kernels of homomorphisms.
    • permutation groups
      • Symmetric group — The symmetric group of degree n is the group of all permutations on n letters. It is the standard example behind Cayley’s theorem and cycle notation, central to counting rearrangements where order matters, and includes derangements and even or odd permutations. In Galois theory, the Galois group of a general polynomial of degree n is isomorphic to this group.

    • Peter Ludwig Mejdell Sylow — Peter Ludwig Mejdell Sylow is the Norwegian mathematician whose theorems describe subgroups of finite groups of prime-power order. Sylow subgroups are conjugate, count in congruence classes mod p, and provide a partial converse to Lagrange’s theorem.

    • quaternion group — The quaternion group is Hamilton’s eight-element noncommutative extension of the complex numbers. It adds the units i, j, and k as square roots of negative one.

    • quotient groups
      • quotient group — A quotient group is formed from the cosets of a normal subgroup, with multiplication defined by the group operation on those cosets. The first isomorphism theorem identifies the image of a homomorphism with a quotient by its kernel.

    • Simple group — A simple group is a group with no normal subgroups other than the trivial subgroup and itself. These groups are the basic building blocks in the classification of finite groups.

    • simple groups — A simple group is a group with no nontrivial normal subgroups. Finite simple groups include the sporadic groups and were the subject of the classification theorem, with the Monster as the largest famous example.
      • finite simple groups — Finite simple groups are the groups with no proper nontrivial normal subgroups. Their classification culminated in the Big Theorem and includes the 26 sporadic groups such as the Monster and M11.
        • sporadic groups — Sporadic groups are the exceptional finite simple groups that do not belong to the cyclic, alternating, or Lie-type families. There are 26 of them, including the Mathieu groups, the Janko groups, and the Fischer groups.
          • Monster group — The Monster group is the largest of the sporadic finite simple groups. It was first explicitly constructed by Robert Griess and is linked to monstrous moonshine and the j-function.

    • stabilizer — A stabilizer is the subgroup of a group element that fixes that element under a group action. Its size is related to the orbit-stabilizer theorem, which links the stabilizer, the orbit, and the size of the group.

    • subgroups — In abstract algebra, subgroups are subsets of a group that themselves satisfy the group axioms. Clues often involve normal subgroups, Sylow p-subgroups, and the composition series used in the Jordan-Hölder theorem.

    • symmetric groups — Symmetric groups are the permutation groups on a finite set, usually written S_n, and every group embeds in one by Cayley’s theorem. They contain alternating subgroups and are central in questions about cycle structure and conjugacy.

    • The order of H divides the order of G — This is the conclusion of Lagrange’s theorem: for a finite group G and subgroup H, the order of H divides the order of G. It is a standard result in elementary group theory.
• Rings, Fields, and Algebraic Structures

  • Ring — set with two operations (addition and multiplication) where addition forms an abelian group and multiplication is associative and distributes over addition; e.g., (ℤ, +, ×). Integral domains, Noetherian rings, and polynomial rings are common examples.

  • Field — a commutative ring where every nonzero element has a multiplicative inverse; e.g., ℚ, ℝ, ℂ, and finite fields 𝔽_p for prime p.

  • Homomorphism / isomorphism — a homomorphism is a structure-preserving map between algebraic objects (e.g., groups, rings); an isomorphism is a bijective homomorphism with a homomorphic inverse; isomorphic structures are algebraically identical.

  • Noetherian ring — a ring in which every ascending chain of ideals eventually stabilizes (ascending chain condition); named for Emmy Noether; polynomial rings over fields are Noetherian (Hilbert basis theorem).

  • Principal ideal domain (PID) — an integral domain in which every ideal is generated by a single element; examples include ℤ and polynomial rings over fields; unique factorization holds in any PID.

  • p-adic numbers — for a prime p, the p-adic numbers ℚ_p complete ℚ with respect to the p-adic absolute value (

    pⁿ a/b

    _p = p⁻ⁿ for p ∤ a, b); form a field used in number theory and the proof of Fermat’s Last Theorem. They can be viewed as expansions with infinitely many digits to the left. They appear in number theory through Hensel’s work, Ostrowski’s theorem, and local-global principles such as Hasse’s.

  • Galois theory — connects field extensions to group theory; Galois (1830s) proved that a polynomial equation is solvable by radicals if and only if its Galois group is a solvable group; explains why no general formula exists for degree ≥ 5. It studies field extensions through their automorphism groups and the correspondence between intermediate fields and subgroups. It is named for Évariste Galois.

    • Galois group — A Galois group is the automorphism group of a field extension, especially the symmetry group of a polynomial’s splitting field. Its solvability determines whether a polynomial can be solved by radicals.

    • Galois groups — Galois groups are automorphism groups of field extensions, and their structure governs whether polynomials can be solved by radicals. They underlie Galois theory, where subgroups correspond to intermediate fields and the absolute Galois group is defined from a field’s separable closure.

  • Category theory — abstract framework unifying mathematical structures via objects and morphisms (arrows); concepts include functors (structure-preserving maps between categories), natural transformations, and adjunctions; developed by Eilenberg and Mac Lane (1945); increasingly central to theoretical computer science and algebraic topology. Its language underlies adjunctions, Yoneda-style results, and much of theoretical computer science.
    • Functors
      • contravariant — A contravariant functor reverses the direction of morphisms instead of preserving it. In tensor notation, upper indices are often described as contravariant, because they transform with the inverse of a basis change.
    • morphisms — A morphism is a structure-preserving map between two objects in a category, usually drawn as an arrow from one object to another. Isomorphisms are morphisms with both left and right inverses, and category theory classifies arrows as monic or epic by their properties.
  • Algebraic structures

    • Monoid — A monoid is a set with an associative operation and an identity element. In category-theoretic language, it can be viewed as a single-object category.

    • Semigroup — A semigroup is an algebraic structure, or set, with an associative binary operation. Unlike a monoid, it need not have an identity element, and its elements need not be invertible.

    • groups — A group is a set with an associative operation, an identity, and inverses. Examples include Lie groups, finite groups such as the Monster, and Abelian groups when the operation commutes.

    • monoids — A monoid is an algebraic structure with an associative binary operation and an identity element. Free monoids arise from strings under concatenation, and syntactic monoids are important in automata theory and formal language recognition.

    • the identity element — The identity element is the value that leaves the result unchanged under a given binary operation. In linear algebra it appears as the identity matrix, and in arithmetic it is 1 for multiplication and 0 for addition.

  • commutative algebra
    • Dedekind domains
      • Dedekind domain — A Dedekind domain is a commutative integral domain that is integrally closed, Noetherian, and has the property that every nonzero prime ideal is maximal. Such domains are central in algebraic number theory because their ideals factor uniquely into prime ideals.
    • prime ideals — Prime ideals are the ring-theoretic ideals that define points of the spectrum and correspond to irreducible geometric data in algebraic geometry. In an integral domain quotient criterion, they satisfy the condition that if a product lies inside one, then at least one factor does as well.
  • Polynomial irreducibility

    • Eisenstein’s criterion — Eisenstein’s criterion is a classical test for proving that a polynomial is irreducible. It is often paired in clues with polynomial roots, Galois theory, and other basic results about polynomial rings.

    • Gauss’s lemma — Gauss’s lemma says that if a polynomial with integer coefficients factors over the rationals, then it can be factored over the integers as well.

  • Polynomial theory
    • Irreducibility criteria
      • Eisenstein criterion — Eisenstein’s criterion is a test for proving that a polynomial with integer coefficients is irreducible over the rationals. It applies when a prime divides every coefficient, but its square does not divide the constant term.
  • Ring theory
    • ideals — In ring theory, ideals are subsets of a ring closed under addition and absorption by ring elements. They generalize normal subgroups and include prime, maximal, principal, integral, and fractional ideals. Ideals play a central role in Noetherian conditions, kernels of homomorphisms, Gröbner basis theory, and the decomposition theory generalized by Noether after Dedekind used ideals to recover unique factorization in number fields.

      • Ideal — An ideal is a substructure of a ring that is closed under multiplication by elements of the ring. Ideals are the objects used to form quotient rings, and the most important kinds are prime and maximal ideals.

      • Maximal ideal — A maximal ideal is a proper ideal that is not properly contained in any larger proper ideal. A quotient ring by a maximal ideal is a field, and in the integers the ideals generated by primes are maximal.

  • field theory

    • field extension — A field extension is a larger field containing a given field as a subfield. Finite separable extensions are simple by the primitive element theorem, and normal separable ones are Galois extensions.

    • extension field — An extension field is a field E containing a subfield F, so that E is described as an extension of F. This is a basic term in abstract algebra and field theory.

    • finite fields — Finite fields are fields with finitely many elements, such as the residue classes modulo a prime. They are central to the Weil conjectures, the Frobenius automorphism, and algorithms such as Berlekamp’s and Diffie-Hellman.

    • splitting field — A splitting field is the smallest field extension in which a polynomial factors completely into linear terms. For a separable polynomial over a field, this is the extension that contains all of its roots and is used in the definition of a Galois extension.

  • Algebraic homomorphisms
    • homomorphism — A homomorphism is a structure-preserving map between algebraic objects, such as groups or vector spaces. A bijective homomorphism is an isomorphism, and in group theory such maps satisfy F(xy)=F(x)F(y).
• Greek letters
  • lambda — Lambda is the Greek letter used for wavelengths, eigenvalues, Lagrange multipliers, anonymous functions, and the cosmological constant. It also names the lambda calculus in logic and programming, and particles and models in physics such as lambda baryons and lambda CDM.

• trivial — Trivial is the adjective for something simple, unimportant, or mathematically degenerate, as in the trivial group, the trivial bundle, or a trivial proof. In topology it can describe indiscrete spaces with only two open sets, and in algebraic topology it can apply to a loop homotopic to a constant map.

• algebraic structures
  • algebras — Algebras are vector spaces equipped with a bilinear multiplication, and they include structures such as Lie algebras, Clifford algebras, and Jordan algebras. They generalize familiar number systems and can be built from Lie groups or by the Cayley-Dickson construction. The topic sits at the intersection of linear algebra and abstract algebra.
• Boolean rings
  • Boolean ring — A Boolean ring is a ring in which every element is idempotent, so x squared equals x for all elements. Such rings are a standard algebraic structure with a unit and are closely tied to logic and set-theoretic operations.
• direct sums
  • direct sum — A direct sum is the algebraic operation that combines substructures componentwise, and for finitely many sets it matches the Cartesian product. In module theory and group theory, it appears in decomposition results such as Maschke’s theorem and the definition of internal direct products.
• field theory
  • algebraic closure — A field has algebraic closure, or is algebraically closed, if every nonconstant polynomial over it has a root in the field. The complex numbers are the standard example, and the Fundamental Theorem of Algebra shows they have this property. The Nullstellensatz is often discussed in connection with this condition.
• Generators
  • generator — A generator converts mechanical energy into electrical energy, as in a dynamo or wind turbine. In group theory, a generator is an element whose repeated products produce the whole group, while in algebra it can also mean the source of a cyclic structure.
• idempotents
  • idempotent — An idempotent is an object equal to its own square, so applying it twice is the same as applying it once. In linear algebra and quantum theory, projections and pure-state density matrices are standard examples.
• nilpotent elements
  • nilpotent — A nilpotent element or matrix becomes zero after some positive power is taken, so a matrix with characteristic polynomial x^n has this property. The term is also used for Lie algebras and groups whose central series eventually terminates.
• nonassociative algebras
  • octonions — Octonions are the largest normed division algebra and an example of a nonassociative algebra. They are linked to the Fano plane, the Cayley-Dickson construction, and the exceptional Lie group G2.
• quotients
  • quotient — A quotient is the result of division, and in algebra it names structures formed by partitioning a group or ring into equivalence classes. Quotient groups appear in the first isomorphism theorem and in constructions such as residue fields and the quotient rule in calculus.
• simple objects
  • simple — In algebra, simple objects have no nontrivial subobjects: finite simple groups have no proper normal subgroups, and simple Lie algebras and simple rings are defined by similarly minimal structure. The term also appears in Jordan-Hölder theory for successive quotients and in topology for a simply connected domain, where it means no nontrivial decomposition or obstruction.
• group theory

  • Cauchy’s Theorem — Cauchy’s theorem in group theory says that if the order of a finite group is divisible by a prime p, then the group has a subgroup of order p. Its name also recalls Augustin-Louis Cauchy, whose work in complex analysis is the better-known namesake.

  • class equation — The class equation in finite group theory expresses the order of a group as the size of its center plus the sizes of its noncentral conjugacy classes.

  • cyclic group — A cyclic group is generated by a single element, whose powers give every element of the group. Every finite cyclic group is isomorphic to the integers modulo n under addition.

  • Jordan-Hölder theorem — The Jordan-Hölder theorem says that any two composition series of a finite group have isomorphic factor groups, equivalent up to a permutation of the factors. It is a basic uniqueness result in group theory and underlies the uniqueness of composition factors in finite-group structure theory; it follows from standard lemmas such as the Butterfly Lemma.

Number Theory

Distinguish definitions, logical statements, proof methods, and number-theoretic results.

• number theory — Number theory is the branch of mathematics devoted to the integers, especially their prime-factor properties. It is the arithmetic side of pure math that underlies topics such as Goldbach’s conjecture and Mochizuki’s work in arithmetic geometry.

  • 28 — 28 is the second perfect number and the seventh triangular number. It also appears as the square root of 784, the number of years in Saturn’s orbit, and the sum of the first seven integers.

  • abundant numbers — An abundant number is a positive integer whose proper divisors sum to more than the number itself; equivalently, its divisor-sum function satisfies σ(n) > 2n. These are also called excessive numbers. Examples include every proper multiple of a perfect number, and the smallest odd abundant number is 945.

  • algebraic numbers — Algebraic numbers are numbers that satisfy a polynomial equation with integer coefficients. They include many familiar constants and form a set often discussed as the algebraic closure of the rationals within the complex numbers.
    • algebraic — An algebraic number is a root of a polynomial with rational or integer coefficients, unlike a transcendental number. The term also extends to algebraic integers and algebraic number fields, and it appears in results about rational approximation and field extensions.
  • arithmetic functions
    • Möbius function — The Möbius function, usually denoted mu, is an arithmetic function that is 1 at 1, 0 when an integer is divisible by a square or has repeated prime factors, and ±1 for square-free integers according to the parity of their distinct prime factors. Its Dirichlet series is the reciprocal of the Riemann zeta function for real part greater than 1. It appears in inversion formulas involving the Euler totient function and in congruence statements for integers coprime to a modulus.
  • arithmetic progressions — Arithmetic progressions are sequences whose successive terms differ by a fixed constant. They appear in major results such as Dirichlet’s theorem on primes in arithmetic progressions, Szemerédi’s theorem, and the Green-Tao theorem.
    • Dirichlet’s theorem — Dirichlet’s theorem on arithmetic progressions states that if a and b are relatively prime, then the progression an+b contains infinitely many primes. It is a standard result in number theory and is usually credited to the German mathematician Peter Gustav Lejeune Dirichlet.

  • Bezout’s identity — Bézout’s identity states that for nonzero integers a and b, there are integers x and y such that ax + by equals gcd(a,b). It is a basic result in number theory and is closely tied to the Euclidean algorithm.

  • Carmichael numbers — Carmichael numbers are composite pseudoprimes that satisfy Fermat’s congruence for every base coprime to the number. They are characterized by Korselt’s criterion, and 561 is the classic first example.

  • Class numbers
    • class number — The class number is the size of the ideal class group of a number field, equivalently the order of the quotient of fractional ideals by principal ideals. A number field has class number one exactly when its ring of integers is a unique factorization domain, and the Stark-Heegner theorem classifies certain quadratic fields with class number one.

  • composite number — In number theory, a composite number is a positive integer greater than one with more than two factors, so it is not prime. Composite numbers begin at 4; all factorials greater than 2 are composite, and the Sieve of Eratosthenes is a classic method for identifying them. They include special classes such as Carmichael and squarefree numbers.

  • congruences
    • the Chinese remainder theorem — The Chinese remainder theorem gives solutions to systems of simultaneous congruences when the moduli are pairwise coprime. It determines a unique solution modulo the product of the moduli and is a basic result in number theory.
  • conjectures

    • abc conjecture — The abc conjecture is the number-theoretic statement of Oesterlé and Masser that bounds the product of distinct prime divisors of coprime integers in terms of their radical. It is closely linked to Szpiro’s conjecture, and Mochizuki’s claimed proof using inter-universal Teichmüller theory has remained controversial.

    • Catalan’s conjecture — Catalan’s conjecture states that 8 and 9 are the only consecutive natural numbers that are both perfect powers. It was proved by Preda Mihăilescu in 2002 and is now sometimes called the Catalan–Mihăilescu theorem.

  • continued fractions — Continued fractions express a real number as an integer followed by an infinite nested sequence of reciprocals. They are central to Diophantine approximation, Khinchin’s constant, and attacks on RSA using Wiener’s method.

  • Diophantine problems
    • Hilbert’s Tenth Problem — Hilbert’s tenth problem asks whether there is an algorithm that can determine whether an arbitrary Diophantine equation has an integer solution. Matiyasevich completed the proof that the problem is unsolvable in general, settling the Entscheidungsproblem-style question for Diophantine equations.

  • Eugene Charles Catalan — Eugene Charles Catalan was a Belgian mathematician associated with Catalan numbers. He is also remembered for Catalan’s conjecture, proved by Mihăilescu, which says that 8 and 9 are the only consecutive powers. Other clues include Catalan solids and a Catalan identity related to Fibonacci numbers.

  • Euler totient function — This function counts the positive integers less than n that are relatively prime to n. It is multiplicative, gives the order of the unit group of integers modulo n, and satisfies the identity that the sum of its values over all divisors of n equals n. It appears in Euler’s theorem, Gauss’s criterion for constructible polygons, and the theory of cyclotomic polynomials; for a prime p it equals p minus 1.

  • Euler’s totient function — Euler’s totient function counts the positive integers less than or equal to n that are relatively prime to n. It is usually written φ and is named for Euler. For primes p, φ(p)=p−1, and the function is multiplicative. It also gives the number of generators of a finite cyclic group and appears in results on primitive roots and the generalized Fermat theorem.

  • even numbers — Even numbers are integers divisible by 2, so they include 0, 2, 4, 6, and 8. Goldbach’s conjecture concerns even integers greater than 2, and the parity of an integer is reflected in binary by ending in 0.

    • even — Even numbers are integers divisible by two, and 2 is the only even prime. They are the numbers whose cosine series uses only even powers, and even functions satisfy f(x)=f(-x).

    • even number — An even number is an integer divisible by two, so its parity is zero. Even numbers arise in Goldbach’s conjecture, Eulerian graph degree conditions, and other parity arguments.

  • Fermat numbers — Fermat numbers are integers of the form 2^(2^n) + 1, named for Pierre de Fermat. The first few are prime, but the sequence is famous for the fact that only five prime examples are known.

  • Generalized Riemann hypothesis — The generalized Riemann hypothesis states that the nontrivial zeros of the relevant zeta and Dirichlet L-functions all lie on the critical line Re(s)=1/2. It has consequences in prime distribution and primality testing, and is used for bounds related to Goldbach-type problems, proofs around AKS, and polynomial-time guarantees for Tonelli–Shanks in some settings.

  • Goldbach conjecture — The Goldbach conjecture is the unproved number-theory statement that every even integer greater than two can be written as the sum of two primes. It was first posed in a letter to Euler and remains a classic open problem. Later partial results, such as Schnirelmann’s theorem, weakened the original problem but did not solve it; stronger variants ask whether all integers can be written as sums of three primes, and partial results by Chen, Schrinelman, and others are standard clue material.

  • Kaprekar numbers — Kaprekar numbers are integers that can be split after squaring so that the pieces sum back to the original number. The classic example is 703, since 703 squared is 494209 and 494 plus 209 equals 703.

  • lifting — Lifting is a technique of raising a solution modulo a higher power of p from a root modulo a lower power, as in Hensel’s lemma. It also names the volleyball fault committed when the ball is palmed upward with sustained contact.

  • Mersenne numbers — Mersenne numbers are numbers of the form 2^n minus 1. When n is prime, they are the candidates studied by the Lucas-Lehmer test, and some of them are Mersenne primes.

  • Modular forms
    • modular — In mathematics, modular forms are complex analytic functions with strong symmetry conditions under the action of modular transformations. The term also appears in architecture, where modular design uses prefabricated units that can be assembled into larger structures.
  • Ordinals and numerals
    • Fourteenth — Fourteenth refers to the 14th of a numbered sequence, such as a monarch’s regnal number. In French history, Louis XIV is the best-known example, remembered for his exceptionally long reign.
  • palindromic numbers
    • palindromes — A palindrome is a number or word that reads the same forward and backward. Examples include Demlo numbers, while Lychrel numbers are investigated for whether repeated reverse-and-add steps eventually produce one.
  • parity
    • odd numbers — Odd numbers are integers not divisible by two, and they are the numbers that remain congruent to 1 modulo 2. Clues often tie them to the Feit-Thompson theorem, the Collatz conjecture, and the fact that the sum of the first N odd numbers is a square.
      • odd — Odd numbers are integers not divisible by two, and odd functions satisfy f(-x) = -f(x). In graph theory, a connected graph with the appropriate degree pattern can have an Eulerian path, and in analysis odd functions integrate to zero over symmetric intervals. The term also appears in the Feit-Thompson theorem, which states that finite groups of odd order are solvable. Common examples include primes other than 2 and the numbers singled out by the Collatz conjecture.

  • Pell’s equation — Pell’s equation is the Diophantine equation x squared minus n y squared equals 1, with n a nonsquare integer. Its solutions are classically studied with continued fractions and can be used to approximate square roots. The name is a historical misattribution; earlier work by Brahmagupta and Bhaskara II was later attached to Pell through Euler’s naming error.

  • powers
    • Powers of 2 — Powers of 2 are numbers of the form 2 to an integer power, including 1, 2, 4, 8, 16, and 32. They appear in binary notation, Mersenne primes, Pascal’s triangle, simple doubling sequences, and on the tiles in the game 2048.

  • primality — Primality is the property of an integer being prime, meaning it has no positive divisors other than 1 and itself. Clues include the Sieve of Eratosthenes, the Miller-Rabin and AKS tests, Carmichael numbers, Goldbach’s conjecture, and twin primes or arithmetic progressions of primes.

  • primality testing — Primality testing asks whether a given integer is prime or composite. Important named algorithms and tests include Fermat, Lucas-Lehmer, Miller-Rabin, and AKS.

  • primality tests — Primality tests are algorithms for deciding whether a positive integer is prime, with famous examples including Fermat, Solovay–Strassen, Miller–Rabin, and AKS. Common pitfalls include Carmichael numbers, and the simplest approach is trial division by smaller integers.

  • prime gap — A prime gap is the difference between consecutive prime numbers. Bertrand’s postulate gives a basic bound on these gaps, and work by Yitang Zhang and later the Polymath8 project and Terence Tao produced and improved the first finite upper bounds for infinitely many such gaps.

  • prime-counting function — The prime-counting function, denoted pi of x, counts the primes less than or equal to x. It is connected to the sieve of Eratosthenes, the Meissel-Lehmer algorithm, and asymptotics involving the logarithmic integral and Skewes’ number.

  • primeness — Primeness is the property of being prime, meaning an integer has no divisors other than one and itself. The clues invoke Wilson’s theorem, Fermat’s little theorem, the sieve of Eratosthenes, and the characterization of primes as the building blocks of arithmetic.

  • primes

    • Germain primes — Germain primes are primes p such that both p and 2p + 1 are prime. They are named for Sophie Germain, and they appear in constructions involving Cunningham chains and primality tests such as Pocklington’s criterion.

    • Wall-Sun-Sun primes — Wall-Sun-Sun primes are hypothetical primes p for which a certain congruence involving the Fibonacci sequence holds, and none are currently known. They appear in number theory because their existence would follow from a counterexample to Fermat’s Last Theorem in a special case.

  • Pythagorean triple — A Pythagorean triple is a set of three integers that can be the side lengths of a right triangle, such as 3, 4, and 5. Such triples satisfy the Pythagorean theorem and can be generated by Euclid’s formula; primitive examples are pairwise coprime.

  • quadratic reciprocity theorem — The quadratic reciprocity theorem describes when the congruences x² ≡ q mod p and x² ≡ p mod q are simultaneously solvable. It is usually expressed with Legendre symbols, and Gauss’ golden theorem is a famous formulation of it.

  • Quadratic residues
    • quadratic residue — A quadratic residue is a number that is congruent to a perfect square modulo an odd prime. The Legendre symbol equals 1 exactly when its argument is a nonzero quadratic residue mod p.
  • residue symbols
    • Legendre symbol — The Legendre symbol is a notation in number theory used to test whether an integer is a quadratic residue modulo an odd prime. It takes values of 1, -1, or 0, and its generalizations include the Jacobi and Kronecker symbols.
  • semiprimes
    • RSA numbers — RSA numbers are semiprimes used in public-key cryptography, named for the RSA encryption system. They are famous in number theory for factorization challenges such as the 129-digit number cracked by a distributed computation effort.

  • sieve — A sieve is a method of filtering candidates in number theory, as in the Sieve of Eratosthenes for primes. Related techniques include the quadratic sieve and Selberg or Legendre sieves used in factoring and prime-counting problems.

  • sieve methods
    • sieves — A sieve is a number-theoretic method for constructing a set of integers by systematically eliminating unwanted values, often to isolate the primes. Famous examples include the sieve of Eratosthenes and modern refinements such as the sieves of Atkin, Brun, and Selberg.
  • Sophie Germain primes — Sophie Germain primes are primes p for which 2p + 1 is also prime. They are commonly used in constructing safe primes and appear in work connected to Sophie Germain’s number-theoretic research.
    • Sophie Germain prime — A Sophie Germain prime is a prime p such that 2p + 1 is also prime. These primes are linked to safe primes and to Sophie Germain’s work on Fermat’s Last Theorem.
  • special numbers
    • amicable numbers — Amicable numbers are pairs of integers whose proper divisors sum to each other, as in the classic pair 220 and 284. They are a special case of sociable numbers, and famous examples include 6, 28, 496, 8128, and 33,550,336.

  • taxicab numbers — Taxicab numbers are integers expressible as a sum of two positive cubes in more than one way. The name comes from Ramanujan’s famous remark about 1729 after Hardy arrived in a taxicab.

  • transcendental numbers — Transcendental numbers are real or complex numbers that are not algebraic, meaning they are not roots of any nonzero polynomial with rational or integer coefficients. Famous examples include e and pi, both shown to be transcendental by landmark theorems; Liouville numbers were among the first numbers proved to have this property. The topic is associated with Liouville, Hermite, Lindemann-Weierstrass, and classification work by Kurt Mahler. Every transcendental number is irrational, but not every irrational number is transcendental.
    • Liouville numbers
      • Liouville’s constant — Liouville’s constant is the transcendental decimal with 1s in factorial positions and 0s elsewhere. It is named for Joseph Liouville, who proved there are infinitely many transcendental numbers, and his name also appears in Liouville-type differential equations.

  • triangular numbers — Triangular numbers are the figures that count dots arranged in a triangle, with nth term n(n+1)/2. The sequence begins 1, 3, 6, 10, 15, and so on, and each number is the sum of the first n positive integers. They count the edges of complete graphs, appear in Pascal’s triangle and handshake problems, and figure in Gauss’s Eureka theorem, which states that every positive integer is the sum of three triangular numbers.

  • Twin primes — Twin primes are pairs of prime numbers that differ by exactly two, such as 3 and 5, 5 and 7, or 11 and 13. They are associated with Brun’s constant and the long-unproved twin prime conjecture, which asserts that infinitely many such pairs exist.
    • twin prime — A twin prime is one of a pair of primes that differ by two, such as 5 and 7 or 107 and 109. Brun’s theorem says the sum of the reciprocals of the twin primes converges, and Euclid’s famous infinitude question is often referenced for them.

  • von Mangoldt function — The von Mangoldt function, usually written with the Greek letter lambda, equals log p when n is a power of a prime p and is zero otherwise. It is used in analytic number theory, including formulations related to the prime number theorem.

  • Wieferich primes — Wieferich primes are primes p such that 2^(p−1) is congruent to 1 modulo p squared. They arise in results on Mersenne numbers and in work related to Catalan’s conjecture.

  • zeta function — The zeta function is the Dirichlet series associated with the Greek letter zeta, defined by the sum of n to the negative s power. Its most famous example is the Riemann zeta function. First studied by Euler and later extended by Riemann to complex values, it has nontrivial zeros that are central to the Riemann Hypothesis, which predicts they all lie on the line with real part one-half.
• Divisibility, Congruences, and Prime Numbers
  • Prime numbers — integers greater than 1 with no positive divisors other than 1 and themselves; 2 is the only even prime. They are central to the fundamental theorem of arithmetic, and classic results involving them include Euclid’s proof that there are infinitely many primes and Goldbach’s conjecture; they also underpin modern cryptography such as RSA.

    • 17 — 17 is a prime number that comes after 13 and before 19. It also appears in clues about approximate pKa values for alcohols and in the total syllable count of an English haiku translation.

    • 41 — Forty-one is the prime-generating value in Euler’s polynomial n² - n + 41. It also appears in the Mexican gay-history clue of the Dance of the Forty-One, a notorious 1901 police raid and scandal.

    • Bertrand’s postulate — Bertrand’s postulate, also called the Bertrand-Chebyshev theorem, says that for every integer n greater than 1 there is always a prime strictly between n and 2n. It is a classic result in number theory about the spacing of prime numbers.

    • infinitely many prime numbers — Euclid’s classic proof shows that there are infinitely many prime numbers.

    • prime — A prime number is a positive integer greater than one with no divisors besides one and itself. Prime ideals define integral-domain quotients, and primes also appear in Fermat’s little theorem, the fundamental theorem of arithmetic, and the definition of field characteristic. The term also underlies the prime avoidance lemma.

    • prime number — A prime number is a positive integer greater than one with no positive divisors besides one and itself. They are fundamental to arithmetic, appear in the sieve of Eratosthenes, and include special families such as Mersenne primes.

  • Infinitely many primes — proved by Euclid via a reductio ad absurdum argument.

  • Sieve of Eratosthenes — ancient algorithm for finding all primes up to a given limit. It works by crossing out multiples of each prime in turn, leaving the uncrossed numbers as primes. It is named for Eratosthenes of Alexandria and is simpler but slower than modern methods such as the Atkin sieve.

  • Euclid’s algorithm — iterative application of division to find the greatest common divisor (GCD) of two integers.
    • greatest common divisor — The greatest common divisor is the largest integer dividing a set of numbers evenly; for two relatively prime integers, it is 1. It can be found with the Euclidean algorithm, which repeatedly replaces a pair by the smaller number and the remainder. It appears in Bézout’s identity and satisfies gcd × lcm = product of the two numbers.

  • Fermat’s little theorem — if p is prime and p does not divide a, then aᵖ⁻¹ ≡ 1 (mod p). It is used in primality testing and is generalized by Euler’s totient theorem. The theorem is named for Pierre de Fermat.

  • Euler’s totient function φ(n) — counts integers from 1 to n that are coprime to n; φ(p) = p − 1 for prime p; appears in Euler’s theorem aᵠ⁽ⁿ⁾ ≡ 1 (mod n) for gcd(a,n) = 1, which underlies RSA.

  • Chinese Remainder Theorem — a system of simultaneous congruences x ≡ aᵢ (mod mᵢ) has a unique solution mod M = m₁m₂…mₖ when the moduli are pairwise coprime; used in cryptography and computer arithmetic. It is a standard tool in number theory and modular arithmetic, and is used in fast algorithms such as the Good-Thomas FFT.

  • Legendre’s formula — the exponent of a prime p in n! is vₚ(n!) = ⌊n/p⌋ + ⌊n/p²⌋ + ⌊n/p³⌋ + …, with the sum ending when pᵏ > n. Multiples of p supply one factor, multiples of p² supply an additional factor, and so on. Equivalently, vₚ(n!) = [n−sₚ(n)]/(p−1), where sₚ(n) is the sum of n’s base-p digits. Decimal trailing zeros count factors of 10: n! has ⌊n/5⌋ + ⌊n/25⌋ + … such zeros, since factors of 2 are more plentiful.⁶

  • Prime number theorem — the number of primes up to n is asymptotically n / ln n; independently proved by Hadamard and de la Vallée Poussin (1896). It was proved independently by Hadamard and de la Vallée Poussin using the nonvanishing of the Riemann zeta function on the line Re(s)=1.

  • Mersenne primes — primes of the form 2ⁿ − 1; requires n to be prime (though not all such n yield primes). Used in searches for the largest known primes. They are closely linked to perfect numbers and are searched for by projects such as GIMPS. They are central to the Lucas-Lehmer test, and early examples include 3, 7, 31, and 127.
    • Mersenne prime — A Mersenne prime is a prime number of the form 2^p minus 1. These numbers are famous because the largest known primes have often been found by the GIMPS distributed-computing project.
  • Perfect numbers — equal the sum of their proper divisors (e.g., 6 = 1 + 2 + 3); all known perfect numbers are even and linked to Mersenne primes. They are tied to Mersenne primes by the Euclid-Euler theorem, and all known examples are even. Examples include 6 and 28. They are neither abundant nor deficient.

    • odd perfect number — An odd perfect number would be a perfect number that is not divisible by two, meaning it equals the sum of its proper divisors. No such number is known, though results by Euler and later work place severe restrictions on its possible form and size.

    • Odd perfect numbers — Odd perfect numbers are hypothetical perfect numbers that are odd, and none are known to exist. Any such number would have severe restrictions, including a large lower bound, many prime factors, and congruence conditions such as being one more than a multiple of 12.

    • perfect number — A positive integer equal to the sum of its proper divisors. Classic examples include 6, 28, and 496; 28 is the standard example because its factors add up to 28. Every even perfect number corresponds to a Mersenne prime.

  • Quadratic reciprocity — Gauss’s “theorema aureum”: for distinct odd primes p and q, whether p is a quadratic residue mod q is reciprocally related to whether q is a quadratic residue mod p; Gauss gave the first rigorous proof and subsequently found five more.
    • Law of quadratic reciprocity — The law of quadratic reciprocity is Gauss’s theorem for relating Legendre symbols of odd primes. It says that the solvability of x² ≡ q mod p and x² ≡ p mod q is governed by a sign depending on p and q, with the tricky case when both primes are 3 mod 4. The result is a basic tool for computing quadratic residues, and it is also called the golden theorem.

  • Dirichlet’s theorem on primes in arithmetic progressions — for coprime a and d, there are infinitely many primes of the form a + nd; proved by Dirichlet (1837) using L-functions, inaugurating analytic number theory.

  • Euler’s theorem — for gcd(a, n) = 1, aᵠ⁽ⁿ⁾ ≡ 1 (mod n) where φ(n) is Euler’s totient; generalizes Fermat’s little theorem (which is the case n = prime).

  • Fermat primes — primes of the form Fₙ = 2^(2ⁿ) + 1; only five are known: F₀=3, F₁=5, F₂=17, F₃=257, F₄=65537; Gauss proved a regular n-gon is constructible with compass and straightedge iff n’s odd prime factors are distinct Fermat primes. Euler showed the next Fermat number, F5 = 2^(2^5) + 1, is divisible by 641.

  • Wilson’s theorem — an integer p > 1 is prime if and only if (p − 1)! ≡ −1 (mod p); provides a theoretical primality characterization but is computationally impractical for large numbers.

  • Coprime integers
    • coprime — Two integers are relatively prime when their greatest common divisor is 1, meaning they share no common factors. The Chinese remainder theorem, the Euclidean algorithm, and Euler’s totient function all use this relationship between integers.
  • Prime factorization
    • 2, 5, 5, 7 (can be said in any order) — These are the prime factors of the target number in the referenced factorization problem. They are 2, 5, 5, and 7 in any order.

  • aliquot sequence — An aliquot sequence is formed by repeatedly replacing a number with the sum of its proper divisors. Perfect numbers produce period-one cycles, while amicable and sociable numbers arise from longer repeating behavior.

  • Modular arithmetic — a ≡ b (mod n) means n divides a − b; forms the basis of clock arithmetic and much of cryptography. Modular arithmetic studies remainders and congruence classes under division by a fixed integer. It is the mathematics behind clock arithmetic, the Chinese remainder theorem, and many standard results in number theory.

    • modulus — Modulus, often written with the percent sign in programming, is the remainder operation used in modular arithmetic and RSA encryption. The same word also names the absolute value of a complex number and a related quantity in geometry and elasticity.

    • primitive root — A primitive root modulo n is a number whose powers generate all residues coprime to n. The concept appears in proofs of Fermat’s little theorem, and for prime p it is tied to generators of the multiplicative group modulo p.

  • Fundamental theorem of arithmetic — every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors; proves the existence and uniqueness of prime factorization. It underlies greatest common divisors, least common multiples, and much of elementary number theory.
• Diophantine Questions, Analytic Methods, and Conjectures

  • Goldbach’s conjecture — every even integer greater than 2 is the sum of two primes (1742; unproved as of 2026). Its weak form, proved by Harald Helfgott, says every sufficiently large odd number is the sum of three primes.

  • Twin prime conjecture — there are infinitely many pairs of primes differing by 2 (e.g., 11 and 13); unproved. It is an unsolved problem in number theory and is often discussed alongside work of Terence Tao and Ben Green on prime progressions.
    • Twin primes conjecture — The twin primes conjecture states that there are infinitely many pairs of primes differing by 2. It is closely connected to later work by Zhang, the GPY method, and the Hardy-Littlewood and Polignac generalizations.
  • Elliptic curves — smooth projective curves of the form y² = x³ + ax + b (with non-zero discriminant); form an abelian group under a geometric “chord and tangent” addition law; central to modern number theory, the proof of Fermat’s Last Theorem (Wiles used the modularity theorem for elliptic curves), and elliptic-curve cryptography. They are plane algebraic curves, and the group law is defined on their rational points.
    • Birch and Swinnerton-Dyer Conjecture — The Birch and Swinnerton-Dyer conjecture predicts a deep link between an elliptic curve and the behavior of its L-series at the point 1. It is one of the Clay Millennium Problems and is associated with partial results from Gross-Zagier, Kolyvagin, and Coates-Wiles.
  • Modularity theorem — every elliptic curve over ℚ is associated with a modular form; conjectured by Taniyama and Shimura (1955–1957), extended by Weil; Wiles proved it for semistable curves (1995), enabling the proof of Fermat’s Last Theorem; fully proved by Breuil, Conrad, Diamond, and Taylor (2001).

    • Taniyama-Shimura Conjecture — The Taniyama-Shimura conjecture, later called the modularity theorem, says elliptic curves over the rationals correspond to modular forms with matching L-series. Andrew Wiles used it in proving Fermat’s Last Theorem, first for semistable curves and then in full generality.

    • Taniyama-Shimura theorem — The Taniyama-Shimura theorem, now often called the modularity theorem, links elliptic curves to modular forms. Its semistable case was a crucial step in Andrew Wiles’s proof of Fermat’s Last Theorem.

  • L-functions — complex analytic functions generalizing the Riemann zeta function; the Birch and Swinnerton-Dyer conjecture connects the rank of an elliptic curve’s group of rational points to the order of vanishing of its L-function at s = 1.

  • Diophantine equations — polynomial equations sought in integer (or rational) solutions; named for Diophantus of Alexandria (~3rd century CE); examples include Pythagorean triples and Pell’s equation x² − ny² = 1. They also include Catalan-type problems.

    • Catalan conjecture — The Catalan conjecture states that 8 and 9 are the only consecutive perfect powers. It was proved by Preda Mihăilescu and can be phrased as the Diophantine equation x^p - y^q = 1.

    • Diophantine — Diophantine describes equations whose integer solutions are sought, such as Pell’s equation. The term also appears in Diophantine approximation, and the name comes from Diophantus of Alexandria.

    • Diophantine equation — A Diophantine equation is a polynomial equation whose solutions are required to be integers. Hilbert’s tenth problem asked for an algorithm to decide whether such equations are solvable.

    • Pythagorean triples — Pythagorean triples are sets of three integers that satisfy a2 + b2 = c2. They are the side lengths of right triangles and appear in ancient tables such as Plimpton 322.

  • Waring’s problem — asks, for each k, the minimum number g(k) such that every positive integer is a sum of at most g(k) perfect k-th powers; g(2) = 4 (Lagrange’s four-square theorem, 1770); Hilbert proved g(k) is finite for all k (1909).

  • Analytic number theory — uses tools from analysis (especially complex analysis and Fourier analysis) to study integers; major results include the prime number theorem and Dirichlet’s theorem on primes in arithmetic progressions.

  • Riemann zeta function — ζ(s) = Σ n⁻ˢ for Re(s) > 1; analytically continued to all s ≠ 1; the Riemann hypothesis conjectures all non-trivial zeros have Re(s) = ½; the distribution of primes is intimately tied to the zeros of ζ. Its values at even positive integers are tied to powers of π, and it is connected to the Basel problem and the prime number theorem.

    • Apery’s constant — Apery’s constant is the value of the Riemann zeta function at 3, approximately 1.202. It can be written as the sum of the reciprocals of the cubes of the positive integers.

    • non-trivial zeroes of the Riemann zeta function — The non-trivial zeroes of the Riemann zeta function lie in the critical strip and are conjectured to all have real part one-half. They are the values studied in results such as the prime-counting explicit formula and recent bounds on how many occur in certain intervals.

  • Collatz conjecture — start with any positive integer n; if even divide by 2, if odd multiply by 3 and add 1; the conjecture states every starting value eventually reaches 1; verified for all n up to ~2 × 10²⁰ but unproved; also called the 3n+1 problem. It asks whether repeated application of the 3n + 1 rule always reaches the cycle 1, 2, 4 for every positive integer. It has also inspired generalized versions involving modular arithmetic and directed graphs.

  • Hilbert’s problems — 23 unsolved problems posed by David Hilbert at the 1900 International Congress of Mathematicians; shaped the agenda of 20th-century mathematics; include questions on Cantor’s continuum hypothesis (#1), the consistency of arithmetic (#2), and the Riemann hypothesis (#8); most have been resolved, but #8 remains open. Hilbert also framed them as a program for future research; the list includes the continuum problem, the axiomatization of physics, and classic questions in algebra, geometry, and number theory.
    • David Hilbert’s problems — David Hilbert’s famous list of twenty-three mathematical problems was presented in 1900 at the International Congress of Mathematicians in Paris. The problems range from the continuum hypothesis to the Riemann hypothesis and became a landmark agenda for twentieth-century mathematics. Later mathematicians developed notable progress on them, including Dehn’s invariant for the third problem and Nash and Ennio di Giorgi on the nineteenth.
  • number theory conjectures
    • Goldbach’s Strong Conjecture — Goldbach’s strong conjecture claims that every even integer greater than two can be written as the sum of two primes. Its weak form, proved by Helfgott, states that every sufficiently large odd integer is the sum of three primes.
  • zeta functions — Zeta functions are complex-valued functions whose most famous example is the Riemann zeta function. They appear in regularization, spectral theory, and number theory, including functional equations and zeta hypotheses.
    • Riemann hypothesis — The Riemann hypothesis is the conjecture that the nontrivial zeros of the Riemann zeta function all have real part one-half. It is one of Hilbert’s famous problems and one of the Clay Mathematics Institute Millennium Problems.
  • Green–Tao theorem — the primes contain arithmetic progressions of every finite length. Ben Green and Terence Tao released the proof in 2004; it appeared in the Annals of Mathematics in 2008. The primes in a progression need not be consecutive primes.⁷ It is named for Ben Green and Terence Tao and generalizes ideas from Szemerédi’s theorem to the primes.
• Elementary number theory
  • coin-change problems
    • dollars — Dollars are the currency associated with classic arithmetic and coin-change problems, as well as the title of A Fistful of Dollars. They also appear in number theory puzzles involving the Frobenius and McNugget problems.
• Cyclotomic polynomials
  • first cyclotomic polynomial
    • x - 1 — The first cyclotomic polynomial is x-1, and for prime x it equals the value of Euler’s totient function at x. Fermat’s little theorem can be phrased using this expression as the exponent that makes any integer congruent to 1 modulo a prime.
• parity

  • oddness — Oddness is the property of being not divisible by two, so every prime other than 2 is odd. The term also describes odd permutations and odd functions, such as those satisfying f(-x) = -f(x).

  • evenness — Evenness is the property of an integer being divisible by two. It also describes functions like cosine that are symmetric about the y-axis.

• partitions — Partitions are political divisions, as in the late-18th-century partitions of Poland carried out by Prussia, Austria, and Russia. The word also names ways of splitting an integer into sums of positive integers, or dividing a set into nonempty parts.
  • Partition — Partition can refer both to the 1947 division of British India and to a data-storage scheme in computing. In mathematics, it is also the act of dividing a set into mutually exclusive, collectively exhaustive parts.

Discrete Mathematics and Information

Connect counting and graphs to discrete structures and information.

Discrete Mathematics

• Combinatorics — counting and arrangement of discrete structures; key tools include permutations (n!), combinations (C(n,k) = n!/k!(n−k)!), the inclusion-exclusion principle, the pigeonhole principle, and generating functions. It is often developed through binomial coefficients, factorials, and Stirling numbers, and has applications in graph theory, probability, and Ramsey theory.

  • 120 ways — 120 ways can be the result of a simple counting or permutation calculation. The included prompts use the multiplication principle and ordered selections without repetition.

  • 2 to the power of n — The function 2 to the n counts subsets of an n-element set and gives the sum of the binomial coefficients in Pascal’s triangle. It also gives the maximum number of stereoisomers for n independent tetrahedral stereocenters in the absence of symmetry.

  • Bell numbers — Bell numbers count the number of ways to partition a set of n elements into nonempty disjoint subsets. The sequence begins 1, 1, 2, 5, 15, 52, and continues with rapidly growing values.

  • binomial coefficients — Binomial coefficients are the values n choose k that appear in Pascal’s triangle and count combinations. They satisfy identities such as Vandermonde’s convolution, the hockey-stick identity, and the binomial theorem.

    • 2 to the n — The sum of the binomial coefficients in the nth row of Pascal’s triangle is 2 to the n. This is also the number of subsets of an n-element set.

    • 2n choose n — The central binomial coefficient is the expression 2n choose n, equal to (2n)! divided by (n!)^2. It appears in Pascal’s triangle and in identities involving Catalan numbers and the sum of squared row entries.

    • binomial coefficient — A binomial coefficient counts the ways to choose k items from n without regard to order. These numbers appear in Pascal’s triangle and in the binomial theorem, and they sum to 2 to the n for fixed n.

    • binomial combination — The binomial combination is the formula for choosing k objects from n without order mattering. Its values fill Pascal’s triangle and can be written as n factorial divided by k factorial times (n minus k) factorial.

  • combination — A combination is a selection of items where order does not matter. Its standard counting formula is n choose r, the binomial coefficient used in Pascal’s triangle.

  • combinations — Combinations are selections of items in which order does not matter, often written with the notation n choose k. They are counted by binomial coefficients and stand in contrast to permutations, where order matters.
    • Binomial combinations — Combinations count selections where order does not matter, often written with binomial notation and computed by a factorial formula. They appear in Pascal’s triangle and in counting problems such as distributing identical objects or choosing k items from n.
  • combinatorial designs
    • Latin squares — Latin squares are n-by-n arrays in which each symbol appears exactly once in each row and column. They appear in Sudoku, KenKen, group Cayley tables, and experimental-design constructions such as orthogonal and Greco-Latin squares.
      • Latin square — An n-by-n arrangement in which each symbol appears exactly once in every row and every column. The name comes from Latin, whose modern descendants include Spanish, Italian, and French. Latin squares are used in combinatorics and experimental design, and Euler’s 36 Officers Problem helped inspire their study.
  • counting — Counting is the basic process of determining how many objects are in a set, a skill studied in cognitive psychology and developmental psychology. It is contrasted with subitizing, the rapid recognition of very small quantities without serial enumeration.

    • 2n — The expression 2^n counts the subsets of an n-element set and gives the sum of the nth row of Pascal’s triangle. It also gives the maximum number of stereoisomers for a carbohydrate with n chiral centers.

    • Number of black keys on a piano — A standard piano has 52 white keys and 36 black keys, so the number of black keys is 36.

  • factorial function — The factorial function gives the product of the positive integers from 1 through n and is written n! with an exclamation point. It counts permutations of n objects and appears in Stirling’s approximation, Wilson’s theorem, and the gamma function extension.

  • factorials — Factorials are the products of the integers from 1 through n, written with an exclamation point. They appear in Stirling’s approximation, the binomial theorem, permutations, and many probability formulas, with 0! defined as 1.

  • Golomb rulers
    • optimal Golomb ruler — An optimal Golomb ruler is a set of nonnegative integers in which every pairwise difference is unique. These objects are studied in communications and combinatorial design.

  • k-combinations — A k-combination, or “n choose k,” counts how many subsets of size k can be chosen from a larger set when order does not matter. These values are the binomial coefficients that appear in Pascal’s triangle and in the hypergeometric distribution. The hockey-stick identity relates sums of these values across rows of Pascal’s triangle.

  • Large numbers
    • Graham’s number — Graham’s number is an enormous bound arising from a problem in Ramsey theory about hypercubes. It became famous after Martin Gardner highlighted it as one of the largest numbers used in a serious proof.
  • magic squares — Magic squares are square arrays of numbers whose rows, columns, and diagonals all sum to the same value. Classical methods for constructing them include the Siamese method and Conway’s LUX algorithm, and famous examples appear in works such as Dürer’s Melencolia I.
    • magic square — A magic square is a grid of numbers arranged so every row, column, and diagonal has the same sum. They appear in art and mathematics alike, including Dürer’s Melencolia I and the Sagrada Família’s numerological designs.
  • matching theory
    • stable marriage problem — The stable marriage problem asks for pairings between two ranked groups with no blocking pairs. Gale and Shapley’s algorithm solves it by having one side propose until a stable matching is reached.

  • N queens problem — The n-queens problem asks for placements of chess queens on an n-by-n board so that none attack each other. It is a standard backtracking and exact-cover problem, and the 8-queens case famously has 92 solutions up to symmetry.

  • permutation — A permutation is a rearrangement of a set in which order matters, and the total number of permutations of n objects is n factorial. Permutations form the symmetric group, and special cases include derangements, transpositions, and even or odd permutations.

  • Permutations — Permutations are rearrangements of a set in which order matters. They can be written in cycle notation or as products of transpositions, and they form the elements of symmetric groups; the even permutations form alternating groups. Counting formulas for permutations include n! and nPr, and they appear in topics ranging from determinants to derangements.
    • Derangement — A derangement is a permutation with no fixed points. The term comes up in counting rearrangements where order matters, especially in symmetric-group and factorial formulas.
  • Puzzles
    • Tower of Hanoi — The classic recursive disk-moving puzzle invented by Édouard Lucas in 1883, involving three pegs and moving a stack of disks one at a time without placing a larger disk on a smaller one. Its minimal solution takes 2^n - 1 moves for n disks. It is often linked to Gray codes and the Sierpiński triangle graph, and to the legend of Hindu/Brahmin priests or monks moving 64 rings or disks in a temple at Varanasi, with the completion time so vast that it is effectively impossible to finish by hand.
  • set partitions
    • set partition — A set partition is a collection of nonempty, disjoint subsets whose union is the whole set. Bell numbers count the number of possible partitions of a finite set.
  • transversals — Transversals are sets that intersect each member of a family in exactly one chosen element. They appear in combinatorics, where they are also called systems of distinct representatives, and are related to Hall’s marriage theorem.
• Counting and Generating Functions

  • Factorial — for a nonnegative integer n, n! = 1 × 2 × … × n, with 0! = 1; for example, 5! = 120. It counts the ways to order n distinct objects and is the order of the symmetric group Sₙ. Ordered selections of k distinct objects from n number n!/(n−k)!; unordered selections number n!/[k!(n−k)!]. Factorials also appear in Taylor coefficients: the coefficient of (x−a)ⁿ is f⁽ⁿ⁾(a)/n!. The series Σₙ₌₀∞ 1/n! equals Euler’s number e, whereas the Euler–Mascheroni constant γ is a different number.⁸ It is extended to complex numbers by the gamma function; Stirling’s approximation estimates its growth, and Legendre’s formula gives prime-power divisibility information.

  • Gamma function (Γ) — extends factorials through Γ(n+1) = n!. For Re(z) > 0, Γ(z) = ∫₀∞ t^(z−1)e^(−t) dt; integration by parts gives Γ(z+1) = zΓ(z). It continues meromorphically to the complex plane, with poles at 0, −1, −2, …; Γ(1/2) = √π. Watch the shift: Γ(n) = (n−1)!, rather than n!.⁹

  • Stirling’s approximation — n! ∼ √(2πn)(n/e)ⁿ as n → ∞, meaning the ratio of the two sides tends to 1. Taking logarithms gives ln(n!) = n ln n − n + ½ ln(2πn) + O(1/n); the shorter n ln n − n expression retains the leading terms. This estimates factorial growth; Stirling numbers instead count permutations or set partitions.¹⁰ It is a standard asymptotic estimate used throughout combinatorics, probability, and statistical mechanics, and appears in derivations such as the Sackur-Tetrode equation. It is also useful for asymptotic estimates involving binomial coefficients and Catalan numbers.

  • Double factorial — n!! multiplies every other positive integer down from n: 7!! = 7 × 5 × 3 × 1 = 105 and 6!! = 6 × 4 × 2 = 48. The conventions 0!! = (−1)!! = 1 support the recurrences. In particular, (2m)!! = 2ᵐm! and (2m−1)!! = (2m)!/(2ᵐm!). The two exclamation marks denote this operation, rather than applying factorial twice.¹¹

  • Rising and falling factorials — the rising factorial, or Pochhammer symbol, (x)ₙ = x(x+1)…(x+n−1); the falling factorial x^(underline n) = x(x−1)…(x−n+1). Both empty products equal 1. The rising version equals Γ(x+n)/Γ(x) wherever that quotient is defined; for integer n ≥ k ≥ 0, the falling factorial n^(underline k) = n!/(n−k)! counts ordered selections without replacement. Check the author’s notation, since some combinatorics texts use (x)ₙ for the falling version.¹²

  • Derangement / subfactorial — a permutation leaving none of its objects in its original position. Inclusion-exclusion gives Dₙ = n!Σₖ₌₀ⁿ (−1)ᵏ/k!, often written !n. For n ≥ 1, Dₙ is the nearest integer to n!/e; a uniformly random permutation is a derangement with probability tending to 1/e. Returning shuffled hats to their owners is the classic example.¹³

  • Generating functions — formal power series Σ aₙ xⁿ encode a sequence (aₙ); multiplication, differentiation, and partial fractions extract combinatorial identities; ordinary and exponential generating functions are the two main types.

  • Stirling numbers — two related families: Stirling numbers of the first kind count permutations by cycle structure; those of the second kind count partitions of a set of n elements into k non-empty subsets; appear in combinatorics and analysis of algorithms.

  • Pigeonhole principle — if n+1 objects are placed into n containers, at least one container holds more than one object; despite simplicity, yields non-trivial results (e.g., two people in any city of > 365,000 share a birthday). It is a basic counting argument attributed to Dirichlet; equivalently, there is no injective function from a larger set into a smaller one. It is often used in combinatorics and proofs by contradiction.

  • Inclusion-exclusion principle —

    A ∪ B ∪ C

    =

    A

    +

    B

    +

    C

    −

    A∩B

    −

    A∩C

    −

    B∩C

    +

    A∩B∩C

    ; generalizes to n sets; used in counting and probability.

  • Catalan numbers — sequence 1, 1, 2, 5, 14, 42, …; Cₙ = C(2n,n)/(n+1); count structurally equivalent combinatorial objects including valid parenthesizations, binary trees, and non-crossing polygon triangulations.
• Boolean — Boolean refers to the two-valued logic and algebra named for George Boole, built on the truth values true and false. It is used with operations such as AND, OR, and NOT, and its laws include De Morgan’s identities. Boolean expressions, variables, and satisfiability problems are central to digital logic, circuit theory, complexity theory, set operations, and many search queries.
  • Boolean functions — Boolean functions are logical expressions or formulas built from variables and operators that evaluate to true or false. They can be represented by truth tables, conjunctive normal form, or disjunctive normal form, and are central to circuit design and satisfiability problems. They are often simplified with Karnaugh maps, the Quine-McCluskey method, and De Morgan’s laws; the term honors George Boole.

    • Boolean expressions or Boolean statements or Boolean function — Boolean expressions are logical formulas that evaluate to true or false and can be simplified by methods such as Karnaugh maps and the Quine-McCluskey algorithm. They are foundational to Boolean algebra and digital circuit design.

    • XOR function — The XOR, or exclusive-or, function returns 1 exactly when its two inputs differ. It is a classic example of a nonlinearly separable boolean function that single-layer perceptrons cannot learn.

  • or — The inclusive logical connective or is the Boolean operation true when either input is true, including when both are true. It contrasts with exclusive OR, and quizbowl clues may pair it with propositional logic or RAID parity recovery.

  • XOR — XOR, or exclusive or, is the binary logical operation true exactly when its two inputs differ, equivalently when exactly one input is true. It is the same as addition modulo 2 in GF(2), and in Boolean algebra is often written with a circled plus. In C and C++, the caret symbol denotes bitwise XOR. It appears in circuits, parity checks, Hamming codes, half-adders, linear feedback shift registers, CDMA, bit masking, bitwise error correction, and some phase-detector circuits in phase-locked loops. It is a classic example of a function a single-layer perceptron cannot represent.
• finite — In mathematics and computer science, finite objects have integer size rather than infinite extent, so a finite set can be listed in bijection with {1,2,…,n} for some n. Finite groups and fields are especially important because many standard structure theorems simplify in that setting, and finite-state machines recognize exactly the regular languages.

Graph Theory

• graph theory — Graph theory studies structures made of vertices and edges, the sort of diagrams used to model networks and maps. Euler’s work on the Seven Bridges of Königsberg is a classic starting point for the field, and the four-color theorem is one of its famous problems. The field also includes algorithms such as Dijkstra’s and problems such as the Chinese postman problem.

  • centrality — Centrality is a network measure of how important or centrally located a node is within a graph. Its major forms include degree, betweenness, closeness, eigenvector centrality, Katz centrality, and PageRank-style measures.

  • chromatic number — The chromatic number of a graph is the minimum number of colors needed for a proper coloring with no adjacent vertices sharing a color. It is four for planar graphs by the four-color theorem, and it is bounded by results such as Brooks’s theorem and Hadwiger’s conjecture.

  • cliques
    • Clique — In graph theory, a clique is a completely connected or complete subgraph in which every pair of vertices is adjacent. The term also appears in the NP-complete clique problem and in contexts such as Ramsey theory, perfect graphs, and algorithms like Bron–Kerbosch. In everyday language, it can mean a tightly knit group of friends.
  • complete graphs — Complete graphs are graphs in which every pair of vertices is connected by an edge. They are the simplest nonplanar graphs by vertex count, and their chromatic polynomial is a falling factorial.
    • complete graph — A complete graph is a simple graph in which every pair of vertices is connected by an edge. These graphs are commonly written K sub n, and directed versions of them underlie tournaments.

  • Connected components — A connected component is a maximal part of a graph in which every vertex can be reached from every other by a path. In an undirected graph, the connected components partition the vertex set, and their number equals the multiplicity of the Laplacian’s zero eigenvalue. In directed graphs, the analogous structures are strongly connected components, where every pair of vertices is reachable in both directions; they can be found by Tarjan’s method or by Kosaraju’s algorithm using depth-first search on the reversed graph and a second pass in reverse postorder.

  • connectivity
    • Menger’s theorem — Menger’s theorem states that the maximum number of pairwise internally disjoint paths between two vertices equals the minimum size of a separating vertex cut. Its edge version underlies max-flow min-cut arguments and is a cornerstone of graph connectivity.
  • cycles — In graph theory, cycles are closed walks that begin and end at the same vertex, and they may be Hamiltonian or Eulerian. They are central to topics such as girth, bipartite graphs, and algorithms like Floyd’s tortoise-and-hare and the cycle-cover problem.
    • Cycle — A cycle, or circuit, is a path in a graph that starts and ends at the same vertex without repeating other vertices. Graph theory uses cycles in ideas such as girth, chords, bipartite graphs, and blocks.

  • Cyclic structure — A cyclic structure is one that contains a cycle or loop, meaning a path that starts and ends at the same vertex. The term appears in graph theory, cycle-detection algorithms, and cyclic error-correcting codes.

  • directed graph — A directed graph is a graph whose edges have orientation, so its connections are ordered pairs of vertices. Directed acyclic graphs and tournament diagrams are common special cases.

  • directed graphs — Directed graphs are graphs whose edges have a direction, usually drawn as arrows between vertices. In tournament settings, they can model wins and losses, with each team’s outdegree matching its number of wins.

  • edges — In graph theory and geometry, edges are the line segments that connect vertices and define polygons, polyhedra, and networks. They are central to algorithms such as Canny edge detection and to problems like Kruskal’s minimum spanning tree and the traveling salesperson problem.
    • Edge — Edge is a ring name used by Adam Copeland of professional wrestling and by David Evans of U2. The name also belongs to a Final Fantasy IV ninja character and is used in a percolation-theory context for a graph connection.
  • Eulerian circuits
    • Eulerian circuit — An Eulerian circuit is a closed walk in a graph that traverses each edge exactly once. For an undirected graph, it differs from an Eulerian path because it must start and end at the same vertex.

  • Eulerian path — In graph theory, an Eulerian path or trail traverses every edge exactly once. An Eulerian circuit or cycle is a closed walk that uses every edge exactly once. An Eulerian cycle exists when all vertices have even degree; an Eulerian path exists when all but two vertices have even degree. The concept comes from Euler’s work on the bridges of Königsberg.

  • Eulerian paths
    • Seven Bridges of Konigsberg — The classic graph theory problem asks whether one can traverse each of the city’s seven bridges exactly once. Euler showed this was impossible because the land masses create too many vertices of odd degree; the result became an early landmark of graph theory and a precursor to later Eulerian-path ideas, helping found graph theory and topology.

  • Four Color Problem — The Four Color Problem asks whether any planar map can be colored with four colors so that adjacent regions differ, i.e. the minimum number of colors needed to color a map so that adjacent regions do not share a color. First proposed by Francis Guthrie in 1852, it was finally proved by Appel and Haken in 1976 using a computer-assisted proof, after Kempe’s earlier proof attempt failed.

  • girth — Girth is the length of the shortest cycle in a graph. An acyclic graph has infinite girth, and in tournament settings the minimum possible girth can be three.

  • graph isomorphism — Graph isomorphism asks whether two graphs are structurally the same, meaning there is a one-to-one correspondence preserving adjacency. It is a famous complexity problem that remains neither known to be in P nor NP-complete.

  • graph minors
    • graph minor — A graph minor is obtained from a graph by deleting edges, deleting vertices, and contracting edges. Graph minors are central to results such as Wagner’s theorem, the Robertson-Seymour theorem, and Hadwiger’s conjecture.

  • Hamiltonian cycle — A Hamiltonian cycle is a closed tour through a graph that visits every vertex exactly once and returns to its starting point. It is the target of the traveling salesman problem and appears in results such as Dirac’s theorem and other sufficient conditions for graph Hamiltonicity.

  • Hamiltonian path — A Hamiltonian path is a path in a graph that visits each vertex exactly once. The related Hamiltonian cycle problem is NP-complete, and the traveling salesman problem is a classic optimization problem related to Hamiltonian paths. The name contrasts with the Eulerian path problem.

  • handshaking lemma — The handshaking lemma states that the sum of all vertex degrees in an undirected graph equals twice the number of edges. A standard corollary is that every graph has an even number of odd-degree vertices.

  • knight’s tour problem — The knight’s tour problem asks for a knight to visit every square of a chessboard exactly once. It is a Hamiltonian-path-style puzzle on the 8-by-8 board, with classical solution methods such as Warnsdorff’s rule.

  • matching — A matching in graph theory is a set of edges that share no vertices. Related terms include maximal, perfect, and maximum matchings, with the blossom algorithm used to find a maximum matching in general graphs.

  • maximum clique problem — The maximum clique problem asks for the largest set of mutually adjacent vertices in a graph. It is NP-complete and is often approached with algorithms such as Bron–Kerbosch, with variants using pivoting and exponential-time improvements on sparse graphs.

  • network flow
    • Max-flow min-cut theorem — The max-flow min-cut theorem states that the maximum amount that can be sent from a source to a sink in a network equals the capacity of the minimum edge cut separating them. It is closely tied to Ford-Fulkerson style augmenting-path methods and can be proved using linear programming duality.

  • nodes — Nodes are points in a graph or structure, from graph theory to biology and anatomy. They also include the zero-displacement points of standing waves and the gaps in a myelinated axon known as nodes of Ranvier.

  • planar graph — A planar graph can be drawn in the plane without any crossing edges. Kuratowski’s theorem characterizes them by the absence of subdivisions of K5 and K3,3, and Euler’s formula and the four-color theorem are standard related results.

  • planarity
    • planar — A planar object can be drawn on a flat surface without crossings, whether it is a graph or a geometric molecule. In graph theory, planarity is characterized by results such as the four-color theorem and the impossibility of K5 or K3,3 as subdivisions.
  • shortest path problems
    • Shortest path problem — This graph problem asks for the route of minimum total weight or minimum distance between vertices. It is solved by algorithms such as Dijkstra’s algorithm, Bellman-Ford, Floyd-Warshall, A*, and Viterbi-style dynamic programming, depending on the setting. It appears in path planning, manifold learning, GPS, videogame navigation, and the traveling salesman problem.

  • snarks — Snarks are the bizarre creatures from Lewis Carroll’s The Hunting of the Snark. The term is also used in graph theory for certain nonplanar bridgeless cubic graphs.

  • spanning trees
    • spanning tree — A spanning tree is a tree subgraph that includes every vertex of a graph. In a connected graph it has one fewer edge than vertices and contains no cycles. Minimum spanning trees are found by greedy algorithms such as Prim’s and Kruskal’s, and the total number of spanning trees in a complete graph is given by Cayley’s formula.

  • Strahler number — The Strahler number is a hierarchical measure used to classify streams by branching order in river systems. It also appears in computer science as a measure of the register needs or evaluation complexity of an expression or program.

  • The Konigsberg Bridge Problem — The Konigsberg Bridge Problem asks whether one can cross each of the seven bridges of the Pregel River exactly once and return to the starting point. Euler showed that it is impossible because the graph has four vertices of odd degree, making it an early foundation of graph theory.

  • the Seven Bridges of Königsberg — These bridges in Königsberg inspired Leonhard Euler’s famous negative solution to the problem of crossing each bridge exactly once. Their wartime bombing and the resulting layout changes later made the old puzzle a historical curiosity.

  • The Seven Bridges of Königsberg Problem — The Seven Bridges of Königsberg is the classic graph-theory problem of finding a route that crosses each bridge exactly once. Euler’s argument showed that no such walk exists for the original Königsberg graph because its vertices have odd degree.

  • vertex — A vertex is a point where edges or line segments meet, especially the point where the sides of a polygon meet. In graph theory, vertices are the nodes joined by edges; they are the objects counted in Euler’s formula and used in graph problems such as Hamiltonian cycle and vertex cover. Curves such as parabolas and hyperbolas can also be described by their vertices, and the term appears in formulas for quadratic forms and algorithms involving degree, cut vertices, and shortest paths.
• Paths, Trees, and Connectivity

  • Seven Bridges of Königsberg — Euler’s 1736 problem asking whether one could cross all seven bridges of the city of Königsberg exactly once and return to the start; Euler proved it impossible by showing some vertices had odd degree, founding graph theory. It is also commonly cited as an early step toward topology.

  • Eulerian trail / circuit — an Eulerian trail uses every edge exactly once; an Eulerian circuit returns to its starting vertex. For a finite undirected graph with at least one edge, all vertices of nonzero degree must belong to one connected component. Under that condition, an Eulerian circuit exists exactly when every degree is even; an open Eulerian trail exists exactly when two vertices have odd degree. Degree parity alone is insufficient for disconnected graphs.¹⁴

  • Hamiltonian path / circuit — visits every vertex exactly once; unlike the Eulerian case, no simple degree condition characterizes existence; the related Hamiltonian cycle problem is NP-complete.

  • Trees — connected acyclic graphs; a tree on n vertices has exactly n − 1 edges; spanning trees connect all vertices of a graph with no cycles; Cayley’s formula: the number of labeled trees on n vertices is nⁿ⁻².

  • Bipartite graph — a graph whose vertices can be 2-colored so no edge joins same-color vertices; König’s theorem: in a bipartite graph the maximum matching size equals the minimum vertex cover size. Equivalently, a graph is bipartite iff it contains no odd cycle. Bipartite graphs are central to matching theory, including Hall’s theorem and the Karp-Hopcroft algorithm.

  • Network flow / max-flow min-cut theorem — in a directed network, the maximum flow from source to sink equals the minimum capacity of a cut separating them; proved by Ford and Fulkerson (1956).

  • Tree depth
    • depth — Depth is the distance from a node to the root in a tree, and in algorithms it gives rise to depth-first search. The same word also appears in physics and geometry clues about wave speed, sound cancellation, and profiling along the z-axis.
  • bipartite graphs
    • bipartite — A graph is bipartite if its vertices can be split into two disjoint sets so that every edge goes between the sets. This is the graph-theory property behind complete bipartite graphs such as K3,3.
  • Traveling Salesperson Problem (TSP) — given a list of cities and the distances between them, find the shortest possible route that visits each city exactly once and returns to the origin; one of the most famous NP-hard optimization problems; the decision version (is there a route shorter than length k?) is NP-complete; exact solutions require exponential time in the worst case; notable approaches include the Held-Karp dynamic programming algorithm (O(2ⁿn²)), branch-and-bound methods, and the Concorde solver; practical approximation algorithms include the Christofides-Serdyuk algorithm (guaranteed within 3/2 of optimal for metric TSP) and local search heuristics (2-opt, 3-opt); has applications in logistics, circuit board drilling, DNA sequencing, and telescope scheduling; a canonical example used to motivate the P vs NP question.
• Planarity, Coloring, and Extremal Questions
  • Planar graphs — graphs that can be drawn in the plane without edge crossings; Euler’s formula V − E + F = 2 applies; Kuratowski’s theorem: a graph is planar iff it contains no subdivision of K₅ or K₃,₃.
    • Kuratowski’s Theorem — Kuratowski’s theorem characterizes planar graphs by forbidding subdivisions homeomorphic to K5 or K3,3. In the standard statement, a graph is nonplanar exactly when it contains one of those two forbidden subgraphs.
  • Graph coloring — assigning colors to vertices so adjacent vertices differ; the chromatic number χ(G) is the minimum number needed; the four color theorem states χ ≤ 4 for planar graphs. The concept also covers edge coloring and map coloring. Further results include Vizing’s theorem and Brooks’ theorem, which give additional bounds and special cases.

    • Four-Color Map Theorem — The Four-Color Map Theorem states that any planar map can be colored with at most four colors so adjacent regions differ. Appel and Haken’s computer-assisted proof made it famous, and it is tied to planar graphs, Kempe chains, and the Hadwiger conjecture.

    • Heawood conjecture — The Heawood conjecture gives the maximum number of colors needed to color graphs on surfaces in terms of genus or Euler characteristic. It generalizes the four-color theorem, and the Ringel-Youngs theorem proved the orientable case.

    • The Four-Color (Map) Theorem — The Four-Color Theorem says any map in the plane can be colored with no more than four colors so adjacent regions differ. Appel and Haken first proved it with a computer-assisted reduction to 1,936 cases, later streamlined by Robertson and collaborators.

  • Ramsey theory — studies conditions guaranteeing structure in large enough combinatorial objects; Ramsey’s theorem states that for any r and s there exists N such that any 2-coloring of K_N contains a monochromatic K_r or K_s; the smallest such N is a Ramsey number (most are unknown). It is a branch of combinatorics concerned with the appearance of order in sufficiently large or highly colored structures, and includes results such as van der Waerden’s theorem and the Hales-Jewett theorem.

    • Ramsey numbers — Ramsey numbers measure the threshold at which order must appear in a sufficiently large complete graph or party arrangement. They guarantee that among a large enough set, one finds a monochromatic clique of a given size or a group of mutual strangers of a given size.

    • Ramsey’s theorem — Ramsey’s theorem says that sufficiently large graphs must contain monochromatic cliques or independent sets under any finite coloring. Its finite-graph form is often stated using the Ramsey numbers R(k,l).

    • Ramsey-type theorems — Ramsey-type theorems are results in combinatorics asserting that sufficiently large structures must contain highly regular substructures. They include classic results such as Ramsey’s theorem, Hindman’s theorem, and the Paris–Harrington variation.

  • Chromatic polynomial — counts the number of proper colorings of a graph G with k colors as a polynomial in k; evaluating at specific k gives the chromatic number when the polynomial first becomes positive.

Computational Geometry

• Delaunay triangulation — A triangulation of a point set in which no point lies inside the circumcircle of any triangle. It is dual to the Voronoi diagram, is characterized by the empty circumcircle property, and maximizes the minimum angle among triangulations. It is widely used in computational geometry and mesh generation.

• triangulation — Triangulation is the process of subdividing a region into triangles, often with a Delaunay variant that satisfies the empty circumcircle property. It appears in polygon angle-sum arguments, art gallery proofs, and computational geometry algorithms.

• Voronoi diagrams — Voronoi diagrams partition a plane into regions closest to given seed points. They are dual to Delaunay triangulations and appear in applications from Thiessen polygons to clustering and spatial analysis.
  • Voronoi diagram — A Voronoi diagram partitions space into regions closest to each of a set of seed points. These diagrams are dual to Delaunay triangulations and arise in tessellations, Lloyd’s algorithm, and proximity computations.
• Convex geometry
  • convex hull — The convex hull of a set of points is the smallest convex set containing them, often imagined as a rubber band stretched around the points. Algorithms such as Graham scan, Jarvis march, Chan’s algorithm, and Kirkpatrick-Seidel compute this object.

Related Concepts and Applications

• Graphs
  • paths — Paths are routes or trajectories, whether in graphs, filesystems, physics, or causal analysis. The clues mention Dijkstra’s algorithm, the Unix PATH variable, Feynman path integrals, and path dependence.

Information Theory and Cryptography

• Shannon entropy — H(X) = −Σ p(x) log₂ p(x); measures average information (in bits) of a random variable; maximized by a uniform distribution; introduced by Claude Shannon (1948). It is also called information entropy and is defined from symbol frequencies or probabilities. In information theory it measures average uncertainty, is closely tied to data compression and channel capacity, and gives the minimum expected number of bits needed to encode a source.

• RSA encryption — public-key cryptosystem (Rivest, Shamir, Adleman, 1977); security relies on the computational difficulty of factoring large semiprime n = pq; public key (n, e), private key d with ed ≡ 1 (mod φ(n)). Implementations may derive the private exponent using the totient or Carmichael function, and the Chinese remainder theorem is often used to speed computations.

• Cryptographic hash functions — one-way functions mapping arbitrary inputs to fixed-length outputs (e.g., SHA-256 produces 256-bit hashes); collision-resistance and preimage-resistance are the security properties; underpin digital signatures, blockchains, and certificate verification. They are used in password storage and proof-of-work systems, and common examples include SHA-1, MD5, and Keccak.

• Diffie-Hellman key exchange — (1976) allows two parties to establish a shared secret over a public channel using the computational difficulty of the discrete logarithm problem; the first practical public-key protocol.

• Elliptic-curve cryptography (ECC) — public-key cryptography based on the discrete logarithm problem on elliptic curves; achieves equivalent security to RSA with much shorter key lengths; widely used in TLS, Bitcoin, and mobile devices.

• Coding theory
  • error detection — Error detection is the process of identifying mistakes in transmitted data, often with parity bits, checksums, CRCs, or codes such as Hamming codes. Related methods also include algorithms designed to catch transpositions and other accidental data changes.

    • Checksum — A checksum is an error-detection value computed from data and compared after transmission or storage. It is commonly used in network headers and by hash-based file verification systems.

    • checksums — Checksums are values computed from data to detect errors or unintended changes during transmission or storage. They are used by networking protocols such as TCP, and variants can be based on hash functions or algorithms like Fletcher’s.
      • hashes — Hashes are fixed-size values produced by hash functions and used for constant-time lookup in hash tables and related cryptographic applications. They are central to collision handling, Git commit identifiers, and proof-of-work systems such as Bitcoin mining.
    • parity bit — A parity bit is an extra bit added to data so the total number of ones is even or odd. It is a simple error-detection feature used in communication standards and memory systems, including configurations like 8N1 and some RAID implementations.

  • Gray codes — Gray codes are binary codes in which successive values differ by exactly one bit. They are used in applications such as bell ringing, the Towers of Hanoi, and Venn-diagram classification, and were patented by Frank Gray.

  • Richard Hamming — Richard Hamming was an information theorist and mathematician known for the Hamming distance and Hamming code. His code adds parity bits to detect and correct single-bit errors, and his name also appears in a famous essay about doing great research.
• Error correction — It is used in transmission and storage to detect and repair corrupted data, recovering the original message with coding schemes such as parity bits, Hamming codes, Reed-Solomon codes, Golay codes, and other block codes.

  • Hamming code — A Hamming code is a linear error-correcting code designed to detect and correct single-bit errors. Its seven-four form is a classic example, and Hamming distance measures how many positions differ between two strings.

  • Hamming codes — Hamming codes are linear error-correcting codes that can correct single-bit errors and, in the classic (7,4) case, add three parity bits. They are perfect codes over a binary alphabet with minimum distance three.

  • Reed-Solomon codes

    • Reed-Solomon code — The Reed-Solomon code is an error-correcting code designed by MIT scientists in 1960 and used in a wide range of digital systems. It is built from codewords drawn from polynomials over a finite field and became a standard method before turbo codes.

Algorithms, Computability, and Complexity

Connect discrete mathematics to algorithms, computability, and resource bounds.

• Big-O notation — O(f(n)) describes an upper bound on the asymptotic growth rate of a function; standard hierarchy: O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2ⁿ); central to algorithm analysis. The notation is associated with Paul Bachmann and Edmund Landau and is often used with the Master theorem; for example, quicksort runs in O(n log n) time and depth-first search on graphs runs in O(V + E), where V is the number of vertices and E is the number of edges.

• Turing machine — Alan Turing’s (1936) abstract model of computation consisting of an infinite tape, a read/write head, and a finite state table; defines the class of “computable” functions; the halting problem (determining whether an arbitrary Turing machine halts) is undecidable.

• NP-completeness — a problem is NP-complete if it is in NP and every NP problem reduces to it in polynomial time; Cook (1971) and Levin proved SAT (Boolean satisfiability) is NP-complete; thousands of problems (e.g., traveling salesman, graph coloring) are NP-complete; solving any one in polynomial time would imply P = NP.

• P vs NP problem — the central open question of theoretical computer science: can every problem whose solution can be quickly verified also be quickly solved? (see Millennium Problems).

• algorithm analysis
  • quadratic time
    • n squared — Quadratic time means an algorithm has a runtime on the order of n squared. Bubble sort and insertion sort are standard examples of algorithms with this asymptotic complexity.
• Algorithms
  • Divide-and-conquer recurrences
    • Akra-Bazzi method — The Akra–Bazzi method generalizes the master theorem for divide-and-conquer recurrences with subproblems of unequal size. Its solution is expressed using an integral term and is useful when floor and ceiling effects can be ignored.
• Asymptotic notation

  • Big Theta — Big Theta is the asymptotic notation for a tight bound, describing functions that grow on the same order as a comparison function. It is the class of functions that are both big O and big Omega of that function.

  • O(n2) — Big-O of n squared describes quadratic running time, the growth rate of nested loops and many simple sorting algorithms such as insertion sort, selection sort, and bubble sort. It also matches the number of entries in an n by n matrix and the worst case of quicksort when partitions are maximally unbalanced.

• Asymptotics
  • asymptotic — Asymptotic is the adjective for behavior at infinity, such as asymptotic curves or asymptotically safe theories in physics. It also describes results in perturbation methods where terms or solutions approach a limit as a parameter goes to zero.
• Computational complexity
  • logarithmic time
    • big O of log n — Big O of log n is the logarithmic time complexity common to balanced binary search trees and binary heaps for operations such as search and insertion. It also describes the runtime of binary search because each step halves the search space.
  • subset sum problem
    • subset sum — The subset sum problem asks whether some subset of a set of numbers adds to a target value, often zero in the standard decision version. It is NP-complete and appears in cryptographic contexts such as Merkle-Hellman.
• computability theory
  • computable real numbers
    • computable numbers — Computable numbers are the real numbers that a finite terminating algorithm can approximate to any desired precision. They are closely tied to the outputs of Turing machines, and the class of all such numbers has important limitations in completeness arguments.
• Recursive functions
  • Ackermann function — The Ackermann function is a classic example of a total computable function that is not primitive recursive. It grows extremely quickly, appears in discussions of inverse functions such as alpha of n, and is often written in two-variable form A(m,n).
• Complexity theory
  • complexity classes
    • NP-intermediate — NP-intermediate is the class of problems in NP that are believed to be neither in P nor NP-complete. Graph isomorphism and integer factorization are common examples of suspected NP-intermediate problems.

Advanced Geometry and Analysis

Extend geometric and analytic ideas to more abstract settings.

Topology

• Topology — Topology is the branch of mathematics that studies properties preserved under continuous deformation, so a coffee cup and a donut can be treated as equivalent. It also studies spaces and manifolds through notions such as open and closed sets, including topological spaces like those used in the Zariski topology.

  • 3-sphere — The 3-sphere is the three-dimensional sphere, homeomorphic to the one-point compactification of Euclidean 3-space and the setting of the Poincaré conjecture. It is also the manifold of unit quaternions and is diffeomorphic to SU(2).

  • accumulation points
    • limit point — A point that can be approached by other points of a set; in analysis, every neighborhood of it intersects the set. It is also described as a point approached by infinitely many terms of a sequence, and bounded sequences are often studied via subsequences that converge to one.

  • Baire’s theorem — This theorem states that the real numbers cannot be written as a countable union of nowhere-dense sets. It is a central result in topology and functional analysis.

  • clopen — A clopen set is both closed and open in a topology. In a connected space, only the empty set and the whole space have this property, and in a discrete topology every set does.

  • closed — A closed set contains all of its limit points, and its complement is open. In topology and analysis, closedness appears in compactness, intervals with endpoints included, and algebraic structures such as closed forms and closed fields.

  • closed set — A closed set is a set that contains all of its limit points. Equivalently, it is the complement of an open set.

  • closed sets
    • closedness — Closedness is the topological property of a set whose complement is open. Closed sets contain the limits of their convergent sequences, and finite unions and arbitrary intersections of them remain closed.

  • compact — A compact space is one in which every open cover has a finite subcover, a property equivalent in Euclidean space to being closed and bounded. The term appears throughout topology and analysis, including the Heine-Borel theorem and Tychonoff’s theorem.

  • compactification — Compactification is the process of turning a topological space into one that is compact, often by adding points at infinity or forming spaces such as the Stone-Cech compactification. In string theory, the term also refers to curling extra dimensions into a smaller effective spacetime.

  • compactness — In topology, compactness is the property that every open cover has a finite subcover, and in metric spaces it coincides with sequential compactness. It appears in Heine-Borel for closed and bounded subsets of Euclidean space and in Tychonoff’s theorem for products. The same word also names the first-order logic theorem that every finitely satisfiable set of sentences is satisfiable.

    • Bolzano-Weierstrass Theorem — The Bolzano–Weierstrass theorem says every bounded sequence in Euclidean space has a convergent subsequence. It is closely tied to compactness, sequential compactness, and the Heine–Borel theorem.

    • Heine-Borel Theorem — The Heine-Borel theorem states that in Euclidean space, a set is compact if and only if it is closed and bounded. It is named for Eduard Heine and Émile Borel and is often proved using Bolzano-Weierstrass-type arguments. Prompts may frame it as a metric-space characterization of compactness.

    • Heine-Cantor theorem — The Heine-Cantor theorem says a continuous function on a compact metric space is uniformly continuous. It is a standard analysis result often paired with the intermediate value property, Stone-Weierstrass, and the general definition of continuity.

    • The Heine-Borel Theorem — The Heine-Borel theorem states that in Euclidean space, a set is compact if and only if it is closed and bounded. In the broader metric-space formulation, compactness can be characterized by completeness together with boundedness in the appropriate setting.

  • connected — Connected describes a topological space with no separation into disjoint clopen pieces, and in graph theory it means every pair of vertices is joined by a path. The term also appears in constructions such as connected sums and simply connected spaces.

  • connectedness — Connectedness is the topological property of having no separation into two disjoint open sets. It also appears for graphs and spaces where any two points can be joined by a path, with components as the associated maximal pieces.
    • Connected space — A connected space is a topological space that cannot be separated into two disjoint nonempty closed sets. Equivalently, it has no nontrivial subset that is both open and closed.
  • covering spaces
    • cover — A cover is a collection of sets whose union contains the whole space, and compactness is defined by the existence of a finite subcover for every open cover. In topology, a covering space is a space where each point has a neighborhood evenly covered by disjoint open sets mapped homeomorphically onto that neighborhood. Covering spaces have the unique lifting property, and a simply connected space can serve as a universal cover.
  • dense sets
    • dense — A dense set has closure equal to the whole space, so every point of the ambient space is a limit point or belongs to the set. The rationals are the standard example in the reals, and countable intersections of dense open sets remain dense in complete spaces by Baire category.
  • differential topology
    • Poincaré-Hopf theorem — The Poincaré-Hopf theorem states that the sum of the indices of the zeros of a vector field on a manifold equals the Euler characteristic. Its common illustration is the hairy ball theorem for the sphere.

  • Discrete topology — The discrete topology is the finest topology on a set, since every subset is open. It is induced by the metric in which distinct points are always distance one apart.

  • fiber bundles

    • fiber bundle — A fiber bundle is a topological structure that locally looks like a product of a base space and a typical fiber. Its standard examples are used to describe tangent bundles, and it is characterized by the homotopy lifting property.

    • Hopf fibration — The Hopf fibration is the classic fiber bundle from the 3-sphere to the 2-sphere with circle fibers. It is often visualized as nested tori and is named for Heinz Hopf.

  • fixed point theorems
    • Borsuk-Ulam theorem — The Borsuk-Ulam theorem says that some pair of antipodal points on a sphere must share the same value under a continuous map. It is a key topological result with consequences such as the ham sandwich theorem and the Brouwer fixed-point theorem.

  • Hausdorff space — A Hausdorff space, or T2 space, is a topological space in which any two distinct points have disjoint neighborhoods. Equivalent characterizations include that sequences converge to at most one point and that the diagonal is closed in the product space.

  • homeomorphism — A homeomorphism is a continuous bijection between topological spaces with a continuous inverse. Spaces that are homeomorphic can be deformed into one another without tearing or gluing, so they preserve topological properties such as genus and Euler characteristic; for example, a coffee cup and a donut are equivalent in topology. The term also appears in graph theory in connection with sequences of elementary subdivisions.

  • homotopy — Homotopy is the topological relation of one continuous map or space being continuously deformed into another. Clues often mention deformation retracts, the fundamental group, Whitehead’s theorem, and the torus-to-coffee-cup joke.
    • homotopies — A homotopy is a continuous deformation from one map to another, often written using a map from the product with the unit interval. Homotopy underlies the definition of the fundamental group and provides a weaker notion of equivalence than homeomorphism.

  • homotopy equivalence — Two spaces are homotopy equivalent when each can be continuously deformed into the other through maps whose composites are homotopic to the identity. This is the relation appearing in the generalized Poincaré conjecture, where an n-manifold with the same homotopy type as the n-sphere is asked to be homeomorphic to it.

  • Interior — In topology, the interior of a set consists of the points around which some open ball lies entirely inside the set. It is the largest open subset contained in that set and differs from the set itself precisely when the set is not open.

  • invariants

    • genus — Genus is the topological invariant that counts the number of holes or handles in a surface. It is zero for a sphere and one for a torus, and in graph theory it measures the minimum number of handles needed to draw a graph without crossings.

    • Topological invariants — Topological invariants are properties preserved under homeomorphism and used to distinguish spaces that are not the same up to deformation. Examples include homology and homotopy groups, the Euler characteristic, and various separation properties.

  • Jordan curve theorem — The Jordan curve theorem states that a simple closed curve in the plane separates the plane into an inside and an outside. Its deeper versions involve the Jordan-Schoenflies theorem, Alexander’s horned sphere, and formal proofs checked by computer.
    • Jordan’s theorem — Jordan’s theorem says a simple closed curve in the plane separates an inside from an outside. It is used in topology and graph-like problems to show that certain regions cannot be connected without crossing the curve.
  • Jordan curves
    • Jordan curve — A Jordan curve is a simple closed plane curve, topologically equivalent to a circle. Such curves divide the plane into an interior region and an exterior region, a fact used in results like Green’s theorem.
  • manifold conjectures
    • the Poincaré conjecture — The Poincaré conjecture says that every simply connected, closed manifold is homeomorphic to a sphere. Grigori Perelman proved the three-dimensional case using Ricci flow with surgery after earlier work by Richard Hamilton.
  • manifolds

    • long line — The long line, or long ray, is the classic non-second-countable one-dimensional manifold built from the first uncountable ordinal crossed with [0,1), and it is locally homeomorphic to the real line. It is sequentially compact but not compact, Lindelöf, paracompact, or metrizable.

    • smooth manifold — A smooth manifold is a topological space that is locally diffeomorphic to Euclidean space. The Möbius strip is a standard example of a manifold with boundary.

  • metric spaces — A metric space is a set equipped with a distance function satisfying nonnegativity, symmetry, the triangle inequality, and identity of indiscernibles. Normed vector spaces are metric spaces, and continuity can be generalized naturally on them.

    • complete — A complete metric space is one in which every Cauchy sequence converges to a point in the space. The term also appears in topology and analysis, where the real numbers are complete but the rationals are not.

    • metric — A metric is a distance function satisfying symmetry, nonnegativity, the triangle inequality, and zero only when the two points are the same. In geometry and relativity, the term also refers to a metric tensor, which encodes the line element and the signature of spacetime.

    • metrics — The suffix -metrics forms terms like econometrics and cliometrics, which apply quantitative methods to economics and history. Metrics also refers to the distance function in mathematics and physics, including the Minkowski metric and general metric spaces.

  • neighborhood — A neighborhood is the area around a point in math, and more informally it means an approximate range. It is also the word in titles like “Sweater Weather” by The Neighbourhood and “Freaking Out the Neighborhood.” It is the first kind of location named in several song titles, and it is the place where Mr. Rogers lived and worked.

  • nets — A net is also a generalization of a sequence in topology, indexed by a directed set instead of the natural numbers. Nets are used to describe convergence in spaces where ordinary sequences are not sufficient.

  • open set — An open set is a subset of a metric space in which every point has a neighborhood contained entirely in the set. In Euclidean terms, an open disk is the standard example because it excludes its boundary points.
    • open — An open set is one that contains none of its boundary points, and on the real line it is represented by intervals with round parentheses. The term also appears in topology, where open covers, open maps, and open sets help define compactness and continuity.

  • open sets — Open sets are subsets of a topological space in which every point is an interior point. They are closed under arbitrary unions, and a topology is built from them along with the empty set and the whole space.

  • openness — Openness is the topological property shared by open sets, which are closed under arbitrary unions and finite intersections. Open sets are the basic objects in definitions of continuity, manifolds, and interior points.

  • orientability — Orientability is the property of a surface or manifold that allows a consistent choice of normal direction, so the right-hand rule can be applied globally. The torus is orientable, while the Möbius strip and the projective plane are standard non-orientable examples.
    • orientable — A manifold is orientable when a consistent choice of local direction or basis can be made everywhere on it. The property fails for the Möbius strip and Klein bottle, but it is required for integration and for applying Stokes’ theorem on manifolds.

  • orientation — Orientation is the property of a rigid body or space that tracks direction, like yaw, pitch, and roll in flight or clockwise-versus-anticlockwise choices in topology. The term also appears in astronomy for the viewing angle of an active galactic nucleus, which helps distinguish objects like quasars and blazars, and in knot theory and linear algebra when discussing reversed handedness or the sign of a basis.

  • orientations — An orientation is a choice of consistent direction on a manifold or surface, such as distinguishing clockwise from counterclockwise. It is preserved by maps with positive Jacobian determinant and cannot exist on surfaces like the Klein bottle or Möbius band.

  • real projective plane — The real projective plane is a non-orientable surface with Euler characteristic 1. It can be described as the space of all lines through the origin in three-dimensional Euclidean space, or as a disk with antipodal boundary points identified.

  • separability — A topological space is separable if it has a countable dense subset, as the reals do through the rationals. In analysis and quantum theory, the term also appears in separable boundary conditions and in the distinction between separable and entangled states.
    • separable — A separable system is one whose wavefunction or variables can be split into independent parts, so in quantum mechanics it is the opposite of entanglement. In topology, a separable space has a countable dense subset, as in the real numbers or spaces of continuous functions on a compact interval.
  • Separation axioms

    • Hausdorff — A Hausdorff space is a topological space in which any two distinct points have disjoint neighborhoods. It is also called a T2 space, and in such spaces sequences can converge to at most one point.

    • Hausdorff spaces — Hausdorff spaces are topological spaces in which distinct points have disjoint neighborhoods, also called the T2 axiom. They are a standard separation condition in topology and appear in results such as Tietze extension and Arzelà–Ascoli.

  • surfaces

    • projective plane — The projective plane is a closed, nonorientable surface with Euler characteristic 1. It can be built by identifying antipodal points on the boundary of a disk, or described as a sphere with a crosscap attached.

    • sphere eversion — Sphere eversion is the topological process of turning a sphere inside out in three-dimensional space. It is associated with Stephen Smale and later visualized through methods such as Thurston’s corrugations and Boy’s surface.

  • topological manifolds — Topological manifolds are locally Euclidean spaces described by atlases of coordinate charts. They include surfaces in two dimensions, and famous examples include the spaces studied in the Whitney embedding theorem and the Poincaré conjecture.

  • topological properties
    • topological — Topological systems are those whose key properties are invariant under continuous deformation, including topological insulators with conducting surface states. The same adjective also describes Kitaev-style quantum computation with anyons, topological order, and related invariants such as Chern numbers and winding numbers.

  • topologies — A topology is a collection of open sets on a set, closed under arbitrary unions and finite intersections. Topological spaces provide the setting for notions such as continuity, convergence, and separation axioms like Hausdorff and normality.

  • torus — A doughnut-shaped surface of revolution formed by rotating a circle around an external axis; equivalently, the product of two circles. It has genus one and Euler characteristic zero, and its area and volume depend on the major and minor radii. A double torus has genus two. The torus is a standard example in topology, appears in map-coloring problems and KAM theory, and has applications in the study of compact Lie groups, maximal tori, and tokamak geometry.

  • Tychonoff’s theorem — Tychonoff’s theorem says that any product of compact topological spaces is compact. Its standard proof is often associated with the axiom of choice and is a staple result in general topology.

  • Urysohn’s Lemma — Urysohn’s Lemma is a basic result in topology about separating disjoint closed sets in a normal space by a continuous function. It is closely connected to the Tietze extension theorem and to Urysohn’s metrization theorem.
• topology of surfaces
  • Möbius strips — A Möbius strip is a one-sided surface made by giving a strip of paper a half twist and joining the ends. It is a favorite shape for mathematical and experimental literary structures because it creates a continuous loop with unusual topology.

• Topological space — a set X together with a collection of “open” subsets satisfying: the empty set and X are open; arbitrary unions of open sets are open; finite intersections of open sets are open; generalizes metric spaces and underpins all of modern topology.

• Compact space — a topological space where every open cover has a finite subcover; in ℝⁿ, equivalently, closed and bounded (Heine-Borel theorem); compactness guarantees continuity theorems and extreme value results.

• Simply connected — a space is simply connected if it is path-connected and every loop can be continuously contracted to a point (trivial fundamental group); the sphere S² is simply connected; the torus is not. A space is simply connected if every loop in it can be contracted to a point. Equivalently, its fundamental group is trivial.

• Möbius strip — a surface with only one side and one boundary edge, formed by giving a rectangular strip a half-twist and joining the ends; the canonical example of a non-orientable surface. It is also called a twisted cylinder, and it is a standard example in topology.

• Klein bottle — a closed non-orientable surface with no interior or exterior; cannot be embedded in 3D space without self-intersection; a 4D object; named for Felix Klein (1882). It can be described as a three-dimensional projection of a four-dimensional object. It has no boundary and is often described as an impossible container with only one continuous side. It is often contrasted with the Möbius strip, and it can be split into two Möbius strips.

• Euler characteristic — topological invariant χ = V − E + F for polyhedra (equals 2 for convex polyhedra); for surfaces χ = 2 − 2g where g is the number of handles (genus); central to the classification of surfaces. It is denoted by χ and can also be defined via homology or as the signed count of zeros of a generic vector field; related formulas appear in Gauss–Bonnet and Riemann–Hurwitz.
  • Euler number — The Euler number is a dimensionless ratio in fluid dynamics comparing pressure forces to inertial forces. In topology, the Euler characteristic is the invariant obtained from vertices plus faces minus edges, and it equals zero for a torus.

• Homeomorphism — a bijective continuous map with a continuous inverse; two spaces are topologically equivalent if homeomorphic (“rubber-sheet geometry”); e.g., a donut and a coffee cup are homeomorphic.

• Brouwer fixed-point theorem — every continuous function from a closed ball to itself has at least one fixed point; e.g., any stirred cup of coffee has at least one unmoved point; proved by L. E. J. Brouwer (~1911). It also applies to any continuous self-map of a compact convex set, not just a closed ball. The theorem underlies Sperner’s lemma, the KKM lemma, and several existence results in topology and economics.

• Hairy ball theorem — there is no everywhere-nonzero continuous tangent vector field on an even-dimensional sphere; colloquially: you cannot comb a hairy ball flat without a cowlick; a corollary is that there is always a point on Earth with zero horizontal wind. It is a consequence of the Poincaré–Hopf theorem and is commonly stated for the 2-sphere, though it applies to all even-dimensional spheres.

• Ham-sandwich theorem — for n measurable “ingredients” in ℝⁿ, there exists a single hyperplane that simultaneously bisects all n of them; proved using the Borsuk-Ulam theorem.

• Knot theory — studies mathematical knots (closed curves in 3D space) up to continuous deformation; key invariants include the Alexander polynomial, Jones polynomial (Vaughan Jones, 1984, Fields Medal 1990), and knot genus; the unknot is the trivial knot; the trefoil is the simplest non-trivial knot. Knot theory is the branch of topology that studies mathematical knots as embedded loops in three-dimensional space. Its invariants include the Alexander and Jones polynomials, which distinguish knots that can otherwise look similar.

  • crossing number — The crossing number of a knot is the number of double points in a diagram of that knot. In graph theory, a planar graph has crossing number zero, making the term a standard measure of edge intersections.

  • knot polynomials — Knot polynomials are algebraic invariants used to distinguish knots. Famous examples include the Alexander, Jones, and HOMFLY polynomials, and they arise in connections to skein relations and knot homology.

  • Knots — A knot is a closed embedding of a circle in three-dimensional space, studied via knot diagrams, Reidemeister moves, and invariants such as the Alexander and Jones polynomials. Common examples include the trefoil, the figure-eight knot, and the unknot; related objects are links, which consist of multiple knots. Other topics associated with knots include hyperbolic complements and Khovanov homology. The term also appears in quipus, which used knotted cords to record information.
    • knot — A knot is a closed, non-self-intersecting curve embedded in three-dimensional space. Knot theory studies structures such as the trefoil and figure-eight knot, along with polynomial invariants like the Jones and Alexander polynomials.

  • knots or links — Knots and links are embedded curves in three-dimensional space studied in topology. They can be represented by closed braids up to Markov moves, and include classes such as torus, satellite, and alternating knots.

  • links — Links are collections of one or more knots, studied through Reidemeister moves, polynomial invariants, and knot polynomials such as the Jones polynomial. In topology, a knot is an embedding of a circle in three-dimensional space, while a link generalizes this to multiple components.

  • Reidemeister moves — Reidemeister moves are the three local knot-diagram moves used to show that two knots are equivalent up to ambient isotopy. They consist of untwisting a loop, sliding one strand past another, and moving a strand over or under a crossing.

  • trefoil knot — The trefoil knot is the simplest nontrivial knot in knot theory and the unique prime knot with crossing number three. It is also known as the cloverleaf knot and appears in knot diagrams and stopper-knot lore.
• Algebraic topology — uses algebraic invariants (homotopy groups, homology groups, cohomology rings) to distinguish topological spaces; the fundamental group π₁ captures loops up to deformation; Henri Poincaré originated both homology and the conjecture bearing his name.

  • de Rham cohomology — De Rham cohomology is the cohomology theory of differential forms on smooth manifolds. It identifies classes of closed forms modulo exact forms and connects to singular homology through Stokes’s theorem.

  • fundamental groups — The fundamental group of a space is the set of homotopy classes of loops based at a point, with concatenation as the operation. It is commonly written pi-one and is central to covering space theory and the Seifert–Van Kampen theorem.

  • homology
    • homology groups — Homology groups are algebraic invariants of a topological space defined from chains, cycles, and boundaries. Their ranks are the Betti numbers, and the first homology group of a space is related to the abelianization of its fundamental group.
  • homotopy groups
    • fundamental group — The fundamental group is the first homotopy group, written pi-one, and it records classes of loops in a space up to deformation. It is trivial for simply connected spaces, and examples include the integers for a circle and a free group for a torus.

  • K-theory — K-theory is a generalized cohomology theory built from vector bundles. It appears in topology and geometry, and it has also been linked to D-brane charge classification in string theory.

  • Seifert-van Kampen theorem — The Seifert–van Kampen theorem computes the fundamental group of a space from a decomposition into overlapping path-connected subspaces. It is a standard tool for calculating fundamental groups by gluing simpler pieces together.
• differential topology

  • h-cobordism theorem — The h-cobordism theorem is Stephen Smale’s result describing when a high-dimensional manifold is diffeomorphic to a product with an interval. It is a central theorem in topology and has consequences for the high-dimensional Poincaré conjecture.

  • Whitney embedding theorem — The Whitney embedding theorem says every smooth n-manifold can be embedded in Euclidean space of sufficiently high dimension. A standard form of the result places a manifold in R to the 2n plus 1, and it underlies many later results in differential topology.

• local properties
  • local — Local is the adjective for properties that hold in a neighborhood, as in local minima, local rings, and locally Euclidean manifolds. It also appears in phrases like the local group of galaxies and the advice to act locally.
• annuli
  • annulus — An annulus is the region between two concentric circles, like a ring-shaped disk. It is also the geometric region used when describing holomorphic functions and Laurent series on a ring-shaped domain.
• fixed point theorems
  • fixed point theorem — A fixed point theorem guarantees a point that maps to itself under a function, as in statements of the form f(c) = c or F(x) = x. Named versions include the Brouwer and Kakutani fixed point theorems.
• fixed-point theory

  • fixed point — A fixed point is a value left unchanged by a function, so that f(x)=x. The concept appears throughout mathematics, from the Brouwer and Banach fixed point theorems to lattice theory and recursion results. Fixed points also underlie proofs in dynamical systems and logic, including the diagonal lemma used in Gödel’s incompleteness theorems. In analysis, contraction mappings and continuous self-maps of disks or balls are guaranteed to have one.

  • fixed points — Fixed points are values left unchanged by a function, so they satisfy f(x)=x and can be found where a graph meets the line y=x. Classic results about them include Brouwer’s fixed point theorem for maps of disks or balls into themselves, Banach’s contraction principle, and the Tarski-Knaster theorem for monotone maps on complete lattices.

• sphere packing
  • Kepler conjecture — Kepler’s conjecture is the sphere-packing claim that face-centered cubic packing is the densest arrangement of equal balls in three-dimensional Euclidean space. It was posed by Johannes Kepler and later attacked by methods involving Voronoi cells, decomposition stars, and computer verification in Thomas Hales’s Flyspeck project.

Projective and Differential Geometry

• Projective geometry — geometry of properties invariant under projection; parallel lines meet at a “point at infinity”; cross-ratio is the fundamental projective invariant; underpins perspective drawing and homogeneous coordinates in computer graphics. It also features a duality principle between points and lines, underlies Desargues’ theorem, and provides the language of projective planes.

  • Pascal’s Theorem — Pascal’s theorem states that if a hexagon is inscribed in a conic, the three intersections of opposite sides are collinear. It is a classical projective geometry result named for Blaise Pascal.

  • projective — Projective geometry studies properties preserved by perspective, including duality between points and lines and the behavior of parallel lines at infinity. The same adjective also describes projective transformations and psychoanalytic tests that elicit a subject’s projections.

  • projective space — Projective space is the space of lines through the origin, often described by homogeneous coordinates up to scalar multiple. Complex projective spaces have a Fubini-Study geometry and a cell decomposition with one cell in each even dimension.

• Riemannian geometry — generalizes Euclidean geometry to curved smooth manifolds equipped with a metric tensor; Bernhard Riemann introduced the framework in his 1854 Habilitation lecture; the mathematical language of Einstein’s general relativity.

• Gauss-Bonnet theorem — for a closed surface, ∫∫ K dA = 2π χ where K is the Gaussian curvature and χ is the Euler characteristic; connects local geometry (curvature) to global topology. It is a central bridge between differential geometry and topology, and the same principle extends through Chern-Weil theory to more general bundles.

• map projections
  • cylindrical projections
    • cylindrical projection — A cylindrical projection maps the globe onto a surface that can be slit and unrolled. The Mercator projection is the best-known example.

• coordinate transformations — Coordinate transformations relate one coordinate frame or basis to another, such as the Galilean transformations of classical mechanics. In tensor calculus, they are the rules that govern how components change under a change of coordinates or reference frame.

• differential geometry

  • Curvature and torsion — Curvature and torsion are the two standard local properties used to describe a curve. Curvature measures how quickly the unit tangent changes, while torsion measures the rate of change of the unit normal or the twisting of a space curve.

  • connections
    • Christoffel symbols — Christoffel symbols are the three-index connection coefficients derived from a metric that describe how basis vectors change from point to point. They are the coefficients of the Levi-Civita connection on a manifold with a metric, come in first- and second-kind forms, and are not tensors. They can be made to vanish at a point in normal coordinates, and are central in differential geometry and general relativity.

  • covariant derivative — The covariant derivative is the curvature-aware generalization of ordinary differentiation used in differential geometry and general relativity. It is written with a nabla and a semicolon in index notation, is compatible with the metric for the Levi-Civita connection, and vanishes on the metric itself. Its commutator produces the Riemann tensor, and contracting it with the stress-energy tensor gives zero by conservation.

  • curvature — Curvature measures deviation from being straight or flat, and in the plane it is the reciprocal of a circle’s radius. In differential geometry, Gaussian curvature is intrinsic and appears in the Gauss-Bonnet theorem, while sectional curvature and the Riemann tensor are other important forms. It also appears in mechanics, Ricci flow, and the Frenet formulas for space curves.
    • Theorema Egregium — Theorema Egregium is Gauss’s theorem that Gaussian curvature is determined entirely by the surface itself, not by how it is embedded in space. It implies curvature is preserved under local isometry and is one reason no map projection can preserve both area and angle perfectly.
  • curvature identities
    • Bianchi identities — The Bianchi identities are differential identities satisfied by the curvature tensor in differential geometry. In general relativity, they reduce the number of independent Einstein field equations.
  • differential forms — Differential forms are totally antisymmetric tensors used in de Rham cohomology and in generalized Stokes-type integration on manifolds. They are acted on by the exterior derivative, which raises degree by one, and they include familiar objects such as the differential dx.
    • exterior derivative — The exterior derivative is the differential operator d that takes p-forms to (p+1)-forms and satisfies d squared equals zero. It appears in Poincaré’s lemma and generalizes the gradient-like action on differential forms in manifold theory.

  • first fundamental form — The first fundamental form is the inner product on a surface’s tangent space that determines lengths and line elements. Its coefficients are used in curvature calculations and are often written in terms of the metric tensor.

  • Frenet-Serret formulas — The Frenet-Serret formulas describe the tangent, normal, and binormal vectors of a curve in terms of curvature and torsion. They are written with respect to arclength and are used to analyze the kinematics of a particle moving along a space curve.

  • Frenet–Serret frame
    • unit tangent vector — The unit tangent vector is the normalized derivative of a curve’s position vector with respect to its parameter. It is one of the Frenet–Serret vectors used to describe curvature and torsion along a differentiable curve.

  • Gaussian curvature — Gaussian curvature is the intrinsic curvature of a surface, equal to the product of its principal curvatures and independent of how the surface sits in three-dimensional space. Gauss established its intrinsic character in the Theorema Egregium, which says it is preserved under local isometry. In cosmology, K denotes the curvature term used to distinguish flat, open, and closed universes.

  • geodesic — A geodesic is the generalization of a straight line to curved spaces and the local shortest path on a surface, such as a great circle on a sphere. In general relativity, photons travel along null geodesics, and the term also appears in geometry for paths whose curvature vanishes in the appropriate sense.

  • Lie groups — Lie groups are smooth manifolds equipped with a compatible group structure, so their multiplication and inversion maps are differentiable. Examples include SO(n) and GL(n), and their study is closely tied to Lie algebras and the exponential map.
    • special unitary groups
      • SU(5) — SU(5) is the special unitary group of degree five, a rank-4 Lie group used in Georgi–Glashow grand unified models. It is notable as the smallest simple Lie group containing the Standard Model gauge group.
  • manifolds

    • Calabi-Yau — A Calabi-Yau manifold is a compact Kähler manifold with Ricci-flat metrics and trivial canonical bundle. In string theory, these manifolds are often proposed as the shape of extra compact dimensions.

    • differential manifolds — Differential manifolds are topological spaces that locally resemble Euclidean space. They provide the setting for the generalized Stokes theorem in differential geometry.

    • manifold — A manifold is a topological space built from coordinate charts whose overlaps are related by smooth transition functions with nonzero Jacobians. Manifolds are usually required to be Hausdorff and second countable, and they look locally Euclidean. Smooth manifolds support calculus and are used in geometry and physics. Important special cases include symplectic manifolds, which have Darboux coordinates and Darboux normal form, and Riemannian manifolds, which carry a metric tensor and are acted on by Ricci flow in the proof of the Poincaré conjecture. Manifolds also include Calabi-Yau spaces used in supersymmetry. Related results include the Whitney Embedding Theorem, Frobenius theorem, and de Rham theorem.

    • Riemannian manifold — A Riemannian manifold is a differentiable manifold equipped with an inner-product structure on each tangent space, so one can measure angles, lengths, and gradients. Its connected version is described by a minimizing geodesic metric, linking the concept to the geometry introduced by Riemann.

  • osculating plane — The osculating plane of a curve is the plane determined by the unit tangent and principal normal vectors. For a plane curve, it is the plane that contains the curve at the point of tangency.

  • Ricci curvature tensor — The Ricci curvature tensor is the contraction of the Riemann tensor and appears in the Einstein field equations alongside the metric and stress-energy tensor. Its vanishing characterizes flat or Ricci-flat situations, and Ricci flow is the namesake process used in the proof of the Poincaré conjecture.

  • Ricci flow — Ricci flow is a geometric evolution equation that smooths the metric of a Riemannian manifold, much like heat diffusion smooths temperature. Perelman used Ricci flow with surgery in his proof of the Poincaré conjecture, making it one of the central tools in modern geometric topology.

  • Ricci tensor — The Ricci tensor is the rank-2 contraction of the Riemann tensor and is denoted R with lower indices mu nu. It appears in Einstein manifolds, where it is proportional to the metric, and in the Einstein tensor, which subtracts off half the scalar curvature times the metric.

  • Smooth — Smooth is the adjective for functions or manifolds that are infinitely differentiable, often written C-infinity. In analysis and differential geometry, smooth maps underlie concepts like immersions and Sard’s lemma. The word also appears in topology and calculus when discussing objects with derivatives of all orders.

  • Smoothness — Smoothness is the property of a function or manifold having derivatives of every order, often written as C-infinity. The term also appears in geometry and topology for nonsingular varieties, smooth manifolds, and related regularity conditions. Smooth manifolds and smooth maps are central objects in differential geometry and analysis.

  • symplectic — Symplectic geometry studies smooth manifolds equipped with a closed, nondegenerate 2-form, the natural setting for Hamiltonian mechanics. Its standard form on R2n is the sum of dq_i wedge dp_i, and results such as Darboux’s theorem and Liouville–Arnold describe its structure.

  • symplectic geometry
    • symplectic manifold — A symplectic manifold is a smooth manifold equipped with a closed, nondegenerate 2-form, and it provides the phase space framework of classical mechanics. Hamiltonian functions, Darboux coordinates, and symplectic maps are all defined on this structure.

  • torsion — Torsion is the twisting of an object under a rotational load, with the restoring constant for a torsion spring tied to shear modulus and polar moment of inertia. It also names the geometric measure of how a space curve twists out of its osculating plane, and in biology it describes the 180-degree rotation of a gastropod’s body during development.

  • evolute — The evolute of a curve is the envelope of its normals, or equivalently the locus of its centers of curvature. It can also be described as the locus of the centers of the curve’s osculating circles.
• Twistor theory
  • Twistor — Twistors are mathematical constructions introduced by Roger Penrose and later linked to ideas in theoretical physics. They are associated with spinors and have appeared in work on gauge-theory scattering amplitudes.
• manifolds

  • Calabi-Yau Manifold — A Calabi-Yau manifold is a complex Kähler manifold used in string theory to model extra dimensions of spacetime. These spaces often arise from smoothing orbifolds and are discussed in connection with harmonic spinors.

  • Calabi-Yau spaces — Calabi-Yau spaces are the compact higher-dimensional manifolds often invoked in string theory. They are used to describe how extra dimensions can be curled up at very small scales.

• Surfaces
  • Bohemian dome — A Bohemian dome is a geometric surface described by a parametric form involving rotating circles in perpendicular planes. Its equation uses trigonometric coordinates with parameters such as a, b, and c.
• conformal geometry
  • conformal — Conformal transformations preserve angles and are central to conformal geometry, conformal field theory, and conformal bootstrap methods. They appear in the Poincaré disk model, the Weyl tensor, and the infinite-dimensional symmetry of two-dimensional Virasoro theory.

Non-Euclidean and Analytic Geometry

• Hyperbolic geometry — Lobachevsky and Bolyai (independently, 1820s–1830s) developed a consistent geometry where parallel postulate fails and triangles have angle sums less than 180°. It is the non-Euclidean system with negative curvature and can be modeled by the upper half plane or by surfaces like the pseudosphere.
  • hyperbolic — Hyperbolic describes geometry of constant negative curvature, including the Poincaré disk model and triangles with angle sums under 180 degrees. The word also appears in hyperbolic functions such as sinh and cosh and in the graph of a hyperbola.
• Spherical geometry — great circles are “straight lines”; no parallel lines exist; triangles have angle sums greater than 180°. It is the geometry of the surface of a sphere.

  • a great circle — A great circle is the shortest path between two points on a sphere, and its arcs appear as straight lines in a gnomonic projection. Geodesic routes on the globe are often described using this concept.

  • antipodes — Antipodes are diametrically opposite points on a sphere, such as the North and South Poles. In spherical geometry, they are the pair of points where distinct lines can intersect only if the points are not antipodal.

  • Great Circles — Great circles are circles on a sphere with the same center and diameter as the sphere itself. They are the spherical analogue of straight lines and divide a sphere into two equal hemispheres.

• Conic sections — curves from slicing a double cone: circle, ellipse, parabola, hyperbola. Standard forms expressible as quadratic equations in x and y. They are foundational objects in analytic and projective geometry and appear in classical results such as Pascal’s theorem.

  • a hyperbola — A hyperbola is the conic section defined as the set of points whose distances from two fixed points have a constant difference. It is one of the standard conic sections alongside the ellipse, parabola, and circle.

  • directrix — The directrix is the fixed line used with a focus to define conic sections such as parabolas and hyperbolas. For a parabola, the vertex lies midway between the focus and the directrix, and the line is perpendicular to the axis of symmetry.

  • directrix / latus rectum — In conic sections, the directrix is the fixed line used together with a focus to define a parabola or related curve. The latus rectum is the chord through the focus perpendicular to the axis of symmetry.

  • ellipses — An ellipse is the oval-shaped conic section defined by the constant sum of distances from two foci. Clues may mention planetary orbits, the parametric equations x equals a cosine t and y equals b sine t, or the ellipse as a Lissajous figure with equal frequencies and zero phase shift.
    • elliptical — Elliptical describes a shape like an ellipse, often contrasted with the parabolic path suggested by simple projectile motion. It is also a common galaxy morphology, as in large elliptical galaxies.

  • foci — The foci are the two fixed points of an ellipse, defined by the property that the sum of the distances from them to any point on the ellipse is constant. They are also used to describe conic sections more generally, since the distance from the center to a focus determines eccentricity.

  • hyperbola — A hyperbola is a conic section formed by slicing both halves of a double cone, with two branches and eccentricity greater than one. It appears in equations like y = 1/x, in the wave equation’s classification as a hyperbolic PDE, and in geometry through hyperbolic space and related saddle-like curvature.

    • 9y2-16x2=144 — This equation, 9y² minus 16x² equals 144, represents a hyperbola. In standard conic-section form, the opposite signs on the squared terms identify the curve.

    • y = 4/5 x or y = -4/5 x — These are the asymptotes of the hyperbola x^2/25 - y^2/16 = 1. Both lines pass through the origin and have slopes 4/5 and -4/5.

  • hyperbolae — Hyperbolae are conic sections with two disconnected branches and eccentricity greater than one. Their standard equation uses a difference of squared terms, and the hyperbolic trigonometric functions are built from them.

  • hyperbolas — A hyperbola is a conic section with two separate branches and eccentricity greater than one. Its graph can appear as y = 1/x, and its three-dimensional analogues are hyperboloids of one or two sheets. Hyperbolic geometry, named for the shape, has triangle angle sums less than 180 degrees and negative curvature.

  • latus rectum — The latus rectum is a focal chord of a conic section passing through a focus and parallel to the directrix or conjugate axis. Its length is a standard clue for parabolas, hyperbolas, and ellipses.

  • Parabola — A parabola is the conic section formed by slicing a cone parallel to one of its sides, with eccentricity 1. It is the set of points equidistant from a focus and a directrix, and its graph is the familiar U-shaped curve of a quadratic function. Parabolic motion appears in projectile motion under uniform gravity and in idealized escape orbits; the term also appears in parabolic reflectors and parabolic differential equations.
    • y equals 4 x squared minus 8 x minus 5 — This is the equation obtained after eliminating the parameter from x = t/2 and y = t^2 - 4t - 5. Substituting t = 2x produces the parabola y = 4x^2 - 8x - 5.

  • parabolic — Parabolic shapes appear in projectile motion, reflective mirrors, satellite escape trajectories, and the motion of a charged particle in a uniform field. In geometry and physics, the term also covers the parabola and paraboloid.

  • Vertices of x^2/49 - y^2/64 = 1 — The hyperbola x^2/49 - y^2/64 = 1 has vertices at (7, 0) and (-7, 0).

• Vectors in ℝⁿ — quantities with magnitude and direction; dot product u·v =

  u

  v

  cos θ gives the projection; cross product u×v (in ℝ³) gives a perpendicular vector of magnitude

  u

  v

  sin θ.

• John Playfair — John Playfair was a Scottish mathematician and geologist associated with a formulation of Euclid’s parallel postulate. He also published Illustrations of the Huttonian Theory of the Earth, helping establish uniformitarian geology. His name is attached to the version of the parallel postulate asserting a unique parallel through a point outside a line.

• Metric geometry

  • Euclidean distance — Euclidean distance is the straight-line distance between two points, given in two dimensions by the square root of the sum of squared coordinate differences. It is the standard metric behind nearest-neighbor methods and many coding and geometry applications.

  • taxicab geometry — Taxicab geometry measures distance by moving along perpendicular grid lines, so the distance between two points is the sum of coordinate differences. It is also called Manhattan or city-block geometry, and its circles look like rotated squares.

• algebraic curves
  • Folium of Descartes — The folium of Descartes is the plane curve defined by x^3 + y^3 = 3axy. It is a classic algebraic curve first described in the 1630s and is also known as a noeud de ruban.
• quadric surfaces
  • hyperbolic paraboloid — A hyperbolic paraboloid is a saddle-shaped surface given by a quadratic equation with one positive and one negative term. It is often used to visualize hyperbolic geometry and negative curvature.
• polar curves

  • limacon — A limacon is a polar curve, also called Pascal’s snail, whose equations often take the form r = a + b cos θ or r = a + b sin θ. It is a special case of the Cartesian oval and is recognizable in problems about the shape traced by reflected light in a cup.

  • Spiral of Archimedes — The spiral of Archimedes is a polar curve given by r = aθ. It is sometimes used in geometry problems involving angle trisection or constructions around a circle.

  • limacon of Pascal — A limacon of Pascal is a polar curve of the form r = a + b cos θ, and a cardioid is a special case. It is a classic curve studied in analytic geometry.

• cycloid
  • Inverted cycloid — An inverted cycloid is the curve whose shape is the mirror image of a cycloid traced by a point on a rolling circle. It is also known as a tautochrone and a brachistochrone because it gives the same or the fastest descent time under gravity.
• cycloids
  • hypocycloids
    • Hypocycloid — A hypocycloid is the curve traced by a point on a circle rolling inside the circumference of a larger fixed circle. It is one of the standard cycloids defined by rolling-circle motion.

  • curtate cycloid — A curtate cycloid is a variant of the cycloid in which the tracing point lies inside the rolling circle. This creates loops that dip below the baseline and move briefly opposite the rolling direction.

  • Simple cycloid — A simple cycloid is the curve traced by a point on the rim of a circle as the circle rolls along a straight line. It is a standard example of a cycloid generated by rolling motion.

  • Tautochrone — A tautochrone is a curve on which a falling body reaches the bottom in the same time from any starting point. The classic example is the cycloid, which Huygens studied in connection with pendulum motion.
• hyperbola asymptotes
  • 2/3 and -2/3 — These are the slopes of the asymptotes of the hyperbola y^2/4 - x^2/9. The slopes are 2/3 and -2/3.
• ellipse area
  • six pi — Six pi is the area of the ellipse x^2/9 + y^2/4 = 1, since an ellipse with semiaxes 3 and 2 has area 6π. The same value appears in a diffusion relation connected to viscosity, radius, temperature, and Boltzmann’s constant.
• Parabolic reflectors
  • 12 inches — A 2-foot diameter gives a radius of 12 inches, which is the focal length in the parabolic reflector example. The other prompts are straightforward geometry facts built around diameters, polygon sides, and trapezoid areas.

Analysis and Numerical Methods

• Real analysis — rigorous study of the real number line, limits, continuity, differentiability, and Riemann/Lebesgue integration; key figures: Cauchy (epsilon-delta definitions), Weierstrass (pathological functions), Riemann (integration), Lebesgue (measure theory).
  • approximation theorems
    • Stone-Weierstrass theorem — The Stone-Weierstrass theorem says that continuous functions on suitable compact spaces can be approximated uniformly by functions from certain subalgebras. Its classical special case is the Weierstrass approximation theorem for polynomials on an interval.

  • Dirichlet function — The Dirichlet function assigns 1 to rational inputs and 0 to irrational inputs, so it is nowhere continuous and has no Riemann integral. It is still Lebesgue integrable, and it is also called the indicator or characteristic function of the rationals.

  • extreme value theorem — The extreme value theorem says a continuous function on a closed, bounded interval attains both a maximum and a minimum. It is a basic compactness result in real analysis and is often used in proofs of Rolle’s theorem and the fundamental theorem of calculus.

  • Intervals
    • closed intervals — Closed intervals are sets of real numbers that include their endpoints, usually written with square brackets. They are compact and connected subsets of the reals, which is why they appear in the mean value theorem and Darboux-style arguments.
  • Weierstrass function — The Weierstrass function is the classic pathological example of a function that is continuous everywhere but differentiable nowhere. It is named for Karl Weierstrass and is often introduced as one of the monsters of real analysis, with a graph of fractal-like roughness.

• Lebesgue measure and integration — Henri Lebesgue (1902) extended Riemann integration to a far broader class of functions by measuring sets rather than partitioning intervals; the Lebesgue integral handles pointwise limits and is foundational to functional analysis and probability.

• Measure theory — the axiomatic study of “size” for sets; a measure μ assigns non-negative numbers to measurable sets satisfying countable additivity; underpins probability theory (probability measures) and integration.

  • Banach-Tarski theorem — The Banach-Tarski theorem says a solid sphere can be split into finitely many pieces and reassembled into two spheres of the same size. It is a famous paradoxical result in measure theory associated with the axiom of choice.

  • convergence theorems
    • Fatou’s lemma — Fatou’s lemma gives an inequality relating the integral of the limit inferior of nonnegative measurable functions to the limit inferior of their integrals. It is a standard tool in measure theory and appears in proofs involving convergence theorems.

  • Lebesgue measurable — Lebesgue measurable sets are those to which the standard measure on the real line can be applied. The Solovay model shows that, after dropping the axiom of choice, every subset of the reals can have this property.

  • Lebesgue measure — Lebesgue measure is the standard notion of size on subsets of Euclidean space, extending length, area, and volume. It is translation-invariant and countably additive on a sigma-algebra, and it underlies Lebesgue integration as well as the treatment of sets like the Cantor set.

  • Lebesgue’s dominated convergence theorem — Lebesgue’s dominated convergence theorem allows limits to pass through integrals when measurable functions are dominated by an integrable bound. It is a standard result in Lebesgue integration and is often paired with monotone convergence and Fatou’s lemma.

  • measure — A measure is a countably additive set function on a sigma-algebra that assigns size to sets, such as length, area, volume, or probability. It is the mathematical notion of size used in analysis. Lebesgue measure is the best-known example, and it underlies the Lebesgue integral and the Riesz representation theorem for integration against measures. Other examples include Haar measure, Carathéodory extension, Radon-Nikodym derivatives, and fuzzy measures such as the Sugeno measure.

  • Radon-Nikodym theorem — The Radon–Nikodym theorem gives conditions under which one measure absolutely continuous with respect to another has a density function. It is used in probability and financial mathematics to define conditional expectation and change measures under risk neutrality.

  • sigma algebra — A sigma-algebra is a collection of sets closed under complements and countable unions, and it is the basic structure used to define measurable spaces. Borel sets and Lebesgue measurable sets are standard examples of sigma-algebras.

  • Vitali sets — Vitali sets are subsets of the interval [0,1] constructed by choosing one representative from each rational-equivalence class of the real numbers. They are a standard example of a non-Lebesgue-measurable set.

• Metric space — a set X with a distance function d(x,y) satisfying non-negativity, symmetry, and the triangle inequality; convergence, continuity, and completeness generalize naturally to metric spaces. It also satisfies the identity of indiscernibles, and this structure induces a natural topology.

• Banach space — a complete normed vector space (every Cauchy sequence converges); e.g., Lᵖ spaces; the Hahn-Banach theorem extends linear functionals and is fundamental in functional analysis. Examples include finite-dimensional Euclidean spaces. Every Hilbert space is a Banach space, but not every Banach space comes from an inner product.

• Hilbert space — a complete inner product space; the infinite-dimensional analogue of Euclidean space; central to quantum mechanics (state vectors are elements of a Hilbert space) and Fourier analysis; named for David Hilbert. It supports results such as Parseval’s identity.

• Complex analysis — study of functions of a complex variable; holomorphic functions obey the Cauchy-Riemann equations; Cauchy’s integral theorem states that the integral of an analytic function over a closed contour is zero; residue theorem enables evaluation of many real integrals.

  • 1 + 1/z + 1/(2z^2) + 1/(6z^3) — This is the Laurent expansion of e^(1/z) about z = 0. Its first terms are 1 + 1/z + 1/(2z^2) + 1/(6z^3), matching the exponential series in powers of 1/z.

  • 2 pi i — The quantity 2πi appears as the constant in Cauchy’s integral formula and as the integral of 1/z around a closed loop enclosing a simple pole. It is the product of the circle’s radian measure and the imaginary unit, a standard complex-analysis constant.

  • analytic continuation — Analytic continuation extends the domain of a complex-differentiable function beyond its original circle of convergence. It is used to extend the Riemann zeta function and other functions into regions where their defining series do not converge.

  • Cauchy residue theorem — The Cauchy residue theorem evaluates a contour integral by summing the residues, weighted by winding number, of the poles enclosed by the contour. It generalizes Cauchy’s theorem and is central to complex analysis.

  • Cauchy-Riemann — The Cauchy-Riemann equations are the conditions a complex-valued function must satisfy for differentiability, and hence analyticity, at a point.

  • Cauchy’s integral theorem — States that the contour integral of a holomorphic function around a closed curve is zero, equivalently that the integral vanishes on a simple closed contour when the function is analytic on and inside it. It is a foundational result in complex analysis and underlies results such as Cauchy’s integral formula, Morera’s theorem, and the residue theorem.

  • conformal mapping — Conformal mapping is a complex-analysis technique that preserves angles and local orientation. It is used to turn difficult boundary-value problems in electrostatics and fluid mechanics into easier problems on simpler geometries.

  • Conformal mappings — Conformal mappings are bijective transformations that preserve angles locally in complex analysis. They are a central tool for studying geometric structure through holomorphic functions.

  • conformal maps — Conformal maps are angle-preserving functions, including biholomorphic maps between simply connected regions of the complex plane and the unit disk. Liouville’s theorem limits such maps in higher-dimensional Euclidean space, and the Riemann mapping theorem guarantees them in the plane.
    • conformal map — A conformal map is a function that preserves angles locally, with a Jacobian that is a scalar times a rotation matrix. These maps include biholomorphic equivalences in the complex plane and appear in transformations that simplify two-cylinder electrostatics problems.
  • Elliptic functions
    • elliptic — In mathematics, elliptic functions are meromorphic and doubly periodic, and elliptic curves were central to Wiles’s proof of Fermat’s Last Theorem. The adjective also appears in elliptic Möbius transformations and in elliptic integrals.
  • entire functions
    • entire — An entire function is a complex function that is holomorphic everywhere on the complex plane. Such functions obey results like Liouville’s theorem and the Hadamard factorization theorem, and a nonconstant one can omit at most one value by Picard’s theorem.

  • essential singularity — An essential singularity is a point where a holomorphic function’s Laurent series has infinitely many negative-power terms. Near such a point, the function exhibits extreme behavior, as in the classic example e to the one-over-z.

  • Holomorphic functions — Holomorphic functions are complex-valued functions differentiable throughout an open domain. They satisfy the Cauchy-Riemann equations, are equivalent to analytic functions, and agree with their Taylor series in a neighborhood of each point. They are central objects in complex analysis and obey major results such as Cauchy’s theorem, Liouville’s theorem, Morera’s theorem, and Runge’s theorem.

    • analytic — A function is analytic, or holomorphic, if it is complex differentiable on a neighborhood of each point in its domain. In complex analysis, such functions are equivalent to those representable locally by a convergent power series or Taylor series, are infinitely differentiable, and satisfy the Cauchy-Riemann equations; the Cauchy integral formula underlies many of their consequences. Entire functions are holomorphic on all of complex space. Smooth functions such as bump functions need not be analytic.

    • analyticity — Analyticity, or holomorphicity, is the property of being complex differentiable. A holomorphic function satisfies the Cauchy-Riemann equations and can be expanded in a Laurent or Taylor series locally. Liouville’s theorem, Morera’s theorem, and the contrast with analytic truths versus synthetic truths are all standard clues.

    • complex differentiable — A complex function is complex differentiable when it has a derivative in the complex sense, equivalently when it is holomorphic. The Cauchy-Riemann equations give the condition for this property in terms of the real and imaginary parts of the function.

  • integral formulas
    • Cauchy’s integral formula — Cauchy’s integral formula says the value of a holomorphic function at an interior point can be recovered from an integral over a surrounding curve. It also extends to formulas for higher derivatives of analytic functions.
  • meromorphic functions
    • meromorphic — A meromorphic function is complex-differentiable except at isolated poles. Such functions can be written as ratios of holomorphic functions, and the residue theorem applies to them.

  • Morera’s theorem — Morera’s theorem is a converse-style result in complex analysis: if a continuous function has zero integral around every closed contour in a region, then it is analytic there. It is often paired with the Cauchy integral theorem and the Cauchy-Riemann equations.

  • poles
    • pole — A pole is a point where a complex function diverges and has a Laurent expansion with finitely many nonzero principal-part terms. The word also names an old English unit of area equal to a square rod.

  • residue — A residue is the coefficient of the negative-first term in a Laurent series, and the residue theorem relates contour integrals to sums of residues. The same word is also used in chemistry for the portion of a molecule left after a reaction or polymerization.

  • residue theorem
    • Cauchy’s residue theorem — Cauchy’s residue theorem evaluates a contour integral by summing the residues of the poles enclosed by the contour. It is a standard tool for computing complex integrals and extracting Laurent-series information from isolated singularities.

  • residues — A residue is the coefficient of the one-over term in a Laurent expansion about a singularity, and it can also be found by a contour integral around a pole. Cauchy’s residue theorem says a closed contour integral equals 2πi times the sum of the residues of the poles inside the curve.

  • Riemann sphere — The Riemann sphere is the one-point compactification of the complex plane, with infinity placed at the north pole under stereographic projection. It provides the standard geometric model for Möbius transformations of the extended complex plane.

  • Riemann surfaces — Riemann surfaces are connected one-dimensional complex manifolds that organize multi-valued analytic functions by gluing sheets together. They are central to uniformization, Hurwitz’s theorem, and the study of complex logarithms and moduli spaces.
    • Riemannian surface — A Riemann surface is a connected complex manifold that lets multi-valued functions such as the logarithm be treated as single-valued locally. These surfaces are named for Bernhard Riemann, who also gives his name to the Riemann sum.

  • Rouché’s theorem — Rouché’s theorem is a result in complex analysis about counting zeros of analytic functions inside a contour. If

    f(z)

    exceeds

    g(z)

    on a simple closed curve, then f and f+g have the same number of zeros inside the curve.

  • series expansions
    • Laurent series — A Laurent series is the complex analogue of a Taylor series that allows negative powers of z around a point. It is used for holomorphic functions in an annulus, and the coefficient of z to the minus one term is the residue at the singularity.
      • Laurent — A Laurent series expands a function analytic near a point as powers of z minus that point, allowing negative exponents. The name also appears as a character in Breaking Dawn, but that clue conflicts with the mathematical answer and should be treated as an unrelated namesake.
  • winding number — The winding number counts how many times a curve circles a point. In the residue theorem, residues are multiplied by this factor, and Cauchy’s theorem gives zero when the contour encloses no singularities in a simply connected region.

• Riemann mapping theorem — any simply connected proper open subset of ℂ is conformally equivalent (biholomorphic) to the open unit disk; a cornerstone of complex analysis. The corresponding analytic map is unique up to a normalization such as the derivative at one point. It is often proved using the Schwarz lemma or Dirichlet’s principle.

• Cauchy–Riemann equations — for f(z) = u(x,y) + iv(x,y), complex differentiability requires uₓ = vᵧ and uᵧ = −vₓ. If u and v have continuous first partial derivatives on an open region and satisfy these equations there, f is holomorphic there. Equations at a single point, without regularity assumptions, are insufficient.¹⁵

• analysis — Analysis is the branch of mathematics concerned with rigorous limits, series, and functions, with real and complex subfields. It is also the name of the analytic philosophical tradition often contrasted with continental philosophy.
  • approximation theorems
    • Weierstrass approximation theorem — The Weierstrass approximation theorem says that continuous functions on a closed interval can be uniformly approximated by polynomials. Its broader generalization is the Stone–Weierstrass theorem, which extends the idea to suitable subalgebras of continuous functions.
  • Convergence — Convergence is the property of a sequence or series approaching a limit. A sequence or series is convergent when it approaches a finite limit. It appears in forms such as uniform convergence, convergence in probability, and absolute convergence, and is contrasted with divergence in many standard tests. The term also appears in numerical analysis for methods with vanishing error as step size shrinks, and in convergence tests that determine whether a series like the alternating harmonic series approaches a sum.

    • Augustin-Louis Cauchy (“ko-SHEE”) — Augustin-Louis Cauchy was a French mathematician whose name appears in the Cauchy criterion for convergence and in the Cauchy-Schwarz inequality. In analysis, complete metric spaces are often defined by the convergence of Cauchy sequences.

    • uniform convergence — Uniform convergence is the strong form of convergence in which the same bound on error works for every point in the domain. It implies pointwise convergence, preserves continuity for limits of continuous functions, and is central to tests like the Weierstrass M-test.

  • convergence and divergence
    • divergent — Divergent is Veronica Roth’s dystopian novel set in faction-divided Chicago. More generally, divergent describes a sequence or series that does not converge to a finite limit.

  • Convolution — Convolution is a binary operation on functions that measures their overlap as one is shifted over the other. It underlies linear time-invariant systems and image filtering, and its Fourier transform property turns convolution into multiplication in the frequency domain.

  • differential operators
    • the Laplacian — This differential operator is the sum of the second spatial partial derivatives in Cartesian coordinates and is commonly written as del squared. It is equal to the divergence of the gradient, and in one variable-free form it is the trace of the Hessian.
  • epsilon-delta notation
    • epsilon — Epsilon is the Greek letter commonly used for an arbitrarily small quantity in calculus and for the empty string in computer science. It also appears in limits, epsilon-delta definitions, and some notation for permittivity and automata transitions.
  • harmonic concepts
    • harmonic — In mathematics and physics, harmonic objects include harmonic functions, harmonic series, spherical harmonics, and simple harmonic motion. The term also appears in analysis of waves, overtones, and averaging, especially in the harmonic mean and the divergent series of reciprocals.

  • Henri Lebesgue — Henri Lebesgue was a French mathematician best known for the Lebesgue integral and Lebesgue measure. He developed Lebesgue integration, which generalizes the Riemann integral by measuring the size of level sets rather than slicing the domain into intervals, and his ideas are central to modern analysis.

  • integral transforms
    • Hilbert transform — The Hilbert transform is a convolution operator given by a function convolved with one over pi t. It appears in contexts such as the Kramers-Kronig relations and single-sideband modulation.

  • Joseph Liouville — Joseph Liouville was a French mathematician known for the Liouville theorem, the Liouville-Sturm theory, and his work on transcendental numbers. His name is also attached to a theorem in Hamiltonian mechanics and to the proof that every bounded entire function is constant.

  • Lipschitz continuity — Lipschitz continuity is the condition that a function’s change in output is bounded by a constant times the change in input. It strengthens ordinary continuity and is used in results such as Picard’s existence and uniqueness theorem for differential equations.

  • Orthogonal polynomials
    • Legendre polynomials — Legendre polynomials are the orthogonal polynomials that arise in spherical coordinates, including in solutions of Laplace’s equation and central-potential scattering. They also appear in the Rodrigues formula and in the construction of spherical harmonics and related multipole expansions.
      • Olinde Rodrigues — Olinde Rodrigues was a nineteenth-century French mathematician remembered for Rodrigues’s formula, which generates Legendre polynomials. His name also appears in the Euler–Rodrigues parameters and the rotation formula used in axis-angle rotations.
  • power series — A power series is an infinite sum used to represent functions as coefficients times powers of a variable. Taylor and Maclaurin series are the standard examples, and Laurent series extend the idea to allow negative powers near singularities.

    • Maclaurin series — A Maclaurin series is the Taylor series of a function about zero. It expands a function into powers of x using derivatives at the origin, and standard examples include the series for e^x, sin x, and cos x.

    • radius of convergence — The radius of convergence is the distance from the center of a power series’s expansion point within which the series converges. It can be found by the ratio test, and the Cauchy-Hadamard theorem gives it in terms of the coefficient sequence.

  • special functions

    • Hermite functions — Hermite functions are the eigenfunctions of the Fourier transform. They are distinct from Hermite polynomials, though the two are closely related.

    • spherical harmonics — Spherical harmonics are the angular eigenfunctions of Laplace’s equation in spherical coordinates, usually written as Y_lm. They describe the angular part of the hydrogen atom and appear in spin-weighted and solid-harmonic generalizations.

  • step functions — Step functions jump between constant values, often between 0 and 1, and the Heaviside step function is their classic example. In engineering, the derivative of a step function is a Dirac delta, and the response to a step input is a step response.

    • Heaviside function — The Heaviside function is a discontinuous step function named for Oliver Heaviside. It models an abrupt change from off to on and appears frequently in physics and signal processing.

    • Heaviside step function — The Heaviside step function, also called the unit step function or theta, is 0 for negative inputs and 1 for positive inputs, with a jump at the origin. It is commonly described as the antiderivative of the Dirac delta function and its derivative as the Dirac delta function. It is widely used in signal processing, Green’s functions, and quantum mechanics to enforce causality and model step potentials.

  • summation — Summation is the mathematical operation of adding terms together, often denoted by a capital sigma. It appears in contexts ranging from tensor notation and the Einstein summation convention to vector and series computations. Related clues mention summing series by methods such as Borel, Abel, and Cesàro summation, and visualizing vector addition with the parallelogram rule.
    • The sum from x = 1 to x = 101, of the cosine of pi x. — The sum is alternating between 1 and -1 because cosine of pi times an integer is (-1)^x. Since there are 101 terms starting at x = 1, the total is -1.
  • uniform — Uniform describes distributions or convergence with equal treatment across values, as in the uniform distribution and uniform continuity. It also appears in analysis through the uniform boundedness principle and in hashing when values are spread evenly.
• boundedness — Boundedness is the property of being limited by some finite bound, as for functions on compact domains or operators whose norm ratio stays finite. It appears in the bounded convergence theorem, Liouville’s theorem for entire functions, and the definition of bounded linear and nonlinear operators.
  • bounded — In analysis and functional analysis, a set or function is bounded if its values stay below some finite upper or lower limit, and related notions include total boundedness for metric spaces. The term also appears in results such as Liouville’s theorem and in the fact that closed, bounded subsets of Euclidean space are compact.
• Orthogonal polynomials

  • Chebyshev polynomials — Chebyshev polynomials are an important family of orthogonal polynomials defined by T_n(cos θ)=cos(nθ). They appear in approximation theory and quadrature, where they help control Runge’s phenomenon and are connected to the Chebyshev inequality.

  • Hermite polynomials — Hermite polynomials are orthogonal polynomials that appear in the quantum harmonic oscillator and in finite-element interpolation when nodal values and derivatives are specified. They are defined with an $e^{-x^2}$ weight and are often written in terms of derivatives of that Gaussian. They are named after Charles Hermite and are commonly denoted H_n. The n-th Hermite polynomial is associated with the wavefunctions of the one-dimensional harmonic oscillator.

  • Laguerre polynomials — Laguerre polynomials are orthogonal polynomials that solve a standard second-order differential equation and appear in the hydrogen atom. They are also tied to the radial wavefunctions of quantum mechanics and to the Rodrigues formula.

  • Zernike polynomials — Zernike polynomials are orthogonal polynomials on the unit circle used to describe optical aberrations. They are commonly used in wavefront analysis for effects such as defocus and astigmatism.

  • associated Laguerre polynomials — Associated Laguerre polynomials appear in the radial solutions of the hydrogen atom in quantum mechanics. They are defined by Rodrigues-type formulas and arise alongside an exponential factor, a power term, and spherical harmonics in the hydrogenic wavefunctions.

  • Chebyshev polynomials of the first kind — The Chebyshev polynomials of the first kind are the orthogonal polynomials defined by T_n(cos θ)=cos(nθ). They are used in approximation theory and are often invoked in discussions of interpolation points that reduce Runge’s phenomenon.

• Harmonic analysis
  • wavelet transform — A wavelet transform analyzes signals using basis functions localized in both time or space and frequency. It is especially useful for nonstationary data, and the Haar and Morlet wavelets are standard examples.
• completeness — Completeness is a broad mathematical and logical property describing the absence of gaps, whether in metric spaces, proof systems, or graphs. It also appears in areas such as Banach spaces, complete graphs, and complexity theory, where completeness marks the hardest problems in a class.

  • Cauchy completeness — Cauchy completeness is the metric-space property that every Cauchy sequence converges within the space. It is the key completeness condition behind constructions of the real numbers and results such as the Baire category theorem.

  • Completeness Axiom — The completeness axiom says that every nonempty subset of the real numbers that is bounded above has a least upper bound. It is the real-number property behind supremum arguments and is tied to the Archimedean framework.

  • least upper bound property — This order property says that every bounded subset has a supremum in the set. For the real numbers, it is one of the defining completeness properties and is equivalent to Dedekind completeness in the usual setting.

• order — Order is the property of arrangement or arrangement-like structure, whether in mathematics, physics, or social science. It appears in phrases such as long-range order, short-range order, and topological order, and in Landau’s order parameter for phase transitions.
  • The Order — In mathematics, the order of a polynomial is the highest power appearing with nonzero coefficient, and in differential equations it can mean the highest derivative present. In group theory, order also denotes the size of a group, though this clue is broader than any one subject.
• Functional analysis

  • Arzelà-Ascoli theorem — The Arzelà-Ascoli theorem characterizes when a family of continuous functions on a compact space has a uniformly convergent subsequence. The key conditions are equicontinuity and boundedness, or more generally pointwise relative compactness and closedness.

  • Eigenfunctions
    • eigenfunction — An eigenfunction is a wavefunction or function that returns a scalar multiple of itself when acted on by a corresponding operator. In quantum mechanics, physical solutions of the wave equation and stationary states in the time-independent Schrödinger equation are often eigenfunctions.

  • functionals — Functionals are mappings from functions to numbers, often defined by integrals. They appear throughout the calculus of variations and in physical applications such as the action in classical mechanics and exchange-correlation functionals in density functional theory.

  • Hilbert spaces — Hilbert spaces are complete inner product spaces, so every one of them is also a Banach space. They are central in quantum mechanics, where observables act as linear operators and constructions like Fock space arise from tensor products. The name comes from David Hilbert, whose work on foundational mathematics and the 1900 problems list often serves as the giveaway clue.
• Elliptic functions
  • Jacobi theta functions — Jacobi theta functions are quasi-doubly periodic elliptic functions that can be used in solving the general quintic. They appear in the algebraic reduction of quintics to Bring-Jerrard form and are the elliptic counterparts of exponential functions.

• Guillaume François Antoine, Marquis de l’Hôpital — The Marquis de l’Hôpital is best known for the calculus rule that evaluates indeterminate forms by taking the ratio of derivatives. He studied under Johann Bernoulli and was also one of the early solvers of the brachistochrone problem, publishing an influential early textbook on differential calculus.

• singularities — A singularity is a point where mathematical functions fail to behave regularly, and in physics it can mean the infinite-curvature center of a black hole. In relativity, the term also covers coordinate singularities that disappear under a change of coordinates, unlike the true singularities predicted by Penrose-Hawking theorems.
  • singularity — A singularity is a point or region where curvature or density becomes infinite, often associated with the center of a black hole. Quizbowl clues include geodesic incompleteness, the Schwarzschild solution at r = 0, Kerr ring singularities, and the cosmic censorship hypothesis. In complex analysis, a singularity is a point where a holomorphic function fails to be well-behaved, including removable, essential, and pole-like cases.
• special functions
  • Bessel functions — Bessel functions are solutions to Bessel’s differential equation and appear in problems with cylindrical symmetry, such as Laplace’s equation in cylindrical coordinates. They are commonly denoted J-sub-nu and include related forms such as Neumann and Hankel functions.

    • Bessel function — Bessel functions are special functions that appear in problems with cylindrical symmetry, including solutions of Laplace’s equation in cylindrical coordinates. They are named for Friedrich Bessel and also arise in work on Kepler’s equation and the three-body problem.

    • Bessel functions of the first and second kind — Bessel functions of the first and second kind are solutions to Bessel’s differential equation, usually written J-sub-m and Y-sub-m. They appear in problems with cylindrical symmetry and are standard special functions in mathematical physics.

    • Hankel functions — These are special combinations of Bessel functions known as Bessel functions of the third kind. The first and second kinds are formed by adding or subtracting an imaginary multiple of the usual Bessel functions of the first and second kind, and their spherical forms represent outgoing and incoming waves.

  • Bessel functions of the first kind — Bessel functions of the first kind are the standard cylindrical solutions to Laplace’s equation and appear in problems with radial symmetry. They are denoted J-sub-n, with related second-kind functions denoted Y-sub-n, and they arise in Fourier-like expansions and frequency modulation.

  • Beta function — The beta function is a special function of two variables defined by an expression involving gamma functions. It is closely related to the Gamma function and is commonly written as a ratio of gamma terms.

  • Error function — The error function is the normalized integral of e to the negative x squared, closely related to the Gaussian curve and the normal distribution. It is often written erf, appears in the cumulative distribution function of the normal distribution, and is used in probability, statistics, diffusion, and heat-kernel calculations. Its scaled form approaches −1 and 1 at the extremes.

  • Euler gamma function — The Euler gamma function generalizes the factorial to complex and real arguments. It is defined by an integral over t to the z minus 1 times e to the minus t, and it satisfies identities such as the Legendre duplication formula and the Gauss multiplication formula.

  • Gaussian functions — Gaussian functions are bell-shaped exponential functions whose simplest form has integral equal to the square root of pi over the whole line. In computational chemistry, they are favored as basis functions because they make molecular orbital calculations and integral evaluation much easier than Slater-type orbitals.

  • Hypergeometric functions — Hypergeometric functions are special functions defined by a series involving Pochhammer symbols. Their confluent forms include Kummer and Tricomi functions, and they connect to families such as the Laguerre polynomials.
    • hypergeometric — A hypergeometric distribution models drawing a specified number of successes from a finite population without replacement. The same term also names a class of series and differential equations associated with Gauss, Klein, and the classical theory of special functions.
  • sinc function
    • sinc — The sinc function is sine x divided by x, with value 1 at zero and zeros at nonzero integer multiples of pi. It appears in diffraction, signal interpolation, and Fourier analysis as the transform of a rectangular pulse or boxcar function.

  • elliptic integral — An elliptic integral is a class of special function used in problems that cannot be reduced to elementary functions. It appears in the exact period of a pendulum at arbitrary amplitude and in the lengths of certain closed curves.

  • the Gamma function — The Gamma function extends the factorial to non-integers and is defined by an improper integral for arguments with positive real part. It satisfies the recurrence Γ(z + 1) = zΓ(z) and is a central function in complex analysis.

• James Stirling — James Stirling was a mathematician whose name is attached to the Stirling approximation and to the Stirling numbers of the first and second kinds. The name also belongs to a British architect associated with Brutalism, including the Engineering Building at Leicester and the Cambridge University History Building.

• inner product — An inner product is a bilinear or sesquilinear operation on a vector space that generalizes the dot product. It underlies Hilbert spaces, Cauchy-Schwarz, and the usual integral formula on L2 involving f times the complex conjugate of g.

• Henri Leon Lebesgue — Henri Leon Lebesgue was the French mathematician who developed the Lebesgue integral and advanced measure theory. His name also appears in the Riemann-Lebesgue lemma, which concerns rapidly oscillating integrals.

• potential theory
  • uniqueness theorems
    • uniqueness theorem — The uniqueness theorem in potential theory says boundary conditions can determine the solution to Laplace’s or Poisson’s equation. Its key consequence is that two solutions with the same suitable boundary data must have the same gradient or be the same solution.

Applied Mathematics

Dynamical Systems

• Feigenbaum constants — two universal constants (δ ≈ 4.6692 and α ≈ 2.5029) discovered by Mitchell Feigenbaum (1975); describe the rate at which period-doubling bifurcations converge to chaos in a wide class of nonlinear maps; their universality was among the first deep results of chaos theory. They first appeared in studies of the logistic map and later turned up across many nonlinear systems, including the Lorenz attractor.
  • Feigenbaum constant — The Feigenbaum constant is the universal ratio governing the spacing of period-doubling bifurcations in chaotic systems. It appears in maps such as the logistic map and has an approximate value of 4.6692.

• Strange attractor — the long-term behavior of a chaotic dynamical system; a fractal set in phase space to which trajectories converge but on which nearby trajectories diverge exponentially; examples include the Lorenz and Rössler attractors. Examples also include the Hénon attractor.

• Lyapunov exponent — quantifies the rate of separation of infinitesimally close trajectories in a dynamical system; positive Lyapunov exponent is the hallmark of chaos. They appear in chaos theory, are paired in symplectic systems, and are related to entropy by Pesin’s relation. They are commonly derived using Oseledets’ theorem and related formulas from ergodic theory.

• Sierpinski triangle — a fractal formed by recursively removing the central triangle from an equilateral triangle; has fractal dimension log 3 / log 2 ≈ 1.585; also appears in Pascal’s triangle mod 2. It was described by Wacław Sierpiński and is often formed by shading the odd entries of Pascal’s triangle.
  • Sierpinski’s Triangle — Sierpinski’s triangle is the self-similar triangular fractal named for the Polish mathematician Wacław Sierpiński. It can be generated from Pascal’s triangle by shading the odd entries or constructed through iterative subdivision and the chaos game.
• Cantor set — formed by iteratively removing the middle third of intervals starting from [0,1]; uncountable but of Lebesgue measure zero; a prototypical fractal; totally disconnected and perfect. Its points are exactly the real numbers whose ternary expansions contain no 1s. It is a standard counterexample in analysis, and a “fat” Cantor set is a common higher-measure variant.

  • Cantor bar — The Cantor bar is the simplest fractal version of the middle-third Cantor set construction. It is formed by repeatedly dividing a line into three parts and removing the middle segment.

  • the Cantor set — This fractal is formed by repeatedly removing the middle third of intervals, leaving a totally disconnected self-similar set. It is named for Georg Cantor and has Hausdorff dimension log 2 over log 3.

• Mandelbrot set — the set of complex numbers c for which the iteration z → z² + c does not diverge; named for Benoît Mandelbrot; the iconic fractal with infinitely complex boundary; self-similar at all scales. Its boundary includes a main cardioid and infinitely many smaller bulbs, and it was popularized in the 1970s.

• Julia sets — for a fixed complex parameter c, the Julia set is the boundary of the set of starting points z₀ for which the iteration z → z² + c remains bounded; connected when c is in the Mandelbrot set, a Cantor dust otherwise.

• Fractal — a geometric object exhibiting self-similarity at multiple scales and typically a non-integer (fractal) dimension; examples include the Mandelbrot set, the Koch snowflake, and the Cantor set. The term was coined by Mandelbrot (1975). Other standard examples include the Sierpiński triangle, Julia sets, and the Menger sponge; fractals are often described in terms of Hausdorff dimension.

• Chaos theory / Lorenz attractor — small differences in initial conditions of certain deterministic systems yield wildly divergent trajectories (“butterfly effect”); the Lorenz attractor (Edward Lorenz, 1963) is the canonical strange attractor arising from simplified fluid convection equations, exhibiting fractal structure.

• bifurcation theory
  • bifurcations — Bifurcations are points in dynamical systems where a small change in parameters produces a qualitative change in behavior. Examples include Hopf, saddle-node, pitchfork, and period-doubling bifurcations, which are central in chaos theory and nonlinear dynamics.
    • bifurcation — A bifurcation is a change in a system’s parameter that increases the number of solutions or branches of behavior. Common examples include pitchfork, transcritical, and Hopf bifurcations, and period-doubling cascades in the logistic map.
• celestial mechanics
  • three-body problem — The three-body problem studies the gravitational motion of three interacting bodies, a classic non-integrable system with no general closed-form analytic solution. Special cases include the restricted problem, such as the Earth-Sun-Moon system, where one mass is negligible; these are associated with Lagrange points and the Jacobi integral. The problem is also famous for chaotic behavior recognized by Henri Poincaré, and for Sundman’s series solution.
• chaos theory — Chaos theory studies deterministic systems with extreme sensitivity to initial conditions. Classic examples include the logistic map, the double pendulum, and the Lorenz equations, which produce the butterfly effect.

  • first Feigenbaum constant — The first Feigenbaum constant is the limit ratio between successive period-doubling bifurcation intervals in the logistic map. Its value is about 4.67, and it appears in the study of chaotic behavior in simple nonlinear systems.

  • Mitchell Feigenbaum — Mitchell Feigenbaum was a mathematician associated with chaos theory and with the discovery of universality in period-doubling bifurcations. The Feigenbaum constant, which governs the spacing of bifurcation values, is named for him.

• closed orbits — Closed orbits are trajectories in dynamical systems that return to their starting point, including periodic, homoclinic, and limit-cycle motions. They partition phase space and are studied with tools such as Poincaré maps and the Poincaré–Bendixson theorem.

• Ergodic theory — Ergodic theory studies dynamical systems and the relationship between time averages and statistical averages. It is closely tied to measure-preserving transformations and results such as Ornstein’s theorem and Kolmogorov entropy.
  • ergodicity — A property of a dynamical system or statistical mechanical system in which long-run time averages match ensemble averages. In this sense the system explores all accessible microstates over time, often discussed for systems in equilibrium alongside Liouville’s theorem and phase space; in statistical mechanics it is a central assumption used in derivations such as equipartition. In ergodic theory, it means invariant sets are trivial. The word also appears in “ergodic literature” for texts that require substantial effort or movement through the text.
• integrable systems
  • integrability — A dynamical system is integrable when it has enough constants of motion to allow analytical solution, often through quadratures or action-angle variables. Complete integrability is the stronger form in which the number of conserved quantities matches the number of degrees of freedom.
    • integrable — Integrability is the property of a function that allows an antiderivative to be computed, with Riemann and Lebesgue versions appearing in calculus and measure theory. In analysis, the term also appears in results such as dominated convergence and in the criterion that a function with bounded discontinuities can still be integrable. The same word is used for dynamical systems, where integrable Hamiltonians admit many conserved quantities and often lead to soliton equations and quasiperiodic motion.

• invariant torus — An invariant torus is the torus-shaped surface in phase space on which trajectories of an integrable system lie. In the KAM theorem, weak perturbations deform these tori only slightly for most trajectories.

• KAM theory
  • Kolmogorov-Arnold-Moser theorem — The Kolmogorov-Arnold-Moser theorem says that sufficiently small perturbations of an integrable Hamiltonian system leave many quasiperiodic invariant tori intact. It is a foundational result in dynamical systems and celestial mechanics, especially in discussions of small divisors and stability.
• limit cycles
  • limit cycle — A limit cycle is an isolated closed trajectory in phase space that nearby trajectories approach or repel depending on stability. It is a standard concept in nonlinear dynamics and oscillatory systems, often discussed with the Poincaré-Bendixson theorem and bifurcations.

• logistic map — The logistic map is the recursive population model x_{n+1} = r x_n(1 - x_n) used to model population growth with a carrying capacity. For large parameter values it shows period-doubling bifurcations and chaotic behavior, making it a classic simple example of chaos and the transition from smooth growth to unpredictability.

• maps
  • Hénon map — The Hénon map is a two-dimensional discrete dynamical system and dissipative quadratic map used as a simplified model of chaotic motion. It is a standard example of a difference equation with a strange attractor, defined by an x update and a y update involving a quadratic term. It is famous for producing the Hénon strange attractor, and was introduced from studies of asteroid-orbit perturbations.

• period doubling — Period doubling is a route to chaos in which a system’s period repeatedly doubles as parameters change. It is associated with flip bifurcations and the Feigenbaum constant.

• periodic orbits — Periodic orbits are closed trajectories in phase space for dynamical systems. They underlie concepts such as limit cycles and recur in analyses using Poincaré maps, Floquet multipliers, and the Poincaré-Bendixson theorem.

• Poincaré section — A Poincaré section is a lower-dimensional slice of phase space used to study the behavior of dynamical systems. Its point pattern can reveal periodic, quasiperiodic, or chaotic motion, and the construction is named for Henri Poincaré.

• Poincaré–Bendixson theorem — The Poincaré–Bendixson theorem describes the long-term behavior of bounded trajectories in two-dimensional continuous dynamical systems. Such an orbit must approach a periodic orbit or a fixed point, and the theorem does not extend to higher-dimensional chaos.

• quasiperiodic motion
  • quasiperiodic — Quasiperiodic motion repeats irregularly, with two or more incommensurate frequencies rather than a single fixed period. It appears in KAM theory and in the study of flows that can break into strange attractors under small perturbations.
• recurrence
  • Poincaré recurrence theorem — The Poincaré recurrence theorem says that a finite, measure-preserving dynamical system will eventually return arbitrarily close to its initial state. It is associated with Zermelo’s challenge to Boltzmann’s H-theorem and with recurrence times in classical mechanics and statistical physics.
• attractors — Attractors are sets of states that dynamical systems approach, and their strange varieties can have fractal structure. Examples range from fixed points and limit cycles to the chaotic attractors studied in nonlinear dynamics.

  • Lorenz attractors — Lorenz attractors, also called strange attractors, arise in chaotic dynamical systems with bounded but highly sensitive trajectories. They were discovered in work on convection and later analyzed by Ruelle, Takens, and Hénon.

  • strange attractors — Strange attractors are fractal attractors in chaotic dynamical systems, such as the Lorenz attractor, whose trajectories never exactly repeat but still settle into a recognizable phase-space pattern. They often have noninteger dimension and are tied to ideas like positive Lyapunov exponents and the Kaplan-Yorke conjecture.

  • attractor — An attractor is a set of states toward which a dynamical system evolves from a range of initial conditions. When its structure is fractal, it is called a strange attractor, a term associated with Edward Lorenz and chaotic systems.

• catastrophe theory — Catastrophe theory studies systems whose behavior changes suddenly after gradual variation in parameters. Associated with René Thom, it was developed to model discontinuities in phenomena such as market instability, bridge collapse, and other abrupt transitions.
  • catastrophes — Catastrophes are sudden changes in a system’s behavior that can occur when a control parameter varies continuously. René Thom developed catastrophe theory and classified elementary forms such as fold, cusp, swallowtail, and butterfly.

• Vladimir Arnold — Vladimir Arnold was a Soviet mathematician and educator known for work in dynamical systems, including Arnold’s cat map. His name appears in the KAM theorem with Kolmogorov and Moser, and in concepts such as Arnold tongues and Arnold’s problems.

• initial conditions — Initial conditions are the starting values that determine how a dynamical system evolves in time. In systems such as the double pendulum, small changes in these values can produce chaotic behavior with strong sensitivity and a positive Lyapunov exponent.

• Edward Norton Lorenz — Edward Norton Lorenz was a meteorologist and mathematician whose work founded modern chaos theory. He is famous for the butterfly effect and the Lorenz attractor, a system whose behavior helped make sensitive dependence on initial conditions a central scientific idea.

• growth models
  • exponential growth — Exponential growth is the unbounded growth in which the rate of increase is proportional to the current population size. It is modeled by equations of the form x equals a times e to the rt, and it appears in population dynamics during early bacterial growth and other unchecked reproduction.
• Fractal dimensions
  • Hausdorff dimension — The Hausdorff dimension measures the effective fractal dimension or roughness of a set, often exceeding its topological dimension. Clues often mention the Koch curve, the Menger sponge, or the Mandelbrot set as examples where this number is non-integer.
• Fractal geometry
  • Benoit Mandelbrot — Benoit B. Mandelbrot was a Polish-born French-American mathematician who coined the term fractal and helped found fractal geometry. He studied the geometry of roughness and self-similarity, popularized fractals, and is the namesake of the Mandelbrot set, a famous fractal in the complex plane that generates the classic boundary between dimensions one and two. His work on the length of Britain’s coastline is a standard clue, and his book The Fractal Geometry of Nature made him a central figure in chaos theory and geometric complexity.

    • The Fractal Geometry of Nature — The Fractal Geometry of Nature is Benoit Mandelbrot’s landmark book on fractals and their use in modeling the real world. It is famous for examples such as the Britain coastline problem and the claim that natural forms like clouds, mountains, and lightning are not well described by smooth Euclidean shapes.

    • The Mandelbrot Set — The Mandelbrot set is the famous fractal defined by the boundedness of iterating z squared plus c on the complex plane. It is known for its intricate boundary, its connection to Julia sets, and the images popularized by Benoit Mandelbrot.

• fractals

  • Julia set — A Julia set is the fractal associated with iterating z sub n plus one equals z sub n squared plus c on the complex plane. It is complementary to the Fatou set and is closely related to Mandelbrot’s work on complex dynamics.

  • Self-similarity — Self-similarity is the property of an object that resembles parts of itself when viewed at different scales. It is a defining feature of many fractals and is closely related to scale invariance.

  • 3D fractals
    • Menger sponge — The Menger sponge is a three-dimensional fractal made by repeatedly removing cubes from a larger cube, or subdividing a cube and removing selected subcubes. It is the 3D analogue of the Sierpinski carpet, has infinite surface area and zero volume, and has a fractal dimension of about 2.727. It is named for the Austrian mathematician Karl Menger.

  • Koch snowflake — A classic fractal constructed by repeatedly adding equilateral triangles to the middle third of each segment of an initial triangle. Its perimeter grows without bound, but its area approaches a finite limit.

  • Sierpinski carpet — The Sierpinski carpet is the two-dimensional fractal formed by repeatedly removing the center square from a square divided into nine parts. It is often described as the planar analogue of the Cantor set.

  • Weierstrass-Mandelbrot function — The Weierstrass-Mandelbrot function is a continuous function that is nowhere differentiable. It is built from a cosine series and is associated with fractal geometry and the work of Weierstrass and Mandelbrot.
• Mandelbrot — Benoît Mandelbrot was the mathematician associated with fractals, especially the set that bears his name. The clues also point to his uncle Szolem Mandelbrojt, a founder of Bourbaki, showing the family connection behind the surname.

Related Concepts and Applications

• applied probability
  • Queueing theory — Queueing theory is the mathematical study of waiting lines, developed early by A. K. Erlang and used in traffic control, communications, and computer science. Its central questions concern arrival rates, service times, and waiting times in systems with limited service capacity.
• Decision theory
  • minimax — Minimax is a decision rule that chooses the option with the smallest worst-case outcome. In game theory, it is tied to von Neumann’s theorem for finite two-player zero-sum games, and in computation it appears in contexts such as Yao’s principle and alpha-beta pruning.
• scaling laws
  • power laws — Power laws are scale-invariant relationships of the form Cx^-alpha. They appear in contexts such as Kleiber’s law, Pareto distributions, and the degree distributions of scale-free networks.
    • power law — A power law is a scale-free functional form used to describe critical phenomena and many network degree distributions. It also appears in contexts ranging from bacterial growth models to Zipf-like laws.
• transformations
  • Legendre transformations
    • Legendre transformation — A transformation that replaces one function with another by trading variables through a derivative-based formula, expressing it in terms of conjugate variables. In mechanics it turns the Lagrangian into the Hamiltonian, and in thermodynamics it relates quantities such as internal energy, Helmholtz free energy, and Gibbs free energy, including the passage from Helmholtz free energy to Gibbs free energy.

Numerical Approximation and Computational Methods

Compare analytic solutions with numerical integration, equation solving, and approximation.

• Newton-Raphson method — iterative root-finding: xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ); converges quadratically near a simple root; fails if f′(xₙ) = 0. It is also called Newton’s method and can be described geometrically as repeatedly taking the x-intercept of the tangent line to f at the current guess; the method is associated with Isaac Newton and James Raphson.

• Runge-Kutta methods — family of numerical ODE solvers; the classical 4th-order method (RK4) achieves high accuracy by evaluating slopes at multiple intermediate points per step; widely used default in scientific computing. The most common form improves on Euler’s method by combining four slope estimates, and adaptive versions adjust the step size using an error estimate.

• Approximation methods
  • approximation — Approximation is the general technique of replacing an exact calculation with a simpler one that is easier to compute. It includes small-angle substitutions, the Born-Oppenheimer separation, WKB methods, and other ways of reducing a problem without evaluating every term exactly.
    • rounding — Rounding is the process of replacing a number with a nearby value according to a rule such as nearest, ceiling, floor, or chop. It is essential in finite-precision arithmetic, where tie-breaking rules and machine epsilon help describe the resulting error.
• numerical analysis

  • root-finding — Root-finding is the task of locating the zeros of a function or polynomial. Methods for it include Newton’s method, Laguerre’s method, bisection, and other numerical algorithms.

  • differential equation stiffness
    • Stiffness — Stiffness is a numerical-analysis property of differential equations in which stable integration requires very small step sizes. It is a common difficulty in systems with widely separated time scales, and methods such as A-stable implicit solvers are often used to handle it.

  • Euler’s method — Euler’s method is the simplest first-order Runge-Kutta technique for numerically approximating solutions to differential equations. It advances a solution by using the slope at the current point to take a short tangent-line step.

  • floating-point arithmetic
    • floating point — Floating point is a computer representation of real numbers that stores a sign, significand, and exponent. Floats are floating-point numbers, the approximate real-number format used by IEEE 754 and common in programming languages. They are limited by machine precision and include variants such as half, single, double, and quadruple precision. The IEEE 754 standard defines common floating-point formats such as single and double precision.
  • fourth-order methods
    • fourth-order — A fourth-order method is one whose truncation or accumulated error scales on the order of the fifth power of the step size. The Runge-Kutta method is a standard example of a fourth-order numerical scheme.
  • interpolation — Interpolation is the mathematical process of estimating values between known data points, often using polynomials, splines, or nearest-neighbor methods. Common clues include Runge’s phenomenon, the Whittaker-Shannon formula, and kriging as a Gaussian-process approach.

    • Polynomial interpolation — Polynomial interpolation is the problem of finding a polynomial that passes through a given set of points. Methods associated with it include Lagrange interpolation, Neville’s algorithm, and the Vandermonde matrix.

    • splines — Splines are piecewise polynomial functions used in interpolation and computer-aided design. Their variants include cubic splines and B-splines, and they are valued because they avoid the oscillation problems of high-degree polynomial interpolation.

  • Monte Carlo methods
    • Monte Carlo method — The Monte Carlo method uses repeated random sampling to estimate numerical results. It is named for the casino city in Monaco and underlies techniques such as Monte Carlo integration and probabilistic primality testing.
  • numerical integration — Numerical integration is the process of approximating the value of an integral, often to estimate area under a curve when exact antiderivatives are inconvenient or unavailable. Common methods include Riemann sums, the trapezoidal rule, Simpson’s rule, Gaussian quadrature, and adaptive or sparse-grid algorithms for higher-dimensional problems.

    • Clenshaw-Curtis quadrature — Clenshaw-Curtis quadrature is a numerical integration method that interpolates a function at Chebyshev points and then integrates the interpolating polynomial. It can be described by changing variables to cosine theta and is closely tied to Chebyshev polynomials and discrete cosine transforms.

    • Monte Carlo integration — Monte Carlo integration is a numerical method that estimates integrals by sampling random points and averaging the results. Related versions compare the fraction of points landing in a region of known volume to approximate higher-dimensional volumes.

    • Simpson’s Rule — Simpson’s rule is a Newton-Cotes numerical integration method that approximates definite integrals by fitting parabolic arcs, usually via quadratic interpolation. It is often written in the 1-4-1 form over paired subintervals, with alternating weights of four and two, and is usually more accurate than the trapezoidal rule. It is named for Thomas Simpson and is often contrasted with Riemann sums and the trapezoidal rule.

    • trapezoid rule — A Newton–Cotes method for numerical integration that estimates area under a curve by replacing the graph with trapezoids. It is exact for linear functions and is slightly less accurate than Simpson’s rule.

  • numerical stability — Numerical stability is the property that small changes in input or rounding error do not cause a computation to blow up. In differential equations, Lyapunov stability is the related idea that nearby solutions remain nearby.

  • step size — Step size is the interval in the independent variable used in numerical integration and related iterative methods. It appears in stability and error analyses for methods like Euler’s method, and in optimization it corresponds to the learning rate.

  • stiff differential equations — Stiff differential equations are systems whose components change on very different scales, making them hard to solve numerically. They often require implicit or semi-implicit methods because explicit methods become unstable unless the step size is extremely small.
• Numerical methods
  • bisection — Bisection is the process of dividing something into two equal parts. In mathematics it appears in the bisection method, perpendicular bisectors, and the ham sandwich theorem.

• Thomas Simpson — Thomas Simpson was an English mathematician whose name is attached to numerical integration rules that approximate area under a curve with weighted polynomials. His best-known versions are Simpson’s 1/3 rule and 3/8 rule, both special cases of the Newton–Cotes formulas.

• Galerkin method — The Galerkin method is a weighted-residual technique used to approximate solutions to differential equations. It underlies the finite element method by choosing test functions from the same space as the basis functions and forcing the residual’s integral to vanish.

Optimization and Applied Models

Use algebra, calculus, and differential equations to model and optimize physical and biological systems.

• Linear programming
  • simplex method — George Dantzig’s classic linear programming algorithm, which moves between vertices of a feasible polytope using pivot steps in a tableau. It introduces slack variables to convert inequalities into equations. The method is famous for degeneracy, cycling, and the Klee-Minty worst-case example; Bland’s rule is one standard fix for choosing entering and leaving variables.
• optimization

  • constrained optimization — Constrained optimization, also called mathematical programming, seeks the maximum or minimum of a function subject to conditions. Methods like simplex, interior-point algorithms, and simulated annealing are used to solve these problems. In multivariable settings, the Karush-Kuhn-Tucker conditions and Lagrange multipliers provide the standard tools for locating constrained extrema.

  • constraints — Constraints are relations that limit the behavior of a physical or mathematical system, especially in optimization and mechanics. Examples include holonomic and nonholonomic constraints, and they define feasible regions in methods such as Lagrange multipliers and the simplex method.

  • method of Lagrange multipliers — The method of Lagrange multipliers is a calculus technique for optimizing a function subject to a constraint. It works by making the gradient of the objective proportional to the gradient of the constraint, usually with a multiplier called lambda.

  • optimization problems — Optimization problems seek the best feasible value of an objective function subject to constraints. They may be constrained or infeasible when the restrictions cannot all be satisfied at once.

  • knapsack problem — The knapsack problem asks how to choose items of given weights and values to maximize total value without exceeding a capacity. Its 0-1 form is NP-complete, while dynamic programming gives pseudo-polynomial algorithms and greedy methods apply only to special variants.

  • saddle points — Saddle points are critical points where a function curves upward in one direction and downward in another, so they are neither local maxima nor minima. They also appear in multivariable calculus, dynamical systems, and game theory, where the same idea can be called a minimax point.

• George Dantzig — George Dantzig was a mathematician and operations researcher associated with the simplex method and later work in optimization. He is also linked to the famous story that inspired Good Will Hunting and to an algorithm for the knapsack problem.

• mathematical ecology
  • population models
    • Leslie matrix — The Leslie matrix is a demographic model used in mathematical ecology to project population changes by age class. Its entries encode age-specific fertility and survival, and it is often compared with the stage-based Lefkovitch matrix.
• applied mathematics
  • fluid mechanics
    • stream functions — Stream functions are scalar functions used in fluid mechanics so that the velocity components can be written as derivatives of a single field. In two-dimensional flow they automatically satisfy continuity and are often denoted by psi.
  • game theory — Game theory is the mathematical study of strategic decision-making in situations such as the prisoner’s dilemma. It uses concepts like Nash equilibrium, zero-sum games, and backward induction, and was developed by John von Neumann and Oskar Morgenstern.

    • Battle of the Sexes — Battle of the Sexes is a coordination game in game theory in which each player prefers a different outcome but both want to coordinate on the same choice. It is often illustrated by two lovers choosing between the opera and a football or boxing event, and it has a mixed-strategy Nash equilibrium.

    • coordination games
      • stag hunt — The stag hunt is a coordination game in game theory where players choose between a safer hare and a higher-payoff stag. It is known for having both risk-dominant and payoff-dominant equilibria and is often used in discussions of cooperation and social contracts.
    • games — Games are strategic situations or structured contests studied in game theory, in which players choose actions or strategies whose payoffs depend on one another’s decisions. The subject includes zero-sum games, Nash equilibria, minimax, backward induction, Sprague-Grundy theory and Grundy numbers, as well as repeated, simultaneous, and extensive-form variants. Common examples include chess, Nim, the Prisoner’s Dilemma, and iterated cooperation problems.
      • Connect Four — Connect Four is the vertical grid game in which players drop colored pieces to make four in a row. It can be solved with perfect play, and the first player has a winning central-column strategy.

    • John Horton Conway — John Horton Conway was the British mathematician who invented the Game of Life and helped develop surreal numbers. He also devised chained arrow notation, studied combinatorial games, and contributed ideas such as the look-and-say cosmological theorem.

    • payoff matrix — A payoff matrix is the chart game theory uses to show the results of players’ choices. It is used to identify dominant strategies and Nash equilibria, including in the prisoner’s dilemma.

    • poker games
      • Kuhn Poker — Kuhn poker is a simplified two-player poker game used in game theory. Each player antes and receives one of three cards, then chooses whether to check or raise before the higher card wins the pot.
    • strategies — In game theory, strategies are the actions or plans players choose, such as cooperate or defect in the prisoner’s dilemma. Variants include pure and mixed strategies, and concepts like dominant strategies and Bayesian incentive compatibility are defined using them.
      • mixed strategy — A mixed strategy assigns probabilities to pure strategies instead of choosing one action deterministically. In game theory, it is the optimal kind of strategy for many finite zero-sum games, such as the equal randomization used in rock-paper-scissors.
    • Volunteer’s dilemma — The volunteer’s dilemma is a game-theory situation in which one person must incur a cost so the whole group benefits. It is often used to model the bystander effect.
  • inverse problems — Inverse problems ask for the underlying model parameters or structure that would produce observed data, rather than predicting the data from a known model. They appear in settings such as tomographic reconstruction and seismic imaging, where one works backward from measurements to the hidden source or medium.
• mathematical biology
  • logistic curves
    • logistic curve — A logistic curve is an S-shaped growth curve that rises rapidly at first and then levels off toward a carrying capacity. It is used to model population growth and the diffusion of innovations such as hybrid seed.
• Population dynamics
  • Logistic growth — Logistic growth is the sigmoid population model that rises quickly and then levels off at carrying capacity. It is commonly associated with the Verhulst equation and with populations whose growth is limited by resources.
• Mechanics
  • mechanical advantage
    • 125 pounds — A mechanical advantage of 4 on a 500-pound load requires 125 pounds of force. The same answer appears in a basic inverse-square weight calculation with a one-ton object moving from 4,000 to 16,000 miles from Earth’s center.
  • work and energy
    • 9.8 JOULES — This is 9.8 joules, the work done against kinetic friction in a basic mechanics calculation. The same setup is often rounded to 10 joules when gravitational acceleration is taken as 10 meters per second squared.
• Physics

  • 80 meters — This is 80 meters, the height associated with a projectile motion or bounce calculation. It is obtained from basic kinematics when a falling object rebounds elastically with a speed of 40 meters per second.

  • Angular motion
    • theta, omega, alpha — In rotational mechanics, angular position is theta, angular velocity is omega, and angular acceleration is alpha. These symbols are the standard Greek-letter notation for describing angular motion.
  • capacitance
    • 5 Farads — Two 10-farad capacitors connected in series have a total capacitance of 5 farads. Series capacitors combine by adding reciprocals, so identical capacitors halve the capacitance.

  • moment — A moment is the brief span of time that Henri Cartier-Bresson called the decisive instant for photography. It also titles works such as The Decisive Moment and The Perfect Moment, and in physics it can mean a quantity describing the shape of a distribution or the torque on a body.

  • momentum
    • 125 kilograms — In the perfectly inelastic collision, a 500-kilogram truck slows from 10 meters per second to 8 meters per second while hitting a stationary object. Conservation of momentum gives the object’s mass as 125 kilograms.

Probability and Statistics

Build probability models before studying estimation and statistical inference.

Probability describes uncertainty under a model. Statistics uses observations to estimate quantities, compare explanations, and assess how much a conclusion depends on sampling and modeling assumptions. The distinction matters: a precise estimate from a biased sample can still answer the wrong question.

Probability models

• Sample space, events, and probability axioms — a probability space specifies outcomes, a collection of measurable events, and their probabilities. Probabilities are nonnegative, the whole space has probability 1, and the probability of a countable union of disjoint events is the sum of their probabilities. Countable additivity is stronger than the finite two-event rule.

• Conditional probability and Bayes’ theorem — When P(B) > 0, P(A

  B) = P(A ∩ B)/P(B). If P(A) > 0 as well, Bayes’ theorem gives P(A

  B) = P(B

  A)P(A)/P(B). A rare condition can remain unlikely after a positive test if false positives are sufficiently common; the base rate matters.

• Independence — A and B are independent when P(A ∩ B) = P(A)P(B). Conditional independence concerns independence within levels of a third variable; it need not imply marginal independence, or follow from it. Pairwise independence among three or more events does not necessarily imply mutual independence. The same notion applies to random variables, where independence means their joint distribution factors into the product of the marginals.
  • independent — In mathematics and statistics, independent describes objects or events that do not affect one another, such as variables with zero covariance or events whose joint probability is a product. The term also appears in logic, linear algebra, and geometry, where it contrasts with dependence and with the parallel postulate being independent of the other axioms.

• Random variables, distributions, and quantiles — a random variable assigns a numerical value to an outcome. Its cumulative distribution function is F(x) = P(X ≤ x); a quantile locates a chosen cumulative probability. For continuous variables, density is not the probability at a single point.

• Expectation and variance — expectation is the probability-weighted mean when the relevant sum or integral exists. Variance is E[(X − E[X])²] when finite; standard deviation is its square root. A standard error describes uncertainty in an estimator, rather than spread among individual observations.

• probability

  • three quarters — Three quarters is the probability that two heterozygous parents will produce an offspring showing the dominant phenotype. It is also the expected fraction of dominant offspring in the standard Mendelian cross of two parents carrying one dominant and one recessive allele.

  • 1 in 2 — This is the probability asked for in a genetics or blood-type inheritance calculation. The result is one in two.

  • 1 in 4 — This is the probability asked for a child inheriting a trait in the setup described. The answer is one in four.

  • 1 out of 2 — The probability is 1/2 in each situation, since half of the socks are white and half of the die faces are even. In both examples, the favorable outcomes are exactly half of the total outcomes.

  • Dice probabilities
    • five-eighteenths — Five-eighteenths is the probability that exactly one of two fair six-sided dice shows a two. The count comes from either die being a two while the other is not, divided by the 36 equally likely outcomes.
  • inheritance probabilities
    • 1 in 16 — This is the probability that a particular grandchild would be hemophiliac under the stated inheritance assumptions. The computed odds are one in sixteen.
  • Randomization
    • dice — Dice are the cube-shaped objects used to generate random numbers in games and gambling. Literary clues include Mallarmé’s Un coup de dés jamais n’abolira le hasard, the dice game in the Mahabharata, and the role of dice in stories involving chance and fate.
• probability inequalities
  • Chebyshev’s inequality — Chebyshev’s inequality bounds the fraction of observations that lie far from the mean in terms of standard deviations. It can be derived from Markov’s inequality and is often stated as at least one minus one over k squared within k standard deviations.

These foundations are developed in MIT’s probability readings.

Useful distributions and limiting results

• Bernoulli and binomial — a Bernoulli variable records one success/failure outcome; a binomial variable counts successes in a fixed number of independent trials with a common success probability.

• Poisson and exponential — a Poisson model describes counts under a specified event-rate model; exponential waiting times arise in a homogeneous Poisson process. Neither is a universal model for count or waiting-time data.

• Normal distribution — specified by mean μ and variance σ². About 68%, 95%, and 99.7% of observations lie within one, two, and three standard deviations in this particular distribution; these percentages do not describe arbitrary data. It is also called the Gaussian distribution; its standard form has mean 0 and variance 1. The mean, median, and mode coincide, and sums of many independent random variables often approach it via the central limit theorem.

• Student’s t, chi-square, and F distributions — reference distributions arising in common normal-theory inference problems. Their use requires the corresponding sampling and model assumptions; small sample size alone does not justify any particular test.

• Law of large numbers — for independent, identically distributed observations with finite absolute expectation, the sample mean converges to the population mean. More observations do not remove systematic selection or measurement bias. It states convergence in the long run, not that small samples must closely match the theoretical distribution.

• Central limit theorem — in the classical independent, identically distributed case with mean μ and finite, nonzero variance σ², √n(X̄ − μ)/σ converges in distribution to a standard normal variable. This concerns the standardized sampling distribution of the mean, not the distribution of the raw observations. Approximation quality depends on the distribution and sample size; there is no universal “n ≥ 30” guarantee. Heavy-tailed or dependent data require separate conditions. Common formulations are often stated for sums as well as means, and several versions exist, including Lindeberg-type and Lyapunov-type conditions. The Berry-Esseen theorem gives a quantitative rate of convergence in many i.i.d. settings.

• probability distributions
  • binomial distribution
    • The Binomial Distribution — The binomial distribution gives the probability of getting a given number of successes in a fixed number of Bernoulli trials. Its coefficients are the binomial coefficients, expressed with factorials.
• Probability and statistics
  • Gaussian function — The Gaussian function is the exponential of a negative square and underlies the normal distribution. It appears in random-walk problems, image blurring with Gaussian filters, and saddle-point approximations in physics and chemistry.