Luxist Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Cubic field - Wikipedia

    en.wikipedia.org/wiki/Cubic_field

    Adjoining a root of x 3 + x 2 − 2x − 1 to Q yields a cyclic cubic field, and hence a totally real cubic field. It has the smallest discriminant of all totally real cubic fields, namely 49. The field obtained by adjoining to Q a root of x 3 + x 2 − 3x − 1 is an example of a totally real cubic field that is not cyclic. Its discriminant is ...

  3. Taxicab number - Wikipedia

    en.wikipedia.org/wiki/Taxicab_number

    In mathematics, the n th taxicab number, typically denoted Ta ( n) or Taxicab ( n ), is defined as the smallest integer that can be expressed as a sum of two positive integer cubes in n distinct ways. [1] The most famous taxicab number is 1729 = Ta (2) = 1 3 + 12 3 = 9 3 + 10 3, also known as the Hardy-Ramanujan number.

  4. Finite field - Wikipedia

    en.wikipedia.org/wiki/Finite_field

    If n is a positive integer, an n th primitive root of unity is a solution of the equation x n = 1 that is not a solution of the equation x m = 1 for any positive integer m < n. If a is a n th primitive root of unity in a field F , then F contains all the n roots of unity, which are 1, a , a 2 , ..., a n −1 .

  5. Palindromic number - Wikipedia

    en.wikipedia.org/wiki/Palindromic_number

    A palindromic number (also known as a numeral palindrome or a numeric palindrome) is a number (such as 16461) that remains the same when its digits are reversed. In other words, it has reflectional symmetry across a vertical axis. The term palindromic is derived from palindrome, which refers to a word (such as rotor or racecar) whose spelling ...

  6. Cholesky decomposition - Wikipedia

    en.wikipedia.org/wiki/Cholesky_decomposition

    In linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced / ʃəˈlɛski / shə-LES-kee) is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions, e.g., Monte Carlo simulations.

  7. Vieta jumping - Wikipedia

    en.wikipedia.org/wiki/Vieta_jumping

    In number theory, Vieta jumping, also known as root flipping, is a proof technique. It is most often used for problems in which a relation between two integers is given, along with a statement to prove about its solutions. In particular, it can be used to produce new solutions of a quadratic Diophantine equation from known ones.

  8. Hypercube - Wikipedia

    en.wikipedia.org/wiki/Hypercube

    In geometry, a hypercube is an n -dimensional analogue of a square ( n = 2) and a cube ( n = 3 ). It is a closed, compact, convex figure whose 1- skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in n ...

  9. Chebyshev polynomials - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_polynomials

    The Chebyshev polynomials form a complete orthogonal system. The Chebyshev series converges to f(x) if the function is piecewise smooth and continuous. The smoothness requirement can be relaxed in most cases – as long as there are a finite number of discontinuities in f(x) and its derivatives.