Search Results for ""

Gauss stated the reciprocity theorem for the case n=4 x^4=q (mod p) (1) can be solved using the Gaussian integers as ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

Let r and s be positive integers which are relatively prime and let a and b be any two integers. Then there is an integer N such that N=a (mod r) (1) and N=b (mod s). (2) ...

The cross number of a zero-system sigma={g_1,g_2,...,g_n} of G is defined as K(sigma)=sum_(i=1)^n1/(|g_i|) The cross number of a group G has two different definitions. 1. ...

A number is said to be cubefree if its prime factorization contains no tripled factors. All primes are therefore trivially cubefree. The cubefree numbers are 1, 2, 3, 4, 5, ...

The cyclic group C_(11) is unique group of group order 11. An example is the integers modulo 11 under addition (Z_(11)). No modulo multiplication group is isomorphic to ...

Erdős and Heilbronn (Erdős and Graham 1980) posed the problem of estimating from below the number of sums a+b where a in A and b in B range over given sets A,B subset= Z/pZ ...

For a field K with multiplicative identity 1, consider the numbers 2=1+1, 3=1+1+1, 4=1+1+1+1, etc. Either these numbers are all different, in which case we say that K has ...

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...