Luxist Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Primitive root modulo n - Wikipedia

    en.wikipedia.org/wiki/Primitive_root_modulo_n

    If g is a primitive root modulo p k, then g is also a primitive root modulo all smaller powers of p. If g is a primitive root modulo p k, then either g or g + p k (whichever one is odd) is a primitive root modulo 2 p k. Finding primitive roots modulo p is also equivalent to finding the roots of the (p − 1)st cyclotomic polynomial modulo p.

  3. Ramanujan's sum - Wikipedia

    en.wikipedia.org/wiki/Ramanujan's_sum

    Ramanujan's sum. In number theory, Ramanujan's sum, usually denoted cq ( n ), is a function of two positive integer variables q and n defined by the formula. where ( a, q) = 1 means that a only takes on values coprime to q . Srinivasa Ramanujan mentioned the sums in a 1918 paper. [1]

  4. Mathematics of paper folding - Wikipedia

    en.wikipedia.org/wiki/Mathematics_of_paper_folding

    Doubling the cube Doubling the cube: PB/PA = cube root of 2. The classical problem of doubling the cube can be solved using origami. This construction is due to Peter Messer: A square of paper is first creased into three equal strips as shown in the diagram. Then the bottom edge is positioned so the corner point P is on the top edge and the ...

  5. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    A cube has all multiplicities divisible by 3 (it is of the form a 3 for some a). The first: 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000, 1331, 1728 (sequence A000578 in the OEIS). A perfect power has a common divisor m > 1 for all multiplicities (it is of the form a m for some a > 1 and m > 1).

  6. Quartic function - Wikipedia

    en.wikipedia.org/wiki/Quartic_function

    In algebra, a quartic function is a function of the form. α. where a is nonzero, which is defined by a polynomial of degree four, called a quartic polynomial . A quartic equation, or equation of the fourth degree, is an equation that equates a quartic polynomial to zero, of the form. where a ≠ 0. [1]

  7. Generalized continued fraction - Wikipedia

    en.wikipedia.org/wiki/Generalized_continued_fraction

    A generalized continued fraction is an expression of the form. where the an ( n > 0) are the partial numerators, the bn are the partial denominators, and the leading term b0 is called the integer part of the continued fraction. The successive convergents of the continued fraction are formed by applying the fundamental recurrence formulas :

  8. Squared triangular number - Wikipedia

    en.wikipedia.org/wiki/Squared_triangular_number

    A square whose side length is a triangular number can be partitioned into squares and half-squares whose areas add to cubes. From Gulley (2010).The nth coloured region shows n squares of dimension n by n (the rectangle is 1 evenly divided square), hence the area of the nth region is n times n x n.

  9. Halley's method - Wikipedia

    en.wikipedia.org/wiki/Halley's_method

    Halley's method. In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. Edmond Halley was an English mathematician and astronomer who introduced the method now called by his name. The algorithm is second in the class of Householder's methods, after Newton's ...