Search Results for ""

Let p be an irregular prime, and let P=rp+1 be a prime with P<p^2-p. Also let t be an integer such that t^3≢1 (mod P). For an irregular pair (p,2k), form the product ...

An infinite sequence of positive integers a_i satisfying 1<=a_1<a_2<a_3<... (1) is an A-sequence if no a_k is the sum of two or more distinct earlier terms (Guy 1994). Such ...

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...

Algebraic geometry is the study of geometries that come from algebra, in particular, from rings. In classical algebraic geometry, the algebra is the ring of polynomials, and ...

Archimedes' axiom, also known as the continuity axiom or Archimedes' lemma, survives in the writings of Eudoxus (Boyer and Merzbach 1991), but the term was first coined by ...

An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

The "Cartesian ovals," sometimes also known as the Cartesian curve or oval of Descartes, are the quartic curve consisting of two ovals. They were first studied by Descartes ...

The complementary subspace problem asks, in general, which closed subspaces of a Banach space are complemented (Johnson and Lindenstrauss 2001). Phillips (1940) proved that ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...