number-theoretic formula

  • 21set theory — the branch of mathematics that deals with relations between sets. [1940 45] * * * Branch of mathematics that deals with the properties of sets. It is most valuable as applied to other areas of mathematics, which borrow from and adapt its… …

    Universalium

  • 22Brouwer-Hilbert controversy — A foundational controversy in twentieth century history of mathematics opposed L. E. J. Brouwer, a supporter of intuitionism, and David Hilbert, the founder of formalism.BackgroundThe background for the controversy was set with David Hilbert s… …

    Wikipedia

  • 23Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …

    Wikipedia

  • 24Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …

    Wikipedia

  • 25Character theory — This article refers to the use of the term character theory in mathematics. For the media studies definition, see Character theory (Media). In mathematics, more specifically in group theory, the character of a group representation is a function… …

    Wikipedia

  • 26Johann Peter Gustav Lejeune Dirichlet — Gustav Lejeune Dirichlet Johann Peter Gustav Lejeune Dirichlet Born 13 Fe …

    Wikipedia

  • 27Double counting (proof technique) — In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which… …

    Wikipedia

  • 28Representation theory — This article is about the theory of representations of algebraic structures by linear transformations and matrices. For the more general notion of representations throughout mathematics, see representation (mathematics). Representation theory is… …

    Wikipedia

  • 29Modular group — For a group whose lattice of subgroups is modular see Iwasawa group. In mathematics, the modular group Γ is a fundamental object of study in number theory, geometry, algebra, and many other areas of advanced mathematics. The modular group can be… …

    Wikipedia

  • 30Beaver Bit-vector Decision Procedure — Beaver is a Satisfiability Modulo Theories (SMT) decision procedure for the theory of quantifier free finite precision bit vector arithmetic ( [http://combination.cs.uiowa.edu/smtlib/logics/QF BV.smt QF BV] ). Its prototype implementation… …

    Wikipedia