Search Results for ""

If there is an integer x such that x^4=q (mod p), then q is said to be a biquadratic residue (mod p). If not, q is said to be a biquadratic nonresidue (mod p).

If bc=bd (mod a) and (b,a)=1 (i.e., a and b are relatively prime), then c=d (mod a).

Two complex numbers z=x+iy and z^'=x^'+iy^' are added together componentwise, z+z^'=(x+x^')+i(y+y^'). In component form, (x,y)+(x^',y^')=(x+x^',y+y^') (Krantz 1999, p. 1).

The division of two complex numbers can be accomplished by multiplying the numerator and denominator by the complex conjugate of the denominator, for example, with z_1=a+bi ...

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

A reciprocity theorem for the case n=3 solved by Gauss using "integers" of the form a+brho, when rho is a root of x^2+x+1=0 (i.e., rho equals -(-1)^(1/3) or (-1)^(2/3)) and ...

If there is an integer x such that x^3=q (mod p), then q is said to be a cubic residue (mod p). If not, q is said to be a cubic nonresidue (mod p).

Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).

A set S of positive integers is said to be Diophantine iff there exists a polynomial Q with integral coefficients in m>=1 indeterminates such that ...