Search Results for ""

A congruence of the form f(x)=0 (mod n) where f(x) is an integer polynomial (Nagell 1951, p. 73).

A category of link encompassing both alternating knots and torus knots.

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

A number which can be represented both in the form x_0^2-Dy_0^2 and in the form Dx_1^2-y_1^2. This is only possible when the Pell equation x^2-Dy^2=-1 (1) is solvable. Then ...

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

A vaguely defined branch of mathematics dealing with varieties, the Mordell conjecture, Arakelov theory, and elliptic curves.

Arrow's paradox, also called Arrow's impossibility theorem or the general possibility theorem, states that perfect democratic voting is impossible, not just in practice but ...

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...

A pair of numbers m and n such that sigma(m)=sigma(n)=m+n-1, where sigma(m) is the divisor function. Beck and Najar (1977) found 11 augmented amicable pairs.