Search Results for ""

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

Consider h_+(d) proper equivalence classes of forms with discriminant d equal to the field discriminant, then they can be subdivided equally into 2^(r-1) genera of ...

A p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...

The Legendre symbol is a number theoretic function (a/p) which is defined to be equal to +/-1 depending on whether a is a quadratic residue modulo p. The definition is ...

Let Gamma be an algebraic curve in a projective space of dimension n, and let p be the prime ideal defining Gamma, and let chi(p,m) be the number of linearly independent ...

If the period of a repeating decimal for a/p, where p is prime and a/p is a reduced fraction, has an even number of digits, then dividing the repeating portion into halves ...

Numbers which are not perfect and for which s(N)=sigma(N)-N<N, or equivalently sigma(n)<2n, where sigma(N) is the divisor function. Deficient numbers are sometimes called ...

Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...

An Euler-Jacobi pseudoprime to a base a is an odd composite number n such that (a,n)=1 and the Jacobi symbol (a/n) satisfies (a/n)=a^((n-1)/2) (mod n) (Guy 1994; but note ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...